Related papers: First passage percolation in sparse random graphs …

We present a survey of techniques to obtain upper bounds for the variance of the passage time in first-passage percolation. The methods discussed are a combination of tools from the theory of concentration of measure, some of which we…

Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…

We introduce and study derivatives in first-passage percolation with edge weights given by i.i.d. random variables supported on ${a,b}$. We show that the variance of the passage time can be expressed in terms of these derivatives. We…

Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…

We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…

First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…

We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…

Human to human transmissible infectious diseases spread in a population using human interactions as its transmission vector. The early stages of such an outbreak can be modeled by a graph whose edges encode these interactions between…

A class of spiking neuronal models with threshold 2 is considered. It is defined by a set of conditions typical for basic threshold-type models, such as the leaky integrate-and-fire (LIF) or the binding neuron model and also for some…

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…

Recently, De Martino et al have presented a general framework for the study of transportation phenomena on complex networks. One of their most significant achievements was a deeper understanding of the phase transition from the uncongested…

We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…

Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…

In this paper we offer a solution to a long-standing problem in the study of networks. Message passing is a fundamental technique for calculations on networks and graphs. The first versions of the method appeared in the 1930s and over the…

The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces…

We study directed last passage percolation on the first quadrant of the planar square lattice whose weights have general distributions, or equivalently, ./G/1 queues in series. The service time distributions of the servers vary randomly…

How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations over the last decade1. The importance of FPTs originates from…

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…

Background: Recently developed techniques to study the spread of infectious diseases through networks make assumptions that the initial proportion infected is infinitesimal and the population behavior is static throughout the epidemic. The…