Related papers: The Brownian Net with Killing
We study the random connection model driven by a stationary Poisson process. In the first part of the paper, we derive a lace expansion with remainder term in the continuum and bound the coefficients using a new version of the BK…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We extend existing connections between random walks, branching processes, and spatial branching processes, and their respective scaling limits, to include processes in dependent random environments. More specifically, we prove new scaling…
A new type of dependent thinning for point processes in continuous space is proposed, which leverages the advantages of determinantal point processes defined on finite spaces and, as such, is particularly amenable to statistical, numerical,…
We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…
Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
Inspired by the recent work of Bertini and Posta, who introduced the boundary driven Brownian gas on $[0,1]$, we study boundary driven systems of independent particles in a general setting, including particles jumping on finite graphs and…
Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to…
Previously, Sarkar and Sun have shown that for supercritical oriented percolation in dimension $1+1$, the set of rightmost infinite open paths converges to the Brownian web after proper centering and scaling. In this note, we show that a…
Consider non-intersecting Brownian motions on the real line, starting from the origin at t=0, with a number of particles forced to reach p distinct target points at time t=1. This work shows that the transition probability, that is the…
We study condensation in several particle systems related to the inclusion process. For an asymmetric one-dimensional version with closed boundary conditions and drift to the right, we show that all but a finite number of particles condense…
In this note - starting from $d$-dimensional (with $d>1$) fuzzy vectors - we prove Donsker's classical invariance principle. We consider a fuzzy random walk ${S^*_n}=X^*_1+\cdots+X^*_n,$ where $\{X^*_i\}_1^{\infty}$ is a sequence of…
Proofs of sharp phase transition and noise sensitivity in percolation have been significantly simplified by the use of randomized algorithms, via the OSSS inequality (proved by O'Donnell, Saks, Schramm and Servedio (2005)) and the…
In this work we consider time series with a finite number of discrete point changes. We assume that the data in each segment follows a different probability density functions (pdf). We focus on the case where the data in all segments are…
A discrete model of Brownian sticky flows on the unit circle is described: it is constructed with products of Beta matrices on the discrete torus. Sticky flows are defined by their ``moments'' which are consistent systems of transition…
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…
We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…
We study biased random walks on dynamical percolation in $\mathbb{Z}^d$, which were recently introduced by Andres et al. We provide a second order expansion for the asymptotic speed and show for $d \ge 2$ that the speed of the biased random…