Approximating sparse graphs: The random overlapping communities model

DOI10.1002/rsa.21081arXiv1802.03652OpenAlexW2785441691MaRDI QIDQ6052478

Santosh Vempala, Samantha Petti

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03652

zbMATH Keywords

regularity lemmaStieltjes moment problemgraph spectrumclustering coefficientsparse graph limits

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Related Items (1)

Clustering and percolation on superpositions of Bernoulli random graphs

Cites Work

• On generalized Dyck paths
• On a class of linked diagrams. I: Enumeration
• Recurrence of distributional limits of finite planar graphs
• Connected components in random graphs with given expected degree sequences
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Mixed membership stochastic blockmodels
• The Structure and Function of Complex Networks
• The Moment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating sparse graphs: The random overlapping communities model