A notion of graph likelihood and an infinite monkey theorem

DOI10.1088/1751-8113/47/3/035101zbMath1336.05127arXiv1304.3600OpenAlexW2964232763MaRDI QIDQ5402219

Simone Severini, Christopher R. S. Banerji, Toufik Mansour

Publication date: 6 March 2014

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.3600

zbMATH Keywords

randomnessgraph complexitynetwork growth

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On the likelihood of forests ⋮ Limit of a nonpreferential attachment multitype network model

This page was built for publication: A notion of graph likelihood and an infinite monkey theorem