Expander Properties and the Cover Time of Random Intersection Graphs

DOI10.1007/978-3-540-74456-6_6zbMATH Open1147.05307OpenAlexW4251701219MaRDI QIDQ3525554FDOQ3525554

Christoforos L. Raptopoulos, P. G. Spirakis, Sotiris E. Nikoletseas

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_6

Recommendations

• Expander properties and the cover time of random intersection graphs
• Expansion and the cover time of parallel random walks
• scientific article; zbMATH DE number 2079333
• Bounds on the cover time
• Random walks which prefer unvisited edges, exploring high girth even degree expanders in linear time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cited In (7)

• Expander properties and the cover time of random intersection graphs
• Selected Combinatorial Properties of Random Intersection Graphs
• The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
• Large independent sets in general random intersection graphs
• On the independence number and Hamiltonicity of uniform random intersection graphs
• A Note on the Conductance of the Binomial Random Intersection Graph
• Sharp thresholds for Hamiltonicity in random intersection graphs

This page was built for publication: Expander Properties and the Cover Time of Random Intersection Graphs

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