A likelihood approach to analysis of network data

DOI10.1073/pnas.0600061103zbMath1160.62310OpenAlexW2051196362WikidataQ31039789 ScholiaQ31039789MaRDI QIDQ5385902

Michael P. H. Stumpf, Markus Brameier, Oskar Hagberg, Carsten Wiuf

Publication date: 7 May 2008

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc1472487

zbMATH Keywords

importance samplingrandom graphnetwork modelbiological networklikelihood recursion

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Point estimation (62F10) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Bootstrap, jackknife and other resampling methods (62F40) Biochemistry, molecular biology (92C40)

Related Items

Convergence properties of the degree distribution of some growing network models ⋮ A Markov chain approach to randomly grown graphs ⋮ Adaptive importance sampling for network growth models ⋮ A motif building process for simulating random networks ⋮ Twitter event networks and the superstar model

Cites Work

• Simulating probability distributions in the coalescent
• Ancestral inference in population genetics
• Emergence of Scaling in Random Networks
• Inference in Molecular Population Genetics
• Chain Graph Models and their Causal Interpretations
• Unnamed Item
• Unnamed Item