The giant component of the directed configuration model revisited
We prove a law of large numbers for the order and size of the largest strongly connected component in the directed configuration model. Our result extends previous work by Cooper and Frieze (2004).
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/363374 |
| Acceso en línea: | https://hdl.handle.net/2117/363374 https://dx.doi.org/10.30757/ALEA.v18-55 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory Random graphs Random directed graphs Configuration model Strongly connected component Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| Sumario: | We prove a law of large numbers for the order and size of the largest strongly connected component in the directed configuration model. Our result extends previous work by Cooper and Frieze (2004). |
|---|