Related papers: A Central Limit Theorem for First Passage Percolat…

Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…

In this article, we consider a generalized First-passage percolation model, where each edge in $\mathbb{Z}^d$ is independently assigned an infinite weight with probability $1-p$, and a random finite weight otherwise. The existence and…

We consider the first passage percolation model on the square lattice with an edge weight distribution F. In this paper, we consider the number of optimal paths for two points separated by a long distance. We show that there is a phase…

The inverse first-passage time problem determines a boundary such that the first-passage time of a Wiener process to this boundary has a given distribution. An approximation which is based on the starting value of the boundary to a smooth…

In 1993 van den Berg and Kesten proved a strict monotonicity theorem for first passage percolation on $\mathbb{Z}^d$, $d \ge 2$: given two probability measures $\nu$ and $\tilde{\nu}$ with finite mean, if $\tilde{\nu}$ is strictly more…

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…

In directed last passage site percolation with i.i.d.~random weights with finite support over a $n\times\lfloor n^{\alpha}\rfloor$ grid, we prove that for $n$ large enough, the order of the $r$-th central moment, $1\le r<+\infty$, of the…

One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…

We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-passage percolation distance concentrates in an…

We prove central limit theorems for the random walks on either the mapping class group of a closed, connected, orientable, hyperbolic surface, or on $\text{Out}(F_N)$, each time under a finite second moment condition on the measure (either…

We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…

We consider first-passage percolation on $\mathbb Z^2$ with independent and identically distributed weights whose common distribution is absolutely continuous with a finite exponential moment. Under the assumption that the limit shape has…

The minimal spanning forest on $\mathbb{Z}^{d}$ is known to consist of a single tree for $d \leq 2$ and is conjectured to consist of infinitely many trees for large $d$. In this paper, we prove that there is a single tree for quasi-planar…

We prove that if $(G_n)_{n\geq1}=((V_n,E_n))_{n\geq 1}$ is a sequence of finite, vertex-transitive graphs with bounded degrees and $|V_n|\to\infty$ that is at least $(1+\epsilon)$-dimensional for some $\epsilon>0$ in the sense that…

We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…

Consider the first passage percolation model on ${\bf Z}^d$ for $d\geq 2$. In this model we assign independently to each edge the value zero with probability $p$ and the value one with probability $1-p$. We denote by $T({\bf 0}, v)$ the…

We prove a Functional Central Limit Theorem for the position of a Tagged Particle in the one-dimensional Asymmetric Simple Exclusion Process in the hyperbolic scaling, starting from a Bernoulli product measure conditioned to have a particle…

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…