The distribution of first hitting times of random walks on directed Erdős–Rényi networks

  title={The distribution of first hitting times of random walks on directed Erdős–R{\'e}nyi networks},
  author={Ido Tishby and Ofer Biham and Eytan Katzav},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
We present analytical results for the distribution of first hitting times of random walkers (RWs) on directed Erdős–Rényi (ER) networks. Starting from a random initial node, a random walker hops randomly along directed edges between adjacent nodes in the network. The path terminates either by the retracing scenario, when the walker enters a node which it has already visited before, or by the trapping scenario, when it becomes trapped in a dead-end node from which it cannot exit. The path length… 

Analytical results for the distribution of cover times of random walks on random regular graphs

We present analytical results for the distribution of cover times of random walks (RWs) on random regular graphs consisting of N nodes of degree c (c ⩾ 3). Starting from a random initial node at time

The interpolation between random walk and self-avoiding walk by avoiding marked sites

The self-avoiding walk (SAW) on a regular lattice is one of the most important and classic problems in statistical mechanics with major applications in polymer chemistry. Random walk is an exactly

"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require

Random walks and diffusion on networks

Financial Centrality and Liquidity Provision

We study an endowment economy in which agents face income risk, as if uncertain returns on a portfolio, and agents can only make transfers in states when they are actively participating in the

What is the central bank of Wikipedia?

Influence of petroleum and gas trade on EU economies from the reduced Google matrix analysis of UN COMTRADE data

The reduced Google matrix (REGOMAX) algorithm is applied to analyze the multiproduct world trade in years 2004–2016 and shows that the REGOMAX approach provides a new and more detailed analysis of trade influence propagation comparing to the usual approach based on export and import flows.



The distribution of first hitting times of randomwalks on Erdős–Rényi networks

Analytical results for the distribution of first hitting times of random walks on Erdős–Rényi networks provide useful insight into the general problem of survival analysis and the statistics of mortality rates when two or more termination scenarios coexist.

The distribution of path lengths of self avoiding walks on Erdős–Rényi networks

An analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks shows that the pruned networks maintain a Poisson degree distribution, with an average degree, 〈 k 〉 t , that decreases linearly in time.

First-passage properties of the Erdos Renyi random graph

An effective medium approximation is developed that predicts that the mean first-passage time between pairs of nodes, as well as all moments of this first- passage time, are insensitive to the fraction p of occupied links.

Self-avoiding walks on scale-free networks.

  • C. Herrero
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
Long-range properties of random SAW's on scale-free networks, characterized by a degree distribution P(k) approximately k(-gamma), and the dependence of alpha on the minimum allowed degree in the network are discussed.

Analytical results for the distribution of shortest path lengths in random networks

We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdős-Rényi networks, based on recursion equations for the shells around a reference

Kinetic growth walks on complex networks

Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions P(k) were considered (k, degree or

Kinetic-growth self-avoiding walks on small-world networks

Abstract.Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is

Random Walks on Lattices. II

Formulas are obtained for the mean first passage times (as well as their dispersion) in random walks from the origin to an arbitrary lattice point on a periodic space lattice with periodic boundary

Average path length in random networks.

The result for 2<alpha<3 shows that structural properties of asymptotic scale-free networks including numerous examples of real-world systems are even more intriguing than ultra-small world behavior noticed in pure scale- free structures and for large system sizes N-->infinity there is a saturation effect for the average path length.

Random graphs with arbitrary degree distributions and their applications.

It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.