1 paper
Simone Severini, Eric W. Weisstein
The likelihood of a finite simple undirected graph G on n vertices is the probability that the uniform sequential attachment process, which at each step joins a new vertex to a…