Estimating graph parameters with random walks

DOI10.4171/MSL/9zbMath1418.60106arXiv1709.00869OpenAlexW2885907638MaRDI QIDQ2319818

Yuval Peres, Anna Ben-Hamou, Roberto Imbuzeiro Oliveira

Publication date: 20 August 2019

Published in: Mathematical Statistics and Learning (Search for Journal in Brave)

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

zbMATH Keywords

graph inferenceintersections of random walks

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection and mixing times for reversible chains
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Waiting for a Bat to Fly By (in Polynomial Time)
• A proof of Alon’s second eigenvalue conjecture and related problems
• The Probability That a Random Multigraph is Simple
• Estimating Sizes of Social Networks via Biased Sampling
• Random walks on graphs: new bounds on hitting, meeting, coalescing and returning
• Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
• Brief Announcement
• Distributed Random Walks
• Estimating the unseen

This page was built for publication: Estimating graph parameters with random walks