Adaptive importance sampling for network growth models
From MaRDI portal
Publication:666362
DOI10.1007/s10479-010-0685-2zbMath1233.90085OpenAlexW2005547728WikidataQ41348711 ScholiaQ41348711MaRDI QIDQ666362
Susan P. Holmes, Adam N. Guetz
Publication date: 8 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc4863242
model selectionPlackett-Luce modelpreferential attachmentcross-entropy methodadaptive importance samplingnetwork growth models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A preferential attachment model with Poisson growth for scale-free networks
- Optimization of computer simulation models with rare events
- MM algorithms for generalized Bradley-Terry models.
- Stochastic simulation: Algorithms and analysis
- Sequential Monte Carlo Methods in Practice
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- A likelihood approach to analysis of network data
- Minimum variance importance samplingviaPopulation Monte Carlo
- Monte Carlo strategies in scientific computing
This page was built for publication: Adaptive importance sampling for network growth models