Results 11 to 20 of about 1,441 (88)
Fluid queues driven by a birth and death process with alternating flow rates
Fluid queue driven by a birth and death process (BDP) with only one negative effective input rate has been considered in the literature. As an alternative, here we consider a fluid queue in which the input is characterized by a BDP with alternating positive and negative flow rates on a finite state space. Also, the BDP has two alternating arrival rates
P. R. Parthasarathy +2 more
wiley +1 more source
The transient probabilities for a simple birth‐death‐immigration process are considered. Catastrophes occur at a constant rate, and when they occur, reduce the population to size zero.
Randall J. Swift
wiley +1 more source
Boundedness of one‐dimensional branching Markov processes
A general model of a branching Markov process on ℝ is considered. Sufficient and necessary conditions are given for the random variable to be finite. Here Ξk(t) is the position of the kth particle, and N(t) is the size of the population at time t. For some classes of processes (smooth branching diffusions with Feller‐type boundary points), this results
F. I. Karpelevich, Yu. M. Suhov
wiley +1 more source
Population‐size‐dependent branching processes
In a recent paper [7] a coupling method was used to show that if population size, or more generally population history, influence upon individual reproduction in growing, branching‐style populations disappears after some random time, then the classical Malthusian properties of exponential growth and stabilization of composition persist.
Peter Jagers
wiley +1 more source
Balls left empty by a critical branching Wiener process
At time t = 0 we have a Poisson random field on ℝd. Each particle executes a critical branching Wiener process starting from its position at time t = 0. Let RT be the radius of the largest ball around the origin of ℝd which does not contain any particle at time T. Our goal is to characterize the properties of the stochastic process {RT, T ≥ 0}.
Pál Révész
wiley +1 more source
On the distribution of the number of vertices in layers of random trees
Denote by Sn the set of all distinct rooted trees with n labeled vertices. A tree is chosen at random in the set Sn, assuming that all the possible nn−1 choices are equally probable. Define τn(m) as the number of vertices in layer m, that is, the number of vertices at a distance m from the root of the tree. The distance of a vertex from the root is the
Lajos Takács
wiley +1 more source
Conditional limit theorems for branching processes
Let [ξ(m), m = 0, 1, 2, …] be a branching process in which each individual reproduces independently of the others and has probability pj(j = 0, 1, 2, …) of giving rise to j descendants in the following generation. The random variable ξ(m) is the number of individuals in the mth generation. It is assumed that P{ξ(0) = 1} = 1.
Lajos Takács
wiley +1 more source
Queues, random graphs and branching processes
In this paper it is shown that certain basic results of queueing theory can be used successfully in solving various problems of random graphs and branching processes.
Lajos Takács
wiley +1 more source
Estimation of the Offspring Mean in a General Single-Type Size-Dependent Branching Process [PDF]
2000 Mathematics Subject Classification: 60J80, 62F12, 62P10We consider a general single-type size-dependent branching ...
Jacob, Christine, Lalam, Nadia
core
T. E. Harris and branching processes
T. E. Harris was a pioneer par excellence in many fields of probability theory. In this paper, we give a brief survey of the many fundamental contributions of Harris to the theory of branching processes, starting with his doctoral work at Princeton in ...
Athreya, K. B., Ney, P. E.
core +1 more source

