A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
The probability that a random multigraph is simple
Combinatorics, Probability and Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
SIAM Journal on Discrete Mathematics
A theoretical analysis of the structure of HC-128
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
The scaling window for a random graph with a given degree sequence
Random Structures & Algorithms
Hi-index | 0.00 |
We give results on the strong connectivity for spaces of sparse random digraphs specified by degree sequence. A full characterization is provided, in probability, of the fan-in and fan-out of all vertices including the number of vertices with small ($o(n)$) and large ($cn$) fan-in or fan-out. We also give the size of the giant strongly connected component, if any, and the structure of the bow-tie digraph induced by the vertices with large fan-in or fan-out. Our results follow a direct analogy of the extinction probabilities of classical branching processes.