Building a random network with a given expected giant component

DOI10.1007/S11565-024-00575-9MaRDI QIDQ6657511

Ayoub Mounim, Lorenzo Federico

Publication date: 6 January 2025

Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)

zbMATH Keywords

degree sequenceconfiguration modelgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Component evolution in random intersection graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Largest random component of a k-cube
• Random graphs and complex networks. Volume 1
• A new approach to the giant component problem
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• Random intersection graphs with communities
• The birth of the giant component
• Critical Window for Connectivity in the Configuration Model
• The diameter of sparse random graphs

This page was built for publication: Building a random network with a given expected giant component

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