The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
From MaRDI portal
Publication:4819245
DOI10.1017/S096354830400611XzbMath1065.05085WikidataQ57401519 ScholiaQ57401519MaRDI QIDQ4819245
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
The giant component of the directed configuration model revisited, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread, Mixing time of PageRank surfers on sparse random digraphs, A scaling limit for the length of the longest cycle in a sparse random digraph, Locality of random digraphs on expanders, The birth of the strong components, On the meeting of random walks on random DFA, Rankings in directed configuration models with heavy tailed in-degrees, Bootstrap percolation in living neural networks, Typical distances in the directed configuration model, Mixing time trichotomy in regenerating dynamic digraphs, The spectral gap of sparse random digraphs, Markov chains on finite fields with deterministic jumps, Bootstrap percolation in directed inhomogeneous random graphs, Limit laws for self-loops and multiple edges in the configuration model, Random walk on sparse random digraphs, The largest strongly connected component in the cyclical pedigree model of Wakeley et al., The diameter of the directed configuration model, RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS, The strong giant in a random digraph, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, Asymptotic enumeration of strongly connected digraphs by vertices and edges, The scaling window for a random graph with a given degree sequence, A Theoretical Analysis of the Structure of HC-128, Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph, The Probability That a Random Multigraph is Simple
