Searcharxiv⌕ Search

arXiv subjects

Renato S. dos Santos

Publications and source records attributed to Renato S. dos Santos.

4 recordsLinked to original sources

The broadcast voter model: Stationary measures

The classical voter model is dual to coalescing random walks, in much the same way that the Kingman coalescent describes genealogies through binary mergers. Motivated by the passage from the Kingman to the~\(Λ\)-coalescent, where multiple mergers are allowed, we introduce the~\(Λ\)-broadcast voter model, in which a voter may transmit its opinion simultaneously to several neighbors according to a mechanism governed by a finite measure~\(Λ\) on~\([0,1]\); the classical voter model is recovered when~\(Λ=δ_0\). We show that our model is well-defined on general graphs with bounded degrees, and we construct a family of stationary measures~\({μ_{α,Λ}}\), parametrized by bounded harmonic functions, that characterize the extremal stationary measures according to the finite or infinite collision property of the underlying random walk. We then study the dependence of the stationary measures on the broadcasting measure $Λ$ through a finite number of its moments. We give general conditions under which different moment profiles yield different stationary measures and obtain, in particular, a complete characterization on trees with bounded degrees and on nearest-neighbour~\(\mathbb Z^d\),~\(d\ge3\). We also prove continuity of the stationary measures with respect to the moment profile. Our main tool is a dual system of coordinated coalescing random walks, whose individual particles are simple random walks but which may jump and coalesce simultaneously; a coupling with independent random walks allows us to relate their long-time behaviour to ordinary random walk collision properties.

math.PR↗

Law of large numbers for ballistic random walks in dynamic random environments under lateral decoupling

We establish a strong law of large numbers for one-dimensional continuous-time random walks in dynamic random environments under two main assumptions: the environment is required to satisfy a decoupling inequality that can be interpreted as a bound on the speed of dependence propagation, while the random walk is assumed to move ballistically with a speed larger than this bound. Applications include environments with strong space-time correlations such as the zero-range process and the asymmetric exclusion process.

math.PR↗

The parabolic Anderson model on a Galton-Watson tree

We study the long-time asymptotics of the total mass of the solution to the parabolic Anderson model (PAM) on a supercritical Galton-Watson random tree with bounded degrees. We identify the second-order contribution to this asymptotics in terms of a variational formula that gives information about the local structure of the region where the solution is concentrated. The analysis behind this formula suggests that, under mild conditions on the model parameters, concentration takes place on a tree with minimal degree. Our approach can be applied to finite locally tree-like random graphs, in a coupled limit where both time and graph size tend to infinity. As an example, we consider the configuration model or, more precisely, the uniform simple random graph with a prescribed degree sequence.

math.PR↗

Law of large numbers for non-elliptic random walks in dynamic random environments

We prove a law of large numbers for a class of $\Z^d$-valued random walks in dynamic random environments, including non-elliptic examples. We assume for the random environment a mixing property called \emph{conditional cone-mixing} and that the random walk tends to stay inside wide enough space-time cones. The proof is based on a generalization of a regeneration scheme developed by Comets and Zeitouni for static random environments and adapted by Avena, den Hollander and Redig to dynamic random environments. A number of one-dimensional examples are given. In some cases, the sign of the speed can be determined.

math.PR↗