The Cover Time of a Random Walk in Affiliation Networks

DOI10.1109/TIT.2022.3169775MaRDI QIDQ5040008zbMATH OpenOpenAlexFDO

Authors Jerzy Jaworski, Katarzyna Rybarczyk, Mindaugas Bloznelis

Publication date 11 October 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2022.3169775

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Recommendations

• scientific article; zbMATH DE number 109323
• On the Cover Time for Random Walks on Random Graphs
• On the cover time of random walks on graphs
• scientific article; zbMATH DE number 1504576
• The cover time of the preferential attachment graph
• Cover time and mixing time of random walks on dynamic graphs
• A bound for the covering time of random walks on graphs

Cited in

(1)

• Cover and hitting times of hyperbolic random graphs

This page was built for publication: The Cover Time of a Random Walk in Affiliation Networks

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