A random triadic process

DOI10.1016/J.ENDM.2015.06.028zbMATH Open1346.05201OpenAlexW2962725690MaRDI QIDQ322221FDOQ322221

Authors: Dániel Korándi, Yuval Peled, Benny Sudakov 

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.028

Recommendations

• A random triadic process
• Homological connectedness of random hypergraphs
• Propagation connectivity of random hypergraphs
• On simple connectivity of random 2-complexes
• Integral homology of random simplicial complexes

zbMATH Keywords

differential equation methodrandom simplicial complexestriadic process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Cites Work

• Networks, crowds and markets. Reasoning about a highly connected world.
• Homological connectivity of random 2-complexes
• The triangle-free process
• Title not available (Why is that?)
• The fundamental group of random 2-complexes.
• Propagation connectivity of random hypergraphs
• On the size of a random maximal graph

Cited In (4)

• On topological minors in random simplicial complexes
• Propagation connectivity of random hypergraphs
• A random triadic process
• Propagation connectivity of random hypergraphs

This page was built for publication: A random triadic process

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