scientific article; zbMATH DE number 7561278
DOI10.4230/LIPICS.DISC.2018.26zbMATH Open1497.68562arXiv1802.06676MaRDI QIDQ5090918FDOQ5090918
Authors: Manuela Fischer, Mohsen Ghaffari
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1802.06676
Title of this publication is not available (Why is that?)
Recommendations
- Optimized Sampling for Multiscale Dynamics
- The enhanced sampling in parallel finite-time dynamics method with replica exchange
- Sampling chaotic trajectories quickly in parallel
- Generalized parallel sampling
- Parallel optimized sampling for stochastic equations
- An efficient and parallel Gaussian sampler for lattices
- Fast convergence of the Glauber dynamics for sampling independent sets
- Some remarks on sampling methods in Molecular Dynamics
- Theoretical and numerical comparison of some sampling methods for molecular dynamics
- Finite dimensional dynamical sampling: an overview
samplingparallel algorithmscoloringlocalityGlauber dynamicslocal algorithmsdistributed graph algorithms
Computational methods in Markov chains (60J22) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Cites Work
- Equation of state calculations by fast computing machines
- Random generation of combinatorial structures from a uniform distribution
- Improved bounds for sampling colorings
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- An introduction to MCMC for machine learning
- A survey on the use of Markov chains to randomly sample colourings
- Title not available (Why is that?)
- What Can be Computed Locally?
- Improved bounds for randomly sampling colorings via linear programming
- Uniform sampling through the Lovász local lemma
- What Can be Sampled Locally?
Cited In (6)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090918)