The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs

DOI10.1007/978-3-540-75414-5_15zbMath1148.05317OpenAlexW1484056751MaRDI QIDQ3522870

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

Publication date: 4 September 2008

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_15

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

Related Items

A Note on the Conductance of the Binomial Random Intersection Graph, Expander properties and the cover time of random intersection graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Comparison theorems for reversible Markov chains
• Approximating Layout Problems on Random Geometric Graphs
• On Random Intersection Graphs: The Subgraph Problem
• Random Geometric Graphs
• Expander properties in random regular graphs with edge faults
• Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
• The vertex degree distribution of random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Automata, Languages and Programming
• Automata, Languages and Programming
• Sur deux propriétés des classes d'ensembles
• Algorithms and Computation