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

@article{Tishby2017TheDO,
  title={The distribution of first hitting times of randomwalks on Erdős–R{\'e}nyi networks},
  author={Ido Tishby and Ofer Biham and Eytan Katzav},
  journal={Journal of Physics A},
  year={2017},
  volume={50},
  pages={115001}
}
Analytical results for the distribution of first hitting times of random walks on Erd\H{o}s-R\'enyi networks are presented. Starting from a random initial node, a random walker hops between adjacent nodes until it hits a node which it has already visited before. At this point, the path terminates. The path length, namely the number of steps, $d$, pursued by the random walker from the initial node up to its termination is called the first hitting time or the first intersection length. Using… Expand
The distribution of first hitting times of random walks on directed Erdős–Rényi networks
We present analytical results for the distribution of first hitting times of random walkers (RWs) on directed Erdős-Renyi (ER) networks. Starting from a random initial node, a random walker hopsExpand
The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks
We present analytical results for the distribution of first hitting times of non-backtracking random walks on finite Erd\H{o}s-R\'enyi networks of $N$ nodes.The walkers hop randomly between adjacentExpand
Ju l 2 02 1 Analytical results for the distribution of first return times of random walks on random regular graphs
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of N nodes of degree c ≥ 3. Starting from a randomExpand
Distribution of shortest path lengths in subcritical Erdős-Rényi networks.
TLDR
A topological expansion is used to perform a systematic analysis of the degree distribution and the distribution of shortest path lengths (DSPL) on components of given sizes and topologies in subcritical Erdős-Rényi (ER) networks and obtains an exact analytical expression for the DSPL of the entire subcritical network, in the asymptotic limit. Expand
Revealing the microstructure of the giant component in random graph ensembles.
TLDR
By using the degree distribution on the giant component one obtains high quality results for these properties, which can be further improved by taking the degree-degree correlations into account, which suggests that many existing methods, currently used for the analysis of the whole network, can be adapted in a straightforward fashion to yield results conditioned on the Giant component. Expand
FINANCIAL CENTRALITY AND THE VALUE OF KEY PLAYERS
Consider an economy in which agents face endowment income risk but have stochastic market access as they interact in a stochastic financial network. We define the financial centrality of an agent asExpand
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 theExpand
Analytical results for the distribution of first hitting times of random walks on random regular graphs
We present analytical results for the distribution of first hitting (FH) times of random walks (RWs) on random regular graphs (RRGs) of degree c ⩾ 3 and a finite size N. Starting from a randomExpand
Analytical results for the distribution of first return times of random walks on random regular graphs
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of N nodes of degree c ⩾ 3. Starting from a randomExpand
Unified Approach to Gated Reactions on Networks.
TLDR
It is shown that the mean and distribution of the gated reaction time can always be expressed in terms of ungated first-passage and return times, and the relation between gated and un gated kinetics is explored to reveal universal features of gated reactions. Expand

References

SHOWING 1-10 OF 52 REFERENCES
The distribution of path lengths of self avoiding walks on Erdős–Rényi networks
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit,Expand
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 Erdos-R\'enyi networks, based on recursion equations for the shells around a referenceExpand
First-passage properties of the Erdos Renyi random graph
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdős–Renyi random graph. We develop an effective medium approximation that predicts that the meanExpand
A model of self-avoiding random walks for searching complex networks
TLDR
An analytical model is proposed to estimate the average search length of a SAW when used to locate a resource in a network, which is a mean-field model, whose applicability to real networks is validated by simulation. Expand
Self-avoiding walks on scale-free networks.
  • C. Herrero
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
TLDR
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. Expand
Self-avoiding walks and connective constants in small-world networks.
TLDR
This work considers networks generated by rewiring links in one- and two-dimensional regular lattices by means of self-avoiding walks and derives results agreeing with each other for small p and differ for p close to 1, because of the different connectivity distributions resulting in both cases. Expand
The average number of distinct sites visited by a random walker on random graphs
We study the linear large $n$ behavior of the average number of distinct sites $S(n)$ visited by a random walker after $n$ steps on a large random graph. An expression for the graph topologyExpand
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 boundaryExpand
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 orExpand
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 isExpand
...
1
2
3
4
5
...