On the likelihood of forests

DOI10.1016/J.PHYSA.2016.03.021MaRDI QIDQ1619566zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Random forests and networks analysis
• Generating random networks from a given distribution
• A likelihood approach to analysis of network data
• Tree and forest weights and their application to nonuniform random graphs
• On the number of maximum leaf spanning trees and maximum independent sets in several deterministic networks

Cites work

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

Cited in

(6)

• Using stochastic decision networks to assess costs and completion times of refurbishment work in construction
• Note on Perfect Forests
• 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
• Amicability of forests

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619566)