Random walks on graphs
From MaRDI portal
Publication:1213699
DOI10.1016/0304-4149(74)90001-5zbMath0296.60046OpenAlexW2136647665MaRDI QIDQ1213699
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) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (30)
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 ⋮ Simple random walks on trees ⋮ Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs ⋮ The access time of random walks on trees with given partition ⋮ Geometry of complex networks and topological centrality ⋮ Random walks on edge transitive graphs ⋮ The electrical resistance of a graph captures its commute and cover times ⋮ Characterization of random walks on space of unordered trees using efficient metric simulation ⋮ Spectral determinants and an Ambarzumian type theorem on graphs ⋮ Random walks on trees ⋮ A class of graph-geodetic distances generalizing the shortest-path and the resistance distances ⋮ The walk distances in graphs ⋮ Commute times for a directed graph using an asymmetric Laplacian ⋮ Tuned communicability metrics in networks. The case of alternative routes for urban traffic ⋮ Hitting times for random walks on vertex-transitive graphs ⋮ Some computational tools for digital archive and metadata maintenance ⋮ RANDOM WALKS ON REGULAR POLYHEDRA AND OTHER DISTANCE–REGULAR GRAPHS ⋮ Fixed-size determinantal point processes sampling for species phylogeny ⋮ Developments in the theory of randomized shortest paths with a comparison of graph node distances ⋮ Safe navigation in adversarial environments ⋮ Predicting missing links via local information ⋮ A random polynomial time algorithm for well-routing convex bodies ⋮ Random walks and the effective resistance of networks ⋮ Link prediction techniques, applications, and performance: a survey ⋮ An introduction to covering problems for random walks on graphs ⋮ Effective resistance is more than distance: Laplacians, simplices and the Schur complement ⋮ Dissecting graph measure performance for node clustering in LFR parameter space ⋮ A diffusion defined on a fractal state space ⋮ Random walks on the triangular prism and other vertex-transitive graphs
Cites Work
This page was built for publication: Random walks on graphs
