Related papers: Convex bounds for last passage percolation with de…

We consider the infinite directed graph with vertices the set of integers ...,-2,-1,0,1,2,... . Let v be a random variable taking either finite values or value "minus infinity". Consider random weights v(j,k), indexed by pairs (j,k) of…

In this paper, we study a transient spatially inhomogeneous random walk with asymptotically zero drifts on the lattice of the positive half line. We give criteria for the finiteness of the number of points having exactly the same local time…

In last passage percolation models lying in the KPZ universality class, the energy of long energy-maximizing paths may be studied as a function of the paths' pair of endpoint locations. Scaled coordinates may be introduced, so that these…

Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…

The goal of the present work is three-fold. The first goal is to set foundational results on optimal transport in Lorentzian (pre-)length spaces, including cyclical monotonicity, stability of optimal couplings and Kantorovich duality…

The Euclidean first-passage percolation (FPP) model of Howard and Newman is a rotationally invariant model of FPP which is built on a graph whose vertices are the points of homogeneous Poisson point process. It was shown that one has…

We calculate the p-the moment of the sum of n independent random variables with respect to symmetric norm in R^n. The order of growth for upper bound p/ln p obtained in ths estimate is optimal. The result extends to generalized Lorentz…

Consider $M_n$ the maximal position at generation $n$ of a supercritical branching random walk. A\"id\'ekon (2013) obtained and described the convergence in law, as time $n$ goes to infinity, of $M_n-m_n$, where $m_n$ is an explicit…

Attach to each edge of the complete graph on $n$ vertices, i.i.d. exponential random variables with mean $n$. Aldous [1] proved that the longest path with average weight below $p$ undergoes a phase transition at $p=\frac{1}{e}$: it is…

We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

Liouville first passage percolation (LFPP) with parameter $\xi >0$ is the family of random distance functions $\{D_h^\epsilon\}_{\epsilon >0}$ on the plane obtained by integrating $e^{\xi h_\epsilon}$ along paths, where $h_\epsilon$ for…

We present new probabilistic and combinatorial identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic…

We consider a tracer particle performing a random walk on a two-dimensional lattice in the presence of immobile hard obstacles. Starting from equilibrium, a constant force pulling on the particle is switched on, driving the system to a new…

We study the two-time distribution in directed last passage percolation with geometric weights in the first quadrant. We compute the scaling limit and show that it is given by a contour integral of a Fredholm determinant.

Study of the KPZ universality class has seen the emergence of universal objects over the past decade which arise as the scaling limit of the member models. One such object is the directed landscape, and it is known that exactly solvable…

A variation of Rosenstock's trapping model in which $N$ independent random walkers are all initially placed upon a site of a one-dimensional lattice in the presence of a {\em one-sided} random distribution (with probability $c$) of…

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…

The Euclidean first-passage percolation model of Howard and Newman is a rotationally invariant percolation model built on a Poisson point process. It is known that the passage time between 0 and $ne_1$ obeys a diffusive upper bound:…