Measures of information spread in digraphs

DOI10.61091/UM128-10MaRDI QIDQ7316062zbMATH OpenFDO

Authors Gregory Magda, Jonathan Rubin, Sabrina Streipert, Cameron Watt, A. Kumar, Gregory P Constantine

Publication date 18 August 2026

Published in Utilitas Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/UM128-10

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Information theory (general) (94A15)

Cites work

• Almost all Cayley graphs have diameter 2
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Bootstrap percolation on the random regular graph
• Complex networks: principles, methods and applications
• Diameter 2 Cayley graphs of dihedral groups
• Dynamical systems on networks. A tutorial
• Expansion in finite simple groups of Lie type.
• Geometric group theory. An introduction
• Graphs & Digraphs
• scientific article; zbMATH DE number 3999929 (Why is no real title available?)
• Large Cayley graphs of small diameter
• Multistate dynamical processes on networks: analysis through degree-based approximation frameworks
• On the diameter of a class of random graphs
• Sharp metastability threshold for two-dimensional bootstrap percolation
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The theory of group-reduced distributions.

This page was built for publication: Measures of information spread in digraphs

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