A Note on the Conductance of the Binomial Random Intersection Graph

DOI10.1007/978-3-030-48478-1_9OpenAlexW3033189240MaRDI QIDQ5041782

Katarzyna Rybarczyk, Jerzy Jaworski, Mindaugas Bloznelis

Publication date: 14 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48478-1_9

zbMATH Keywords

mixing timeconductancerandom intersection graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• The coupling method for inhomogeneous random intersection graphs.
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Upper bounds on Poisson tail probabilities
• Introduction to Random Graphs
• The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
• Expander Properties and the Cover Time of Random Intersection Graphs
• Epidemics on Random Graphs with Tunable Clustering
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• On Random Intersection Graphs: The Subgraph Problem
• Le Cam's Inequality and Poisson Approximations
• A Guided Tour in Random Intersection Graphs
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: A Note on the Conductance of the Binomial Random Intersection Graph