The critical behavior of random digraphs

DOI10.1002/rsa.20283zbMath1214.05157MaRDI QIDQ3055776

Tomasz Łuczak, Taral Guldahl Seierstad

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20283

zbMATH Keywords

phase transition; critical behavior; random digraphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

Related Items

Birth of a giant \((k_{1},k_{2})\)-core in the random digraph, Energy efficient randomised communication in unknown AdHoc networks, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, BOOLEAN DELAY EQUATIONS ON NETWORKS IN ECONOMICS AND THE GEOSCIENCES, Counting strongly-connected, moderately sparse directed graphs, Large dicliques in a directed inhomogeneous random graph, Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph

Cites Work

• Unnamed Item
• The transitive closure of a random digraph
• The phase transition in the evolution of random digraphs
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• Cycles in a random graph near the critical point
• Giant components in three-parameter random directed graphs
• The Structure of a Random Graph at the Point of the Phase Transition
• Cycles and Unicyclic Components in Random Graphs
• The birth of the giant component