Related papers: Asymptotics of first-passage percolation on 1-dime…

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges. An open question attributed to Furstenberg is whether there exists a two-sided infinite geodesic in first passage…

We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…

We consider directed first-passage and last-passage percolation on the nonnegative lattice Z_+^d, d\geq2, with i.i.d. weights at the vertices. Under certain moment conditions on the common distribution of the weights, the limits…

We consider large random planar maps and study the first-passage percolation distance obtained by assigning independent identically distributed lengths to the edges. We consider the cases of quadrangulations and of general planar maps. In…

This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence…

We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…

We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…

It is known that the longest simple path in the divisor graph that uses integers $\leq N$ is of length $\asymp N/\log N$. We study the partitions of $\{1,2,\dots, N\}$ into a minimal number of paths of the divisor graph, and we show that in…

Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…

For transport processes in geometrically restricted domains, the mean first-passage time (MFPT) admits a general scaling dependence on space parameters for diffusion, anomalous diffusion, and diffusion in disordered or fractal media. For…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

In first-passage percolation (FPP), one places nonnegative random variables (weights) $(t_e)$ on the edges of a graph and studies the induced weighted graph metric. We consider FPP on $\mathbb{Z}^d$ for $d \geq 2$ and analyze the geometric…

We explore first-passage phenomenology for biased active processes with a renewal-type structure, focusing in particular on paradigmatic run-and-tumble models in both discrete and continuous state spaces. In general, we show there is no…

In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of Z d. A geodesic is an optimal path for the passage times T (e). Consider a local property of the time environment. We call it a pattern. We…

The first of $N$ identical independently distributed (i.i.d.) Brownian trajectories that arrives to a small target, sets the time scale of activation, which in general is much faster than the arrival to the target of only a single…

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

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…

First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…