Results 21 to 30 of about 220,579 (315)
A Note on the Transience of Critical Branching Random Walks on the Line [PDF]
Gantert and Müller (2006) proved that a critical branching random walk (BRW) on the integer lattice is transient by analyzing this problem within the more general framework of branching Markov chains and making use of Lyapunov functions. The main purpose
Gerold Alsmeyer, Matthias Meiners
doaj +1 more source
Random walk on barely supercritical branching random walk [PDF]
Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $ >1$, conditioned to survive. Let $ _{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according to a simple random walk step distribution.
Remco van der Hofstad+2 more
openaire +4 more sources
Branching processes in random environment die slowly [PDF]
Let $Z_n,n=0,1,\ldots,$ be a branching process evolving in the random environment generated by a sequence of iid generating functions $f_0(s),f_1(s),\ldots,$ and let $S_0=0$, $S_k=X_1+ \ldots +X_k,k \geq 1$, be the associated random walk with $X_i=\log ...
Vladimir Vatutin, Andreas Kyprianou
doaj +1 more source
We study the random transverse field Ising model on a finite Cayley tree. This enables us to probe key questions arising in other important disordered quantum systems, in particular the Anderson transition and the problem of dirty bosons on the Cayley ...
Ankita Chakrabarti, Cyril Martins, Nicolas Laflorencie, Bertrand Georgeot, Éric Brunet, Gabriel Lemarié
doaj +1 more source
A functional limit law for the profile of plane-oriented recursive trees. [PDF]
We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Henning Sulzbach
doaj +1 more source
The height of the Lyndon tree [PDF]
We consider the set $\mathcal{L ...
Lucas Mercier, Philippe Chassaing
doaj +1 more source
Advancing hybrid quantum–classical computation with real-time execution
The use of mid-circuit measurement and qubit reset within quantum programs has been introduced recently and several applications demonstrated that perform conditional branching based on these measurements.
Thomas Lubinski+6 more
doaj +1 more source
AbstractA general method is developed with which various theorems on the mean square convergence of functionals of branching random walks are proven. The results cover extensions and generalizations of classical central limit analogues as well as a result of a different type.
Asmussen, Søren, Kaplan, Norman
openaire +4 more sources
Branching random walks and multi-type contact-processes on the percolation cluster of ${\mathbb{Z}}^{d}$ [PDF]
In this paper we prove that, under the assumption of quasi-transitivity, if a branching random walk on ${{\mathbb{Z}}^d}$ survives locally (at arbitrarily large times there are individuals alive at the origin), then so does the same process when ...
Bertacchi, Daniela, Zucca, Fabio
core +2 more sources
Survival of Branching Random Walks in Random Environment [PDF]
We study survival of nearest-neighbour branching random walks in random environment (BRWRE) on ${\mathbb Z}$. A priori there are three different regimes of survival: global survival, local survival, and strong local survival. We show that local and strong local survival regimes coincide for BRWRE and that they can be characterized with the spectral ...
Serguei Popov+3 more
openaire +5 more sources