Related papers: Improved critical drift estimates for the frog mod…
We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…
We study critical branching random walks (BRWs) $U^{(n)}$ on~$\mathbb{Z}_{+}$ where for each $n$, the displacement of an offspring from its parent has drift~$2\beta/\sqrt{n}$ towards the origin and reflection at the origin. We prove that…
Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully…
We study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform…
We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…
We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…
We study bootstrap percolation with the threshold parameter $\theta \geq 2$ and the initial probability $p$ on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of…
We show that the critical density for activated random walk on $\mathbb{Z}^d$ approaches the sleep probability as $d \to \infty$ and provide the first-order correction.
It has been postulated that the brain operates in a self-organized critical state that brings multiple benefits, such as optimal sensitivity to input. Thus far, self-organized criticality has typically been depicted as a one-dimensional…
We study the existence and the exponential ergodicity of a general interacting particle system, whose components are driven by independent diffusion processes with values in an open subset of $\mathds{R}^d$, $d\geq 1$. The interaction…
We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
We show that Activated Random Walk on $\mathbb{Z}$ is explosive above criticality. That is, activating a single particle in a supercritical state of sleeping particles triggers an infinite avalanche of activity with positive probability.…
This paper is concerned with contact process with random vertex weights on regular trees, and study the asymptotic behavior of the critical infection rate as the degree of the trees increasing to infinity. In this model, the infection…
In this paper we present a recurrence criterion for the frog model on $\mathbb{Z}^d$ with an i.i.d. initial configuration of sleeping frogs and such that the underlying random walk has a drift to the right.
We investigate the statistics of extremal path(s) (both the shortest and the longest) from the root to the bottom of a Cayley tree. The lengths of the edges are assumed to be independent identically distributed random variables drawn from a…
We study the critical centered branching random walk with offspring and displacement distributions having finite variance, under minimal assumptions on its structure. We show that the probability that the position of the right-most particle…
It is known that maximal entropy random walks and partition functions that count long paths on graphs tend to become localized near nodes with a high degree. Here, we revisit the simplest toy model of such a localization: a regular tree of…
We study a finite-horizon stochastic control criterion for non-convex optimization in which Brownian exploration is balanced against a quadratic control cost. Rather than emphasizing the classical Hopf--Cole representation, we isolate the…
We consider the Ising model on a general tree under various boundary conditions: all plus, free and spin-glass. In each case, we determine when the root is influenced by the boundary values in the limit as the boundary recedes to infinity.…