Bisexual Galton‐Watson Branching Process in Varying Environments

Abstract

In this paper we introduce a bisexual Galton‐Watson branching process (BGWP) in which the offspring probability distribution is different in each generation. We obtain some relations among the probability generating functions (pgf) involved in the model and, making use of mean growth rates and fractional linear functions (flf), we provide sufficient and necessary conditions for its almost sure extinction.     

Simply generated trees,B‐series and Wigner processes

We consider simply generated trees, like rooted plane trees, and consider the problem of computing generating functions of so‐called bare functionals, like the tree factorial, using B‐series from Butcher's theory. We exhibit a special class of functionals from probability theory: the associated generating functions can be seen as limiting traces of product of semi‐circular elements. © 2004 Wiley Periodicals, Inc. Random Struct. Alg. 2004     

Calculation of output characteristics of a priority queue through a busy period analysis

In this paper, we analyze some output characteristics of a discrete-time two-class priority queue by means of probability generating functions. Therefore, we construct a Markov chain which – after analysis – provides a.o. the probability generating functions of the lengths of the busy periods of both classes. It is furthermore shown how performance measures, related to the output process, are calculated from these functions. The queueing model is kept fairly simple to explain the method of analysis of the busy periods and the output characteristics of priority queues as clearly as possible.     

Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials

The probability generating functions of the waiting times for the first success run of length k and for the sooner run and the later run between a success run of length k and a failure run of length r in the second order Markov dependent trials are derived using the probability generating function method and the combinatorial method. Further, the systems of equations of 2^.m conditional probability generating functions of the waiting times in the m-th order Markov dependent trials are given. Since the systems of equations are linear with respect to the conditional probability generating functions, they can be solved exactly, and hence the probability generating functions of the waiting time distributions are obtained. If m is large, some computer algebra systems are available to solve the linear systems of equations.This research was partially supported by the Natural Sciences and Engineering Research Council of Canada.     

Moment solution to an urn model

A subset of Bernard's RD-model (replenishment-depletion) is considered from the viewpoint of the calculus of finite differences. The most general case is considered and includes an urn with balls of many colors, each color being replenished either deterministically or stochastically. Factorial moment generating functions (fmgfs) are employed to define probability generating functions. A new result is given for the two color case defining the fmgf and probability generating function (with probabilities) when the replenishments are positive valued random variables with given factorial moments. This result involves beta integral transforms defining a manifold of discrete distributions. Particular cases relate to hypergeometric discrete distributions.This research was partly supported by Martin Marietta Energy Systems, Inc., under contract DE-AC05-84OR21400 with the U.S. Department of Energy.     

Generalized Waiting Time Problems Associated with Pattern in Polya's Urn Scheme

Let X ₁, X ₂, ... be a sequence obtained by Polya's urn scheme. We consider a waiting time problem for the first occurrence of a pattern in the sequence X ₁, X ₂, ... , which is generalized by a notion score. The main part of our results is derived by the method of generalized probability generating functions. In Polya's urn scheme, the system of equations is composed of the infinite conditional probability generating functions, which can not be solved. Then, we present a new methodology to obtain the truncated probability generating function in a series up to an arbitrary order from the system of infinite equations. Numerical examples are also given in order to illustrate the feasibility of our results. Our results in this paper are not only new but also a first attempt to treat the system of infinite equations.     

随机环境中具有随机控制函数的受控分枝过程

对随机环境中具有随机控制函数的受控分枝过程进行了更为详尽的概率描述和直观解释;证明了此过程是时齐马氏链和随机环境中的马氏链,并对其概率母函数及矩量进行了讨论。     

具有随机控制函数的受控分枝过程

本文研究了具有随机控制函数的受控分枝过程的各类概率母函数间的关系.利用对概率母函数求导的方法,获得了过程的期望和方差,推广了该过程概率母函数和矩量的一些基本结果.     

Probability density functions based weights for ordered weighted averaging (OWA) operators: An example of water quality indices

This paper explores the application of ordered weighted averaging (OWA) operators to develop water quality index, which incorporates an attitudinal dimension in the aggregation process. The major thrust behind selecting the OWA operator for aggregation of multi-criteria is its capability to encompass a range of operators bounded between minimum and maximum. A new approach for generating OWA weight distributions using probability density functions (PDFs) is proposed in this paper. The basic parameters (mean and standard deviation) of the probability density functions can be determined using the number of criteria (e.g., water quality indicators) in the aggregation process.     

Generalized binomial and negative binomial distributions of order<Emphasis Type="Italic">k</Emphasis> by the<Emphasis Type="Italic">l</Emphasis>-overlapping enumeration scheme

In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number of trials and derive the probability generating functions. The present work extends several properties of distributions of orderk and leads us a new type of geneses of the discrete distributions.     

Generalizations of the Goulden–Jackson cluster method

We give several modifications of the Goulden–Jackson cluster method for finding generating functions for words avoiding a given set of forbidden words. Our modifications include functions which can take into account various ‘weights’ on words, including single letter probability distributions, double letter (i.e. pairwise) probability distributions, and triple letter probability distributions. We also describe an alternative, recursive approach to finding such generating functions. We describe Maple implementations of the various modifications. The accompanying Maple package is available at the website for this paper.     

Sooner and Later Waiting Time Problems Based on a Dependent Sequence

This paper introduces a new concept: a binary sequence of order (k,r), which is an extension of a binary sequence of order k and a Markov dependent sequence. The probability functions of the sooner and later waiting time random variables are derived in the binary sequence of order (k,r). The probability generating functions of the sooner and later waiting time distributions are also obtained. Extensions of these results to binary sequence of order (g,h) are also presented.     

MIL-STD-1916中连续抽样方案的流向图方法

本文把转移概率流向图和转移概率母函数的方法引入到对MIL-STD-1916中连续抽样方案的讨论中,给出了抽样方案的平均检出质量函数AOQ,抽查特性函数L(p)和平均检查比率函数AFI全部3项指标的理论推导,为进一步探讨带有停止检查的MIL-STD-1916中连续抽样方案及相应的动态检出质量提供了理论基础。     

随机环境中r维分支链的协方差计算

定义了各种条件多元概率母函数，并利用条件多元概率母函数这一强有力工具研究随机环境中r-维分支链的性质，并给出了其协方差阵的精确计算公式．     

Perturbed Laguerre unitary ensembles,Hankel determinants,and information theory

This article investigates a key information‐theoretic performance metric in multiple‐antenna wireless communications, the so‐called outage probability. The article is partly a review, with the methodology based mainly on [10], while also presenting some new results. The outage probability may be expressed in terms of a moment generating function, which involves a Hankel determinant generated from a perturbed Laguerre weight. For this Hankel determinant, we present two separate integral representations, both involving solutions to certain non‐linear differential equations. In the second case, this is identified with a particular σ‐form of Painlevé V. As an alternative to the Painlevé V, we show that this second integral representation may also be expressed in terms of a non‐linear second order difference equation. Copyright © 2014 John Wiley & Sons, Ltd.     

Finding efficient recursions for risk aggregation by computer algebra

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the assumption that the probability generating function of the claim size be algebraic. The probability generating function of the claim number is supposed to be from the rather general class of D$D$-finite functions.     

Probabilizing parking functions

We explore the link between combinatorics and probability generated by the question “What does a random parking function look like?” This gives rise to novel probabilistic interpretations of some elegant, known generating functions. It leads to new combinatorics: how many parking functions begin with i? We classify features (e.g., the full descent pattern) of parking functions that have exactly the same distribution among parking functions as among all functions. Finally, we develop the link between parking functions and Brownian excursion theory to give examples where the two ensembles differ.     

Start-Up Demonstration Tests Under Markov Dependence Model with Corrective Actions

A general probability model for a start-up demonstration test is studied. The joint probability generating function of some random variables appearing in the Markov dependence model of the start-up demonstration test with corrective actions is derived by the method of probability generating function. By using the probability generating function, several characteristics relating to the distribution are obtained.     

Delay analysis of two batch-service queueing models with batch arrivals: Geo X /Geo c /1

In this paper, we compute the probability generating functions (PGF’s) of the customer delay for two batch-service queueing models with batch arrivals. In the first model, the available server starts a new service whenever the system is not empty (without waiting to fill the capacity), while the server waits until he can serve at full capacity in the second model. Moments can then be obtained from these PGF’s, through which we study and compare both systems. We pay special attention to the influence of the distribution of the arrival batch sizes. The main observation is that the difference between the two policies depends highly on this distribution. Another conclusion is that the results are considerably different as compared to Bernoulli (single) arrivals, which are frequently considered in the literature. This demonstrates the necessity of modeling the arrivals as batches.     

Generalized Pearson Distributions and Related Characterization Problems

This paper is concerned with a Rodrigues' formula for generating new classes of polynomials. The associated density functions belong to the family of generalized Pearson curves, which extends the classical Pearson family. Various properties of these polynomials (degree, orthogonality ...) are investigated and then exploited to derive several related results, especially characterizations, in probability.