Related papers: Spreading and shortest paths in systems with spars…
Modeling long-range epidemic spreading in a random environment, we consider a quenched disordered, $d$-dimensional contact process with infection rates decaying with the distance as $1/r^{d+\sigma}$. We study the dynamical behavior of the…
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence…
Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and…
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 investigate the statistics of extremal path(s) (both the shortest and the longest) from the root to the bottom of a Cayley tree. The lengths of the edges are assumed to be independent identically distributed random variables drawn from a…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
Long DNA molecules can be mapped by cutting them with restriction enzymes inside a narrow channel. Once cut, the individual fragments thus produced move away from each other due to diffusion and entropic effects. We investigate how long it…
We considered diffusion-driven processes on small-world networks with distance-dependent random links. The study of diffusion on such networks is motivated by transport on randomly folded polymer chains, synchronization problems in…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
We analyze the propagation of activity in a system of mobile automata. A number r L^d of elements move as random walkers on a lattice of dimension d, while with a small probability p they can jump to any empty site in the system. We show…
We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points…
The spreading of evolutionary novelties across populations is the central element of adaptation. Unless population are well-mixed (like bacteria in a shaken test tube), the spreading dynamics not only depends on fitness differences but also…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
Using Monte-Carlo simulations, we determine the scaling form for the probability distribution of the shortest path, $\ell$, between two lines in a 3-dimensional percolation system at criticality; the two lines can have arbitrary positions,…
We carry out a high-precision Monte Carlo study of the shortest-path fractal dimension $\dm$ for percolation in two and three dimensions, using the Leath-Alexandrowicz method which grows a cluster from an active seed site. A variety of…
Dijkstra's algorithm is the standard method for computing shortest paths on arbitrary graphs. However, it is slow for large graphs, taking at least linear time. It has been long known that for real world road networks, creating a hierarchy…
We investigate the behaviour of the shortest path on a directed two-dimensional square lattice for bond percolation at the critical probability $p_c$ . We observe that flipping an edge lying on the shortest path has a non-local effect in…
We study the distributions of traveling length l and minimal traveling time t through two-dimensional percolation porous media characterized by long-range spatial correlations. We model the dynamics of fluid displacement by the convective…