Related papers: The shape of shortest paths in random spatial netw…
We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…
We consider a wide class of ergodic first passage percolation processes on Z^2 and prove that there exist at least four one-sided geodesics a.s. We also show that coexistence is possible with positive probability in a four color…
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…
We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the…
In this paper, we consider the random walk process on a kind of fractal (or transfractal) scale free networks, which also called as $(u,v)$ flowers, and we focus on the global first passage time (GFPT) and first return time (FRT). Here, we…
For rotationally invariant first passage percolation (FPP) on the plane, we use a multi-scale argument to prove stretched exponential concentration of the first passage times at the scale of the standard deviation. Our results are proved…
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$,…
As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…
In the context of first-passage percolation (FPP), we investigate the statistical properties of the selected link-times (SLTs) -the random link times comprising the optimal paths (or geodesics) connecting two given points. We focus on…
We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…
We present general methods to exactly calculate mean-first passage quantities on self-similar networks defined recursively. In particular, we calculate the mean first-passage time and the splitting probabilities associated to a source and…
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…
For the exactly solvable model of exponential last passage percolation on $\mathbb{Z}^2$, consider the geodesic $\Gamma_n$ joining $(0,0)$ and $(n,n)$ for large $n$. It is well known that the transversal fluctuation of $\Gamma_n$ around the…
We consider the mean distribution functions Phi(r|l), Phi(B)(r|l), and Phi(S)(r|l), giving the probability that two sites on the incipient percolation cluster, on its backbone and on its skeleton, respectively, connected by a shortest path…
We prove $\sqrt{\log n}$ lower bounds on the order of growth fluctuations in three planar growth models (first-passage percolation, last-passage percolation, and directed polymers) under no assumptions on the distribution of vertex or edge…
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…