The critical behavior of random digraphs
From MaRDI portal
Publication:3055776
DOI10.1002/rsa.20283zbMath1214.05157MaRDI QIDQ3055776
Taral Guldahl Seierstad, Tomasz Łuczak
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
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
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, Counting directed acyclic and elementary digraphs, Generating functions of some families of directed uniform hypergraphs, 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
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
