Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExtinction time of the logistic process
121
0
0.0
(
0
)
Authors
Eric Foxall
Ask ChatGPT about the research
No Arabic abstract
The logistic birth and death process is perhaps the simplest stochastic population model that has both density-dependent reproduction, and a phase transition, and a lot can be learned about the process by studying its extinction time, $tau_n$, as a function of system size $n$. A number of existing results describe the scaling of $tau_n$ as $ntoinfty$, for various choices of reproductive rate $r_n$ and initial population $X_n(0)$ as a function of $n$. We collect and complete this picture, obtaining a complete classification of all sequences $(r_n)$ and $(X_n(0))$ for which there exist rescaling parameters $(s_n)$ and $(t_n)$ such that $(tau_n-t_n)/s_n$ converges in distribution as $ntoinfty$, and identifying the limits in each case.
rate research
Read More
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the integer line, in each case we prove that the logarithm of the extinction time divided by the size of the graph converges in probability to a (model-dependent) positive constant. The graphs we treat include various percolation models on increasing boxes of Z d or R d in their supercritical or percolative regimes (Bernoulli bond and site percolation, the occupied and vacant sets of random interlacements, excursion sets of the Gaussian free field, random geometric graphs) as well as supercritical Galton-Watson trees grown up to finite generations.
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a metastable result for the extinction time is also proved.
In this note we give a new method for getting a series of approximations for the extinction probability of the one-dimensional contact process by using the Grobner basis.
In this work, we study a family of non-Markovian trees modeling populations where individuals live and reproduce independently with possibly time-dependent birth-rate and lifetime distribution. To this end, we use the coding process introduced by Lambert. We show that, in our situation, this process is no longer a L{e}vy process but remains a Feller process and we give a complete characterization of its generator. This allows us to study the model through well-known Markov processes techniques. On one hand, introducing a scale function for such processes allows us to get necessary and sufficient conditions for extinction or non-extinction and to characterize the law of such trees conditioned on these events. On the other hand, using Lyapounov drift techniques , we get another set of, easily checkable, sufficient criteria for extinction or non-extinction and some tail estimates for the tree length. Finally, we also study scaling limits of such random trees and observe that the Bessel tree appears naturally.
The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in $[0,infty)$, is ergodic and irreversible. It belongs to the Additive Increase Multiplicative Decrease class of processes. The sample paths are piecewise linear deterministic and the whole randomness of the dynamics comes from the jump mechanism. Several aspects of this process have already been investigated in the literature. In the present paper, we mainly get quantitative estimates for the convergence to equilibrium, in terms of the $W_1$ Wasserstein coupling distance, for the process and also for its embedded chain.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
