Related papers: Paths with exponential intersection tails and orie…
A random variable $\xi$ has a {\it light-tailed} distribution (for short: is light-tailed) if it possesses a finite exponential moment, $\E \exp (\lambda \xi) <\infty$ for some $\lambda >0$, and has a {\it heavy-tailed} distribution (is…
We investigate properties of two-dimensional finite-scale percolation systems whose size along the current flow is smaller than the perpendicular size. Successive thresholds of appearing multiple percolation channels in such systems have…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
We investigate a driven two-channel system where particles on different lanes mutually obstruct each others motion extending an earlier model by Popkov and Peschel [1]. This obstruction may occur in biological contexts due to steric…
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…
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…
We show that a single particle in a superposition of different paths can entangle two objects located on each path. The entanglement has its maximum visibility for intermediate coupling strengths. In particular, when the two quantum systems…
We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with…
We extend path analysis by giving sufficient conditions for computing the partial covariance of two random variables from their covariance. This is specifically done by correcting the covariance with the product of some partial variance…
We study the behavior of the optimal path between two sites separated by a distance $r$ on a $d$-dimensional lattice of linear size $L$ with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a…
We consider last-passage percolation models in two dimensions, in which the underlying weight distribution has a heavy tail of index alpha<2. We prove scaling laws and asymptotic distributions, both for the passage times and for the shape…
Following the recent investigations of Baik and Suidan in \cite{baik2005gcl} and Bodineau and Martin in \cite{bodineau2005upl}, we prove large deviation properties for a last-passage percolation model in $\mathbb{Z}^{2}_{+}$ whose paths are…
We consider inhomogeneous percolation on a hierarchical configuration model with a heavy-tailed degree distribution. This graph is the configuration model where all the half-edges are colored either black or white, and edges are formed by…
Consider a graph in which each site is endowed with a value called \emph{fitness}. A path in the graph is said to be "open" or "accessible" if the fitness values along that path is strictly increasing. We say that there is accessibility…
Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…
We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…
We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…
Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…
Near a parity breaking front bifurcation, small perturbations may reverse the propagation direction of fronts. Often this results in nonsteady asymptotic motion such as breathing and domain breakup. Exploiting the time scale differences of…
We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…