The critical behavior of random digraphs

DOI10.1002/RSA.20283MaRDI QIDQ3055776zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak, Taral Guldahl Seierstad

Publication date 9 November 2010

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

critical behaviorphase transitionrandom digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The critical window in random digraphs
• The phase transition in the evolution of random digraphs
• On the Behavior of a Random Graph Near a Critical Point
• Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
• Component behavior near the critical point of the random graph process

Cites work

• Component behavior near the critical point of the random graph process
• Cycles and Unicyclic Components in Random Graphs
• Cycles in a random graph near the critical point
• Giant components in three-parameter random directed graphs
• scientific article; zbMATH DE number 1380601 (Why is no real title available?)
• The birth of the giant component
• The Evolution of Random Graphs
• The phase transition in the evolution of random digraphs
• The Structure of a Random Graph at the Point of the Phase Transition
• The transitive closure of a random digraph

Cited in

(26)

• Energy efficient randomised communication in unknown AdHoc networks
• Critical random graphs and the differential equations technique
• Coalescence and criticality of graphs
• Counting directed acyclic and elementary digraphs
• Generating functions of some families of directed uniform hypergraphs
• Critical phenomena in exponential random graphs
• The diameter of the directed configuration model
• 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
• The transitive closure of a random digraph
• On the construction of random digraphs with marked edges
• The phase transition in the evolution of random digraphs
• scientific article; zbMATH DE number 1186727 (Why is no real title available?)
• Big jobs arrive early: from critical queues to random graphs
• A classification of isomorphism-invariant random digraphs
• Birth of a giant \((k_{1},k_{2})\)-core in the random digraph
• 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
• On the largest component of the critical random digraph
• Symbolic method and directed graph enumeration
• Percolation in simple directed random graphs with a given degree distribution

This page was built for publication: The critical behavior of random digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055776)