Return times of random walk on generalized random graphs.

@article{Masuda2004ReturnTO,
  title={Return times of random walk on generalized random graphs.},
  author={Naoki Masuda and Norio Konno},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2004},
  volume={69 6 Pt 2},
  pages={
          066113
        }
}
  • N. Masuda, N. Konno
  • Published 15 January 2004
  • Mathematics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even broader classes of related stochastic models. Abundant results are obtained for random walk on simple graphs such as the regular lattices and the Cayley trees. However, random walks and related processes on more complex networks, which are often more relevant in… 

Figures from this paper

Random walks and diffusion on networks

Random Walks between Leaves of Random Networks

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

Optimal networks revealed by global mean first return time

Random walks have wide application in real lives, such as target search, reaction kinetics, polymer chains, and so on. In this paper, we consider discrete random walks on general connected networks

First-passage properties of the Erdos Renyi random graph

TLDR
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.

Analytical results for the distribution of first-passage times of random walks on random regular graphs

TLDR
Analytical results for the distribution of FP times of random walks (RWs) on random regular graphs that consist of N nodes of degree c ≥ 3 are found to be in very good agreement with the results obtained from computer simulations.

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

TLDR
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 are presented and are found to be in excellent agreement with the results obtained from computer simulations.

Load-dependent random walks on complex networks

TLDR
By numerical simulations, it is shown that the network heterogeneity has a influence on the effect of walk preference in the cascading failure phenomenon and an appropriate degree correlation can guarantee a low risk of cascading failures.

Analysis of fluctuations in the first return times of random walks on regular branched networks.

TLDR
A method of calculating the variance of FRT on general finite networks is presented and the results differ from those in such other networks as Sierpinski gaskets, Vicsek fractals, T-graphs, pseudofractal scale-free webs, (u, v) flowers, and fractal and non-fractal Scale-free trees.

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

TLDR
Considering the FH event as a termination mechanism of the RW trajectories, these results provide useful insight into the general problem of survival analysis and the statistics of mortality rates when two or more termination scenarios coexist.

References

SHOWING 1-10 OF 36 REFERENCES

Random spread on the family of small-world networks.

TLDR
The behavior of the average access time as a function of p shows striking similarity with that of the characteristic length of the graph, which may have important applications in routing and switching in networks with a large number of nodes.

Random graphs with arbitrary degree distributions and their applications.

TLDR
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.

Branching annihilating random walk on random regular graphs

  • Szabó
  • Mathematics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
TLDR
The branching annihilating random walk is studied on a random graph whose sites have a uniform number of neighbors and it is shown that the concentration decreases linearly with the branching rate for z>/=4, while the coefficient of the linear term becomes zero if z=3.

Network robustness and fragility: percolation on random graphs.

TLDR
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.

Spectra of "real-world" graphs: beyond the semicircle law.

TLDR
Methods to determine the eigenvalues of networks comparable in size to real systems are developed, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs.

Random Walks and Percolation on Trees

There is a way to define an average number of branches per vertex for an arbitrary infinite locally finite tree. It equals the exponential of the Hausdorff dimension of the boundary in an appropriate

Scaling of random spreading in small world networks.

TLDR
The mean number of visited sites and the return probabilities of random walks on Watts-Strogatz-type small world networks were found to obey scaling behavior with intuitively reasoned exponents as long as the probability of having a long range bond was sufficiently low.

Statistical mechanics of complex networks

TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure

Abstract We consider simple random walk on the family tree T of a nondegenerate supercritical Galton—Watson branching process and show that the resulting harmonic measure has a.s. strictly smaller

Emergence of scaling in random networks

TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.