A notion of graph likelihood and an infinite monkey theorem

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

doi:10.1088/1751-8113/47/3/035101

A notion of graph likelihood and an infinite monkey theorem

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Article number	035101
Journal	Journal of Physics A: Mathematical and Theoretical
Volume	47
Issue number	3
DOIs	https://doi.org/10.1088/1751-8113/47/3/035101
State	Published - 24 Jan 2014

Keywords

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

Access to Document

10.1088/1751-8113/47/3/035101

Cite this

@article{1badf4b9d25e487ca65ef313eab9c59a,

title = "A notion of graph likelihood and an infinite monkey theorem",

abstract = "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.",

keywords = "graph complexity, network growth, randomness",

author = "Banerji, {Christopher R.S.} and Toufik Mansour and Simone Severini",

year = "2014",

month = jan,

day = "24",

doi = "10.1088/1751-8113/47/3/035101",

language = "English",

volume = "47",

journal = "Journal of Physics A: Mathematical and Theoretical",

issn = "1751-8113",

publisher = "IOP Publishing Ltd.",

number = "3",

}

TY - JOUR

T1 - A notion of graph likelihood and an infinite monkey theorem

AU - Banerji, Christopher R.S.

AU - Mansour, Toufik

AU - Severini, Simone

PY - 2014/1/24

Y1 - 2014/1/24

N2 - 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.

AB - 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.

KW - graph complexity

KW - network growth

KW - randomness

UR - http://www.scopus.com/inward/record.url?scp=84891445499&partnerID=8YFLogxK

U2 - 10.1088/1751-8113/47/3/035101

DO - 10.1088/1751-8113/47/3/035101

M3 - Article

AN - SCOPUS:84891445499

SN - 1751-8113

VL - 47

JO - Journal of Physics A: Mathematical and Theoretical

JF - Journal of Physics A: Mathematical and Theoretical

IS - 3

M1 - 035101

ER -

A notion of graph likelihood and an infinite monkey theorem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this