Computational Methods for a Class of Network Models
Explore this paper's citation graph
Summary
This article considers the duplication attachment model that has a likelihood function that typically cannot be evaluated in any reasonable computational time and develops particle Markov chain Monte Carlo algorithms to perform Bayesian inference to perform parameter estimation.
- Type
- article
- Published
- 2013-06-19
- Cited by
- 7
- References
- 25
- Access
- Open access
- OpenAlex
- https://openalex.org/W2087804849
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:35630857
Keywords
Markov chain Monte Carlo, Particle filter, Computer science, Algorithm, Likelihood function
References
- Feynman-Kac Formulae: Genealogical and Interacting Particle Systems with Applications
- Particle Markov chain Monte Carlo methods
- Efficient Bayesian Inference for Switching State-Space Models using Discrete Particle Markov Chain Monte Carlo Methods
- Monte Carlo Statistical Methods
- Adaptive importance sampling for network growth models
- A nonasymptotic theorem for unnormalized Feynman-Kac particle models
- A likelihood approach to analysis of network data
- Path storage in the particle filter
- Efficient Block Sampling Strategies for Sequential Monte Carlo Methods
- The pseudo-marginal approach for efficient Monte Carlo computations
- On the utility of graphics cards to perform massively parallel simulation of advanced Monte Carlo methods
- Simulating Probability Distributions in the Coalescent
- The time machine: a simulation approach for stochastic trees
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Linear Variance Bounds for Particle Approximations of Time-Homogeneous Feynman-Kac Formulae
- Sequential Monte Carlo samplers
- On the stability of sequential Monte Carlo methods in high dimensions
- A non asymptotic variance theorem for unnormalized Feynman-Kac particle models
- On adaptive resampling strategies for sequential Monte Carlo methods
- On the utility of graphics cards to perform massively parallel simulation of advanced Monte Carlo methods
Cited by
- A Stable Particle Filter in High-Dimensions
- Path storage in the particle filter
- Monte Carlo algorithms for computing α α-permanents
- A Bayesian mixture of lasso regressions with t-errors
- Bayesian Inference for Duplication–Mutation with Complementarity Network Models
- Random‐walk models of network formation and sequential Monte Carlo methods for graphs
- Transcriptome analysis of green and purple fruited pepper provides insight into novel regulatory genes in anthocyanin biosynthesis
- Phase Transition in the Recoverability of Network History
- Path storage in the particle filter
Related papers
- Score Matched Conditional Exponential Families for Likelihood-Free Inference ∗
- Approximate Bayesian Computation
- Score Matched Neural Exponential Families for Likelihood-Free Inference
- Rao-Blackwellized particle filter for multiple target tracking
- An Improved Auxiliary Particle Filter for Nonlinear Dynamic Equilibrium Models