The critical window in random digraphs

DOI10.1017/S096354832100033XOpenAlexW3206436175MaRDI QIDQ5886327

Matthew Coulson

Publication date: 31 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.00624

zbMATH Keywords

phase transitionrandom digraphcritical window

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

The scaling limit of a critical random directed graph ⋮ The birth of the strong components

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The critical random graph, with martingales
• Brownian excursions, critical random graphs and the multiplicative coalescent
• On the largest component of the random graph at a nearcritical stage
• The continuum limit of critical random graphs
• Counting strongly-connected, moderately sparse directed graphs
• Asymptotic enumeration of strongly connected digraphs by vertices and edges
• The critical behavior of random digraphs
• Refinement of the upper bounds of the constants in Lyapunov's theorem
• The transitive closure of a random digraph
• Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
• The phase transition in the evolution of random digraphs
• The Evolution of Random Graphs
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• Clutter percolation and random graphs
• Component behavior near the critical point of the random graph process
• FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS
• The Structure of a Random Graph at the Point of the Phase Transition
• The birth of the giant component

This page was built for publication: The critical window in random digraphs