Related papers: Long paths in first passage percolation on the com…
In this paper we establish a connection between epidemic models on random networks with general infection times considered in Barbour and Reinert 2013 and first passage percolation. Using techniques developed in Bhamidi, van der Hofstad,…
We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
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…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
We consider the branching random walk $\{\mathcal R^N_z: z\in V_N\}$ with Gaussian increments indexed over a two-dimensional box $V_N$ of side length $N$, and we study the first passage percolation where each vertex is assigned weight…
We study local modifications of the graph distance in large random triangulations. Our main results show that, in large scales, the modified distance behaves like a deterministic constant $\mathbf{c}~\in~(0,\infty)$ times the usual graph…
We study the statistics of the optimal path in both random and scale free networks, where weights $w$ are taken from a general distribution $P(w)$. We find that different types of disorder lead to the same universal behavior. Specifically,…
In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a penalty factor polynomial in their expected degrees. Based on…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We consider directed random graphs, the prototype of which being the Barak-Erd\H{o}s graph $\vec G(\mathbb Z, p)$, and study the way that long (or heavy, if weights are present) paths grow. This is done by relating the graphs to certain…
We consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we associate with each edge $e$ of the graph a passage time $t(e)$ taking values in $[0,+\infty]$, such that $\mathbb{P}[t(e)<+\infty] >p_c(d)$. Equivalently, we…
In first-passage percolation (FPP), we let $(\tau_v)$ be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If $F$ is the distribution function of $\tau_v$, there are…
This study delves into first-passage percolation on random geometric graphs in the supercritical regime, where the graphs exhibit a unique infinite connected component. We investigate properties such as geodesic paths, moderate deviations,…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…
In first-passage percolation, we assign i.i.d.~nonnegative weights $(t_e)$ to the nearest-neighbor edges of $\mathbb{Z}^d$ and study the induced pseudometric $T = T(x,y)$. In this paper, we focus on geodesics, or optimal paths for $T$, and…
Consider first passage percolation on $\mathbb{Z}^d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all…
In the models of first-passage percolation and directed first-passage percolation on $\mathbb{Z}^d$, we consider a family of i.i.d. random variables indexed by the set of edges of the graph, called passage times. For every vertex $x \in…
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…