Results 1 to 10 of about 1,983,959 (269)
Branching Random Walk with Catalysts [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harry Kesten, Vladas Sidoravicius
exaly +3 more sources
Modeling discourse structure with 2D similarity-based random walks for improved understanding of online conversations [PDF]
The proliferation of social media has made automated classification of online discourse, such as hate speech detection and polarity prediction, an essential task for maintaining digital safety and constructive discussions.
Zaid Almahmoud +3 more
doaj +2 more sources
Branching Random Walks with Ageing
Branching processes are stochastic models describing the evolution of populations in which individuals reproduce and die independently over time. In the classical setting, an individual’s reproductive capacity is fixed throughout its lifetime.
Daniela Bertacchi +2 more
doaj +3 more sources
Computational design of functional random heteropolymers through atomistic simulations. [PDF]
Random heteropolymers (RHPs) are emerging single-chain nanoparticles with great potential in protein mimicry, yet a systematic understanding of how chemical composition and monomer structures govern their structure, dynamics, and hydration remains ...
Tianyi Jin +4 more
doaj +2 more sources
The spread of a catalytic branching random walk
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -αn$ where $α$ is a deterministic constant.
Philippe Carmona, Yueyun Hu
exaly +4 more sources
On the Critical Parameters of Branching Random Walks
Given a discrete spatial structure X, we define continuous-time branching processes {ηt}t≥0 that model a population breeding and dying on X. These processes are usually called branching random walks, and ηt(x) denotes the number of individuals alive at ...
Daniela Bertacchi, Fabio Zucca
doaj +3 more sources
Minimal Positions in a Branching Random Walk
Particles in a supercritical Galton-Watson process have positions attached to them in the following way. The initial ancestor is at the origin; the first generation positions are given by a point process \(Z\); each \(n\)th generation person's family are placed, relative to the parent, using an independent copy of \(Z\).
Colin McDiarmid
exaly +4 more sources
Moments of Moments and Branching Random Walks [PDF]
AbstractWe calculate, for a branching random walk $$X_n(l)$$ X n ( l ) to a leaf l at depth n on a binary
E. C. Bailey, J. P. Keating
openaire +4 more sources
Branching Random Walks with Two Types of Particles on Multidimensional Lattices
We consider a continuous-time branching random walk on a multidimensional lattice with two types of particles and an infinite number of initial particles.
Iuliia Makarova +3 more
doaj +1 more source
Coalescing-Branching Random Walks on Graphs [PDF]
We study a distributed randomized information propagation mechanism in networks we call the coalescing-branching random walk (cobra walk, for short). A cobra walk is a generalization of the well-studied “standard” random walk, and is useful in modeling and understanding the Susceptible-Infected- Susceptible (SIS ...
Chinmoy Dutta +3 more
openaire +7 more sources

