A notion of graph likelihood and an infinite monkey theorem

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

Research output: Contribution to journalArticlepeer-review


We play with a graph-theoretic analogue of the folklore infinite monkey theorem. We define a notion of graph likelihood as the probability that a given graph is constructed by a monkey in a number of time steps equal to the number of vertices. We present an algorithm to compute this graph invariant and closed formulas for some infinite classes. We have to leave the computational complexity of the likelihood as an open problem.

Original languageEnglish
Article number035101
JournalJournal of Physics A: Mathematical and Theoretical
Issue number3
StatePublished - 24 Jan 2014


  • graph complexity
  • network growth
  • randomness

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Modeling and Simulation
  • Mathematical Physics
  • General Physics and Astronomy


Dive into the research topics of 'A notion of graph likelihood and an infinite monkey theorem'. Together they form a unique fingerprint.

Cite this