The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence

From MaRDI portal
Revision as of 01:38, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4819245

DOI10.1017/S096354830400611XzbMath1065.05085OpenAlexW1987070596WikidataQ57401519 ScholiaQ57401519MaRDI QIDQ4819245

Colin Cooper, Alan M. Frieze

Publication date: 24 September 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830400611x




Related Items (27)

Markov chains on finite fields with deterministic jumpsBirth of a Strongly Connected Giant in an Inhomogeneous Random DigraphThe scaling window for a random graph with a given degree sequenceTypical distances in the directed configuration modelBootstrap percolation in living neural networksThe giant component of the directed configuration model revisitedRandom walk on sparse random digraphsThe Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and SpreadMixing time of PageRank surfers on sparse random digraphsA scaling limit for the length of the longest cycle in a sparse random digraphLocality of random digraphs on expandersThe birth of the strong componentsOn the meeting of random walks on random DFAThe diameter of the directed configuration modelRankings in directed configuration models with heavy tailed in-degreesThe Probability That a Random Multigraph is SimpleOn the Chromatic Number of Random Graphs with a Fixed Degree SequenceMixing time trichotomy in regenerating dynamic digraphsRESILIENCE TO CONTAGION IN FINANCIAL NETWORKSThe largest strongly connected component in the cyclical pedigree model of Wakeley et al.The strong giant in a random digraphThe spectral gap of sparse random digraphsAsymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphsA Theoretical Analysis of the Structure of HC-128Bootstrap percolation in directed inhomogeneous random graphsAsymptotic enumeration of strongly connected digraphs by vertices and edgesLimit laws for self-loops and multiple edges in the configuration model




This page was built for publication: The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence