Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (Q6157383): Difference between revisions

Revision as of 11:37, 1 August 2024

scientific article; zbMATH DE number 7699943

Language	Label	Description	Also known as
English	Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs	scientific article; zbMATH DE number 7699943

Statements

instance of

scholarly article

0 references

title

Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (English)

0 references

0 references

0 references

0 references

Annales de l'Institut Henri Poincaré. Probabilités et Statistiques

0 references

publication date

21 June 2023

0 references

full work available at URL

https://arxiv.org/abs/2006.11580

0 references

zbMATH Keywords

approximate counting

0 references

Markov chains

0 references

phase transitions

0 references

Potts model

0 references

random cluster model

0 references

random graphs

0 references

MaRDI profile type

Publication

0 references

cites work

Weighted counting of solutions to sparse systems of equations

0 references

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs

0 references

Random-cluster dynamics on random regular graphs in tree uniqueness

0 references

Dynamics for the mean-field random-cluster model

0 references

A probabilistic proof of an asymptotic formula for the number of labelled regular graphs

0 references

The isoperimetric number of random regular graphs

0 references

Mixing of the Glauber dynamics for the ferromagnetic Potts model

0 references

Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures

0 references

Left and right convergence of graphs with bounded degree

0 references

Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point

0 references

Counting independent sets in unbalanced bipartite graphs

0 references

Loop series for discrete statistical models on graphs

0 references

Charting the replica symmetric phase

0 references

The replica symmetric phase of random constraint satisfaction problems

0 references

Q5092461

0 references

Ising models on locally tree-like graphs

0 references

The replica symmetric solution for Potts models on \(d\)-regular graphs

0 references

Lectures on the Ising and Potts Models on the Hypercubic Lattice

0 references

The relative complexity of approximate counting problems

0 references

Improved inapproximability results for counting independent sets in the hard-core model

0 references

Q5089204

0 references

Fast mixing via polymers for random graphs with unbounded degree

0 references

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

0 references

Swendsen‐Wang algorithm on the mean‐field Potts model

0 references

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results

0 references

Mixing Times of Critical Two‐Dimensional Potts Models

0 references

Exponentially slow mixing in the mean-field Swendsen-Wang dynamics

0 references

Quenched central limit theorems for the Ising model on random graphs

0 references

Approximating the Partition Function of the Ferromagnetic Potts Model

0 references

The Swendsen-Wang process does not always mix rapidly

0 references

The Random-Cluster Model

0 references

Random cluster dynamics for the Ising model is rapidly mixing

0 references

The random-cluster model on a homogeneous tree

0 references

Algorithmic Pirogov-Sinai theory

0 references

Expander graphs and their applications

0 references

Algorithms for #BIS-Hard Problems on Expander Graphs

0 references

Independent sets in the hypercube revisited

0 references

Approximating the Permanent

0 references

Polynomial-Time Approximation Algorithms for the Ising Model

0 references

Cluster expansion for abstract polymer models

0 references

Gibbs states and the set of solutions of random constraint satisfaction problems

0 references

Interfaces in the Potts model. I: Pirogov-Sinai theory of the Fortuin- Kasteleyn representation

0 references

Counting Independent Sets and Colorings on Random Regular Bipartite Graphs

0 references

Cutoff phenomena for random walks on random regular graphs

0 references

Anomalous finite size corrections in random field models

0 references

Short cycles in random regular graphs

0 references

Information, Physics, and Computation

0 references

The Freezing Threshold for <i>k</i> -Colourings of a Random Graph

0 references

The weak limit of Ising models on locally tree-like graphs

0 references

Mathematical Aspects of Mixing Times in Markov Chains

0 references

On the Number of Solutions in Random Graph<i>k</i>-Colouring

0 references

Counting in two-spin models on \(d\)-regular graphs

0 references

Counting independent sets up to the tree threshold

0 references

The asymptotic distribution of short cycles in random regular graphs

0 references

Identifiers

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6157383

@@ Property / cites work @@
+Weighted counting of solutions to sparse systems of equations
+Normal rank
@@ Property / cites work @@
+Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
+Normal rank
@@ Property / cites work @@
+Random-cluster dynamics on random regular graphs in tree uniqueness
+Normal rank
@@ Property / cites work @@
+Dynamics for the mean-field random-cluster model
@@ Property / cites work: Dynamics for the mean-field random-cluster model / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
+Normal rank
@@ Property / cites work @@
+The isoperimetric number of random regular graphs
@@ Property / cites work: The isoperimetric number of random regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Mixing of the Glauber dynamics for the ferromagnetic Potts model
+Normal rank
@@ Property / cites work @@
+Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
+Normal rank
@@ Property / cites work @@
+Left and right convergence of graphs with bounded degree
+Normal rank
@@ Property / cites work @@
+Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
+Normal rank
@@ Property / cites work @@
+Counting independent sets in unbalanced bipartite graphs
+Normal rank
@@ Property / cites work @@
+Loop series for discrete statistical models on graphs
+Normal rank
@@ Property / cites work @@
+Charting the replica symmetric phase
@@ Property / cites work: Charting the replica symmetric phase / rank @@
+Normal rank
@@ Property / cites work @@
+The replica symmetric phase of random constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q5092461
@@ Property / cites work: Q5092461 / rank @@
+Normal rank
@@ Property / cites work @@
+Ising models on locally tree-like graphs
@@ Property / cites work: Ising models on locally tree-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The replica symmetric solution for Potts models on \(d\)-regular graphs
+Normal rank
@@ Property / cites work @@
+Lectures on the Ising and Potts Models on the Hypercubic Lattice
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+Improved inapproximability results for counting independent sets in the hard-core model
+Normal rank
@@ Property / cites work @@
+Q5089204
@@ Property / cites work: Q5089204 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast mixing via polymers for random graphs with unbounded degree
+Normal rank
@@ Property / cites work @@
+Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
+Normal rank
@@ Property / cites work @@
+Swendsen‐Wang algorithm on the mean‐field Potts model
+Normal rank
@@ Property / cites work @@
+Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
+Normal rank
@@ Property / cites work @@
+Mixing Times of Critical Two‐Dimensional Potts Models
+Normal rank
@@ Property / cites work @@
+Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
+Normal rank
@@ Property / cites work @@
+Quenched central limit theorems for the Ising model on random graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Partition Function of the Ferromagnetic Potts Model
+Normal rank
@@ Property / cites work @@
+The Swendsen-Wang process does not always mix rapidly
+Normal rank
@@ Property / cites work @@
+The Random-Cluster Model
@@ Property / cites work: The Random-Cluster Model / rank @@
+Normal rank
@@ Property / cites work @@
+Random cluster dynamics for the Ising model is rapidly mixing
+Normal rank
@@ Property / cites work @@
+The random-cluster model on a homogeneous tree
@@ Property / cites work: The random-cluster model on a homogeneous tree / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Pirogov-Sinai theory
@@ Property / cites work: Algorithmic Pirogov-Sinai theory / rank @@
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for #BIS-Hard Problems on Expander Graphs
+Normal rank
@@ Property / cites work @@
+Independent sets in the hypercube revisited
@@ Property / cites work: Independent sets in the hypercube revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Permanent
@@ Property / cites work: Approximating the Permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Algorithms for the Ising Model
+Normal rank
@@ Property / cites work @@
+Cluster expansion for abstract polymer models
@@ Property / cites work: Cluster expansion for abstract polymer models / rank @@
+Normal rank
@@ Property / cites work @@
+Gibbs states and the set of solutions of random constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Interfaces in the Potts model. I: Pirogov-Sinai theory of the Fortuin- Kasteleyn representation
+Normal rank
@@ Property / cites work @@
+Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Cutoff phenomena for random walks on random regular graphs
+Normal rank
@@ Property / cites work @@
+Anomalous finite size corrections in random field models
+Normal rank
@@ Property / cites work @@
+Short cycles in random regular graphs
@@ Property / cites work: Short cycles in random regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Information, Physics, and Computation
@@ Property / cites work: Information, Physics, and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The Freezing Threshold for             <i>k</i>             -Colourings of a Random Graph
+Normal rank
@@ Property / cites work @@
+The weak limit of Ising models on locally tree-like graphs
+Normal rank
@@ Property / cites work @@
+Mathematical Aspects of Mixing Times in Markov Chains
+Normal rank
@@ Property / cites work @@
+On the Number of Solutions in Random Graph<i>k</i>-Colouring
+Normal rank
@@ Property / cites work @@
+Counting in two-spin models on \(d\)-regular graphs
+Normal rank
@@ Property / cites work @@
+Counting independent sets up to the tree threshold
+Normal rank
@@ Property / cites work @@
+The asymptotic distribution of short cycles in random regular graphs
+Normal rank