Optimization of the dynamic transition in the continuous coloring problem

DOI10.1088/1742-5468/AC382EMaRDI QIDQ5020002zbMATH OpenOpenAlexFDO

Authors Angelo Giorgio Cavaliere, Thibault Lesieur, Federico Ricci-Tersenghi

Publication date 3 January 2022

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.13645

zbMATH Keywords

agingspin glassesglassy dynamicsslow relaxation

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• The asymptotics of the clustering transition for random constraint satisfaction problems
• Phase transitions in the \(q\)-coloring of random hypergraphs
• Biased landscapes for random constraint satisfaction problems
• Phase transitions of random constraint satisfaction problems
• The condensation phase transition in random graph coloring

Cites work

• Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
• Biased landscapes for random constraint satisfaction problems
• Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Information flow on trees
• Local entropy as a measure for sampling solutions in constraint satisfaction problems
• On the dynamics of the glass transition on Bethe lattices
• On the solution of a ``solvable model of an ideal Glass of hard spheres displaying a jamming transition
• Robust reconstruction on trees is determined by the second eigenvalue.
• The large deviations of the whitening process in random constraint satisfaction problems

This page was built for publication: Optimization of the dynamic transition in the continuous coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020002)