Mixing time bounds for graphlet random walks

DOI10.1016/J.IPL.2019.105851zbMATH Open1481.05145OpenAlexW2970300642WikidataQ127324332 ScholiaQ127324332MaRDI QIDQ2328313FDOQ2328313

Authors: Matteo Agostini, Marco Bressan, Shahrzad Haddadan 

Publication date: 10 October 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105851

Recommendations

• Mixing time of exponential random graphs
• Mixing times of random walks on dynamic configuration models
• Random walks on the random graph
• Comparing mixing times on sparse random graphs
• scientific article; zbMATH DE number 878897

zbMATH Keywords

MCMCgraph algorithmsrandom walksmotif mining

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)

Cites Work

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

Cited In (6)

• Pseudo-mixing Time of Random Walks
• Title not available (Why is that?)
• Mixing times for the rook's walk via path coupling
• Mixing time of PageRank surfers on sparse random digraphs
• Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
• Title not available (Why is that?)

This page was built for publication: Mixing time bounds for graphlet random walks

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