A likelihood approach to analysis of network data
DOI10.1073/PNAS.0600061103zbMATH Open1160.62310OpenAlexW2051196362WikidataQ31039789 ScholiaQ31039789MaRDI QIDQ5385902FDOQ5385902
Authors: Carsten Wiuf, Markus Brameier, Oskar Hagberg, Michael P. H. Stumpf
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
Recommendations
Point estimation (62F10) Bootstrap, jackknife and other resampling methods (62F40) Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
Cited In (8)
- Convergence properties of the degree distribution of some growing network models
- Maximum likelihood estimation based on the Laplace approximation for p2 network regression models
- Title not available (Why is that?)
- A motif building process for simulating random networks
- Twitter event networks and the superstar model
- A Markov chain approach to randomly grown graphs
- On the likelihood of forests
- Adaptive importance sampling for network growth models
This page was built for publication: A likelihood approach to analysis of network data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385902)