Related papers: Brownian Web and Oriented Percolation: Density Bou…
We consider line ensembles of non-intersecting random walks constrained by a hard wall, each tilted by the area underneath it with geometrically growing pre-factors $\mathfrak{b}^i$ where $\mathfrak{b}>1$. This is a model for the level…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
We investigate the Brownian diffusion of particles in one spatial dimension and in the presence of finite regions within which particles can either evaporate or be reset to a given location. For open boundary conditions, we highlight the…
We study $n$ non-intersecting Brownian motions corresponding to initial configurations which have a vanishing density in the large $n$ limit at an interior point of the support. It is understood that the point of vanishing can propagate up…
We study a model of nonintersecting Brownian bridges on an interval with either absorbing or reflecting walls at the boundaries, focusing on the point in space-time at which the particles meet the wall. These processes are determinantal,…
We prove that for a standard Brownian motion, there exists a first-passage-time density function through a locally H\"older continuous curve with exponent greater than 1/2. By using a property of local time of a standard Brownian motion and…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…
In this work we establish a link between two different phenomena that were studied in a large and growing number of biological, composite and soft media: the diffusion in compartmentalized environment and the Brownian yet non-Gaussian…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…
We establish finite time extinction with probability one for weak solutions of the Cauchy-Dirichlet problem for the 1D stochastic porous medium equation with Stratonovich transport noise and compactly supported smooth initial datum.…
We consider an ensemble of $n$ nonintersecting Brownian particles on the unit circle with diffusion parameter $n^{-1/2}$, which are conditioned to begin at the same point and to return to that point after time $T$, but otherwise not to…
On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…
We prove that the rescaled one-point fluctuations of the boundary of the percolation cluster in the Bernoulli-Exponential first passage percolation around the diagonal converge to a new family of distributions. The limit law is indexed by…
In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…
We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the…
Multiple-choice load balancing has been a topic of intense study since the seminal paper of Azar, Broder, Karlin, and Upfal. Questions in this area can be phrased in terms of orientations of a graph, or more generally a k-uniform random…
According to the latest evidence, the Universe is entering an era of exponential expansion, where gravitationally bound structures will get disconnected from each other, forming isolated `island universes'. In this scenario, we present a…
We study delay tolerant networking (DTN) and in particular, its capacity to store, carry and forward messages so that the messages eventually reach their final destinations. We approach this broad question in the framework of percolation…