On the largest component of the critical random digraph

MaRDI QIDQ6621183zbMATH OpenFDO

Authors Matthew Coulson

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• The critical window in random digraphs
• The critical behavior of random digraphs
• The critical random graph, with martingales
• On the largest component of the random graph at a nearcritical stage
• Size of the largest component in a critical graph

Cites work

• Asymptotic enumeration of strongly connected digraphs by vertices and edges
• Clutter percolation and random graphs
• Component behavior near the critical point of the random graph process
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• On the largest component of the random graph at a nearcritical stage
• 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 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 transitive closure of a random digraph

Cited in

(1)

• Percolation in simple directed random graphs with a given degree distribution

This page was built for publication: On the largest component of the critical random digraph

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