Analysis of Relaxation Time in Random Walk with Jumps

DOI10.1007/978-3-319-92871-5_6MaRDI QIDQ5881229zbMATH OpenOpenAlexFDO

Authors I. I. Bogdanov, Konstantin Avrachenkov

Publication date 9 March 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.03260

zbMATH Keywords

learning on graphsnetwork analysisnetwork samplingrandom walk on graphrandom walk with jumpsrelaxation timespectral gap

Mathematics Subject Classification ID

Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Analysis of node2vec random walks on networks
• On the analysis of a random interleaving walk-jump process with applications to testing
• scientific article; zbMATH DE number 878897
• Mixing time and cutoff for a random walk on the ring of integers mod \(n\)
• Improving random walk estimation accuracy with uniform restarts

Cites work

• A generalized inverse for graphs with absorption
• Analytic perturbation theory and its applications
• Analytic perturbation theory for matrices and operators. Licensed ed
• Ergodicity coefficients defined by vector norms
• Google's PageRank and beyond. The science of search engine rankings
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Improving random walk estimation accuracy with uniform restarts
• Markov Chains
• Non-negative matrices and Markov chains.
• Perturbation theory for linear operators.
• Quick detection of nodes with large degrees
• Semi-supervised learning with regularized Laplacian

Cited in

(2)

• Searching efficiency of multiple walkers on the weighted networks
• Generalized adjacency and Laplacian spectra of the weighted corona graphs

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Analysis of Relaxation Time in Random Walk with Jumps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881229)