A note on thresholds and connectivity in random directed graphs

MaRDI QIDQ5170021zbMATH OpenFDO

Authors Alasdair J. Graham, David A. Pike

Publication date 17 July 2014

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Random threshold digraphs
• Connectivity and dynamics for random subgraphs of the directed cube
• Connectivity of a general class of inhomogeneous random digraphs
• scientific article; zbMATH DE number 2188468
• Giant components in three-parameter random directed graphs

Cited in

(12)

• Connectivity threshold for random chordal graphs
• Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences
• Note on directed proper connection number of a random graph
• The distribution of first hitting times of random walks on directed Erdős–Rényi networks
• Random threshold digraphs
• Network of interacting neurons with random synaptic weights
• A classification of isomorphism-invariant random digraphs
• The connectivity threshold for the min‐degree random graph process
• scientific article; zbMATH DE number 7650133 (Why is no real title available?)
• Efficient presolving methods for the influence maximization problem
• Optimal cycle selections: an experimental assessment of integer programming formulations

This page was built for publication: A note on thresholds and connectivity in random directed graphs

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