Random walks on graphs
DOI10.1016/0304-4149(74)90001-5zbMATH Open0296.60046OpenAlexW2136647665MaRDI QIDQ1213699FDOQ1213699
Publication date: 1974
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/random-walks-on-graphs(f83d3378-83c5-4e62-adb0-2b20285a99bd).html
Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
Cited In (30)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Some computational tools for digital archive and metadata maintenance
- An introduction to covering problems for random walks on graphs
- The electrical resistance of a graph captures its commute and cover times
- Random walks on graphs with interval weights and precise marginals
- Unequal edge inclusion probabilities in link-tracing network sampling with implications for respondent-driven sampling
- Safe navigation in adversarial environments
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- A diffusion defined on a fractal state space
- Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs
- Fixed-size determinantal point processes sampling for species phylogeny
- The access time of random walks on trees with given partition
- Geometry of complex networks and topological centrality
- RANDOM WALKS ON REGULAR POLYHEDRA AND OTHER DISTANCE–REGULAR GRAPHS
- Characterization of random walks on space of unordered trees using efficient metric simulation
- Random walks and the effective resistance of networks
- Random walks on edge transitive graphs
- Simple random walks on trees
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- A random polynomial time algorithm for well-routing convex bodies
- Hitting times for random walks on vertex-transitive graphs
- Link prediction techniques, applications, and performance: a survey
- Spectral determinants and an Ambarzumian type theorem on graphs
- Predicting missing links via local information
- Commute times for a directed graph using an asymmetric Laplacian
- Random walks on the triangular prism and other vertex-transitive graphs
- Dissecting graph measure performance for node clustering in LFR parameter space
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- The walk distances in graphs
- Random walks on trees
This page was built for publication: Random walks on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213699)
