Results 31 to 40 of about 220,579 (315)
Branching random walks on trees
AbstractLet p(x, y) be the transition probability of an isotropic random walk on a tree, where each site has d ⩾3 neighbors. We define a branching random walk by letting a particle at site x give birth to a new particle at site y at rate λdp(x, y), jump to y at rate vdp(x, y), and die at rate δ.
Rinaldo B. Schinazi, Neal Madras
openaire +2 more sources
Theory of Branching and Annihilating Random Walks [PDF]
4 pages, revtex, no figures; final version with slight changes, now accepted for publication in Phys.
Cardy, J, Täuber, U
openaire +4 more sources
COVER TIME FOR THE FROG MODEL ON TREES
The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $\unicode[STIX]{x1D707}$ on the full $d$-ary tree of height $n$.
CHRISTOPHER HOFFMAN+2 more
doaj +1 more source
A branching random walk among disasters [PDF]
We consider a branching random walk in a random space-time environment of disasters where each particle is killed when meeting a disaster. This extends the model of the "random walk in a disastrous random environment" introduced by [15]. We obtain a criterion for positive survival probability, see Theorem 1.
Gantert, Nina, Junk, Stefan
openaire +6 more sources
Global survival of branching random walks and tree-like branching random walks
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $ $. There is a threshold for $ $, which is called $ _w$, that separates almost sure global extinction from global survival. Analogously, there exists another threshold $ _s$ below which any site is visited almost surely a finite number of ...
Bertacchi, Daniela+2 more
openaire +4 more sources
This review discusses the use of Surface‐Enhanced Raman Spectroscopy (SERS) combined with Artificial Intelligence (AI) for detecting antimicrobial resistance (AMR). Various SERS studies used with AI techniques, including machine learning and deep learning, are analyzed for their advantages and limitations.
Zakarya Al‐Shaebi+4 more
wiley +1 more source
A probabilistic model for martensitic avalanches
We present a probabilistic model for the description of martensitic avalanches. Our approach to the analysis of the model is based on an associated general branching random walk process. Comparisons are reported for numerical and analytical solutions and
Ball John M.+2 more
doaj +1 more source
Biological network growth in complex environments: A computational framework.
Spatial biological networks are abundant on all scales of life, from single cells to ecosystems, and perform various important functions including signal transmission and nutrient transport.
Torsten Johann Paul+1 more
doaj +1 more source
Survival of branching random walks with absorption
We consider a branching random walk on R starting from x >= 0 and with a killing barrier at 0. At each step, particles give birth to b children, which move independently. Particles that enter the negative half-line are killed. In the case of almost sure extinction, we find asymptotics for the survival probability at time a, when a tends to infinity.
Jaffuel, B., Aïdekon, E.
openaire +3 more sources
Branching random walk with selection at critical rate [PDF]
We consider a branching-selection particle system on the real line. In this model the total size of the population at time $n$ is limited by $\exp\left(a n^{1/3}\right)$.
Mallein, Bastien
core +3 more sources