scientific article; zbMATH DE number 7561278
From MaRDI portal
Publication:5090918
DOI10.4230/LIPIcs.DISC.2018.26zbMath1497.68562arXiv1802.06676MaRDI QIDQ5090918
Manuela Fischer, Mohsen Ghaffari
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1802.06676
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
samplingparallel algorithmsGlauber dynamicscoloringlocalitylocal 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)
Related Items
Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Exact distributed sampling ⋮ Dynamic Sampling from Graphical Models
Cites Work
- Unnamed Item
- Unnamed Item
- Random generation of combinatorial structures from a uniform distribution
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- An introduction to MCMC for machine learning
- Improved bounds for sampling colorings
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- What Can be Computed Locally?
- Uniform sampling through the Lovasz local lemma
- Equation of State Calculations by Fast Computing Machines
- Improved Bounds for Randomly Sampling Colorings via Linear Programming
- What Can be Sampled Locally?
This page was built for publication:
