On the largest component of the critical random digraph

MaRDI QIDQ6621183FDOQ6621183

Authors: Matthew Coulson 

Publication date: 18 October 2024

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the largest component of the random graph at a nearcritical stage
• Component behavior near the critical point of the random graph process
• Clutter percolation and random graphs
• The transitive closure of a random digraph
• The Evolution of Random Graphs
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• Asymptotic enumeration of strongly connected digraphs by vertices and edges
• The critical behavior of random digraphs
• The phase transition in the evolution of random digraphs
• The critical random graph, with martingales
• Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time

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)