The phase transition in the evolution of random digraphs
From MaRDI portal
Publication:3496365
DOI10.1002/jgt.3190140210zbMath0712.05051MaRDI QIDQ3496365
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140210
05C80: Random graphs (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Related Items
Big Jobs Arrive Early: From Critical Queues to Random Graphs, A classification of isomorphism-invariant random digraphs, The critical window in random digraphs, The scaling limit of a critical random directed graph, The birth of the strong components, Exact enumeration of satisfiable 2-SAT formulae, Birth of a giant \((k_{1},k_{2})\)-core in the random digraph, Energy efficient randomised communication in unknown AdHoc networks, Phase transition phenomena in random discrete structures, Walks on random digraphs, Counting directed acyclic and elementary digraphs, Functional integration of ecological networks through pathway proliferation, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, The critical behavior of random digraphs, Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
