Related papers: The oriented swap process and last passage percola…
For the last passage percolation (LPP) on $\mathbb{Z}^2$ with exponential passage times, let $T_{n}$ denote the passage time from $(1,1)$ to $(n,n)$. We investigate the law of iterated logarithm of the sequence $\{T_{n}\}_{n\geq 1}$; we…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
The diffusion and bootstrap percolation models were studied in regular random and Erd\H{o}s-R\'{e}nyi networks using the modified Newman-Ziff algorithms. We calculated the percolation threshold and the order parameter of the percolation…
The model of Brownian Percolation has been introduced as an approximation of discrete last-passage percolation models close to the axis. It allowed to compute some explicit limits and prove fluctuation theorems for these, based on the…
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with…
We study the phase transition phenomena for long-range oriented percolation and contact process. We studied a contact process in which the range of each vertex are independent, updated dynamically and given by some distribution $N$. We also…
In this short article, we will focus on the different links between some stochastic processes resulting from Brownian motion and two notions of probability theory (proportional increments and last hitting times).
In this paper we prove some combinatorial identities which can be considered as generalizations and variations of remarkable Chu-Vandermonde identity. These identities are proved by using an elementary combinatorial-probabilistic approach…
In this note we investigate the last passage percolation model in the presence of macroscopic inhomogeneity. We analyze how this affects the scaling limit of the passage time, leading to a variational problem that provides an ODE for the…
Using the fact that the Airy process describes the limiting fluctuations of the Hammersley last-passage percolation model, we prove that it behaves locally like a Brownian motion. Our method is quite straightforward, and it is based on a…
We introduce and study a non-oriented first passage percolation model having a property of statistical invariance by time reversal. This model is defined in a graph having directed edges and the passage times associated with each set of…
This paper proves an equality in law between the invariant measure of a reflected system of Brownian motions and a vector of point-to-line last passage percolation times in a discrete random environment. A consequence describes the…
We study the phase transition phenomenon inherent in the shuffled (permuted) regression problem, which has found numerous applications in databases, privacy, data analysis, etc. In this study, we aim to precisely identify the locations of…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
We consider a last passage percolation model in dimension $1+1$ with potential given by the product of a spatial i.i.d. potential with symmetric bounded distribution and an independent i.i.d. in time sequence of signs. We assume that the…
This article studies several properties of the half-space last passage percolation, in particular the two-time covariance. We show that, when the two end-points are at small macroscopic distance, then the first order correction to the…
We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…
This paper studies subordinate Ornstein-Uhlenbeck (OU) processes, i.e., OU diffusions time changed by L\'{e}vy subordinators. We construct their sample path decomposition, show that they possess mean-reverting jumps, study their equivalent…
We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…