On the likelihood of forests

DOI10.1016/j.physa.2016.03.021zbMath1400.05214OpenAlexW2335115982MaRDI QIDQ1619566

Yilun Shang

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2016.03.021

zbMATH Keywords

likelihoodforestgraph complexitygrowing networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (4)

Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant ⋮ On the hyperbolicity constant of circular-arc graphs ⋮ Limit of a nonpreferential attachment multitype network model ⋮ Using stochastic decision networks to assess costs and completion times of refurbishment work in construction

Cites Work

• Unnamed Item
• Unnamed Item
• A history of graph entropy measures
• The linear complexity of a graph
• A bound for the complexity of a simple graph
• Graph complexity
• An example of graph limits of growing sequences of random graphs
• Emergence of Scaling in Random Networks
• Graph complexity and the laplacian matrix in blocked experiments
• Lectures on Complex Networks
• The Structure and Function of Complex Networks
• The Average Distance in a Random Graph with Given Expected Degrees
• A notion of graph likelihood and an infinite monkey theorem

This page was built for publication: On the likelihood of forests