The critical window in random digraphs

DOI10.1017/S096354832100033XMaRDI QIDQ5886327zbMATH OpenOpenAlexFDO

Authors 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

critical windowphase transitionrandom digraph

Mathematics Subject Classification ID

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

Recommendations

• The critical behavior of random digraphs
• Critical window for the vacant set left by random walk on random regular graphs
• The scaling window for a random graph with a given degree sequence
• scientific article; zbMATH DE number 6297796
• Critical random graphs: Diameter and mixing time
• Critical random graphs: limiting constructions and distributional properties
• Critical subgraphs of a random graph
• The continuum limit of critical random graphs
• On the random graph structure near the critical point
• scientific article; zbMATH DE number 15665

Cites work

• Asymptotic enumeration of strongly connected digraphs by vertices and edges
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Clutter percolation and random graphs
• Component behavior near the critical point of the random graph process
• Counting strongly-connected, moderately sparse directed graphs
• FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3375520 (Why is no real title available?)
• On the largest component of the random graph at a nearcritical stage
• Probability and random processes.
• Refinement of the upper bounds of the constants in Lyapunov's theorem
• Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• The birth of the giant component
• The continuum limit of critical random graphs
• The critical behavior of random digraphs
• The critical random graph, with martingales
• 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 theory of probability. Explorations and applications
• The transitive closure of a random digraph

Cited in

(6)

• Counting directed acyclic and elementary digraphs
• The critical behavior of random digraphs
• scientific article; zbMATH DE number 6297796 (Why is no real title available?)
• The scaling limit of a critical random directed graph
• The birth of the strong components
• On the largest component of the critical random digraph

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

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