Dynamic inference in probabilistic graphical models
From MaRDI portal
Cites work
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Completely analytical interactions: Constructive description
- Decremental single-source shortest paths on undirected graphs in near-linear total update time
- Dobrushin Conditions and Systematic Scan
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Dynamic chain graph models for time series network data
- Dynamic effective resistances and approximate Schur complement on separable graphs
- Dynamic low-stretch trees via dynamic low-diameter decompositions
- Dynamic matrix-variate graphical models
- Efficient sampling from time-varying log-concave distributions
- Fast convergence of the Glauber dynamics for sampling independent sets
- Graphical models, exponential families, and variational inference
- scientific article; zbMATH DE number 3909120 (Why is no real title available?)
- scientific article; zbMATH DE number 3909121 (Why is no real title available?)
- scientific article; zbMATH DE number 472978 (Why is no real title available?)
- Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Information, Physics, and Computation
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On fully dynamic graph sparsifiers
- On Markov Chains for Independent Sets
- Probabilistic graphical models.
- Random generation of combinatorial structures from a uniform distribution
This page was built for publication: Dynamic inference in probabilistic graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229311)
