A continuous-time analogue of random walk in a random environment

1980 ◽  
Vol 17 (1) ◽  
pp. 259-264 ◽  
Author(s):  
Grant Ritter

By making the time parameters of a birth and death process random variables, we create a continuous-time analogue of random walk in a random environment. Criteria for recurrence or transience are discussed and an a.s. convergence law is determined.

1980 ◽  
Vol 17 (01) ◽  
pp. 259-264 ◽  
Author(s):  
Grant Ritter

By making the time parameters of a birth and death process random variables, we create a continuous-time analogue of random walk in a random environment. Criteria for recurrence or transience are discussed and an a.s. convergence law is determined.


1981 ◽  
Vol 18 (01) ◽  
pp. 19-30 ◽  
Author(s):  
Robert Cogburn ◽  
William C. Torrez

A generalization to continuous time is given for a discrete-time model of a birth and death process in a random environment. Some important properties of this process in the continuous-time setting are stated and proved including instability and extinction conditions, and when suitable absorbing barriers have been defined, methods are given for the calculation of extinction probabilities and the expected duration of the process.


1981 ◽  
Vol 18 (1) ◽  
pp. 19-30 ◽  
Author(s):  
Robert Cogburn ◽  
William C. Torrez

A generalization to continuous time is given for a discrete-time model of a birth and death process in a random environment. Some important properties of this process in the continuous-time setting are stated and proved including instability and extinction conditions, and when suitable absorbing barriers have been defined, methods are given for the calculation of extinction probabilities and the expected duration of the process.


1967 ◽  
Vol 4 (2) ◽  
pp. 402-405 ◽  
Author(s):  
H. D. Miller

Let X(t) be the position at time t of a particle undergoing a simple symmetrical random walk in continuous time, i.e. the particle starts at the origin at time t = 0 and at times T1, T1 + T2, … it undergoes jumps ξ1, ξ2, …, where the time intervals T1, T2, … between successive jumps are mutually independent random variables each following the exponential density e–t while the jumps, which are independent of the τi, are mutually independent random variables with the distribution . The process X(t) is clearly a Markov process whose state space is the set of all integers.


1986 ◽  
Vol 38 (2) ◽  
pp. 397-415 ◽  
Author(s):  
Jairo Charris ◽  
Mourad E. H. Ismail

A birth and death process is a stationary Markov process whose states are the nonnegative integers and the transition probabilities(1.1)satisfy(1.2)as t → 0. Here we assume βn > 0, δn + 1 > 0, n = 0, 1, …, but δ0 ≦ 0. Karlin and McGregor [10], [11], [12], showed that each birth and death process gives rise to two sets of orthogonal polynomials. The first is the set of birth and death process polynomials {Qn(x)} generated by


2002 ◽  
Vol 166 ◽  
pp. 93-115
Author(s):  
Kanji Ichihara

AbstractA birth and death process in a time-dependent random environment is introduced. We will discuss the recurrence and transience properties for the process.


2020 ◽  
Vol 10 (1) ◽  
Author(s):  
F. Di Lauro ◽  
J.-C. Croix ◽  
M. Dashti ◽  
L. Berthouze ◽  
I. Z. Kiss

Abstract Using the continuous-time susceptible-infected-susceptible (SIS) model on networks, we investigate the problem of inferring the class of the underlying network when epidemic data is only available at population-level (i.e., the number of infected individuals at a finite set of discrete times of a single realisation of the epidemic), the only information likely to be available in real world settings. To tackle this, epidemics on networks are approximated by a Birth-and-Death process which keeps track of the number of infected nodes at population level. The rates of this surrogate model encode both the structure of the underlying network and disease dynamics. We use extensive simulations over Regular, Erdős–Rényi and Barabási–Albert networks to build network class-specific priors for these rates. We then use Bayesian model selection to recover the most likely underlying network class, based only on a single realisation of the epidemic. We show that the proposed methodology yields good results on both synthetic and real-world networks.


2003 ◽  
Vol 40 (4) ◽  
pp. 980-994 ◽  
Author(s):  
Johannes Müller ◽  
Martin Möhle

We consider a stochastic graph generated by a continuous-time birth-and-death process with exponentially distributed waiting times. The vertices are the living particles, directed edges go from mothers to daughters. The size and the structure of the connected components are investigated. Furthermore, the number of connected components is determined.


Sign in / Sign up

Export Citation Format

Share Document