Approximate stochastic localization plus conductance transfers yield a weak Poincaré inequality for the SK model at β < 1/2, enabling efficient Glauber sampling from a warm start.
Hamilton cycles in random graphs: a bibliography
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergraphs.
representative citing papers
Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
The paper finds the threshold probability for random subgraphs of Dirac graphs to admit Hamilton cycle transversals and derives optimal counting and packing corollaries that generalize single-graph Hamilton cycle results.
citing papers explorer
-
Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model
Approximate stochastic localization plus conductance transfers yield a weak Poincaré inequality for the SK model at β < 1/2, enabling efficient Glauber sampling from a warm start.
-
Dirac subgraphs of powers of cycles are Hamiltonian
Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
-
Robust Hamiltonicity in families of Dirac graphs
The paper finds the threshold probability for random subgraphs of Dirac graphs to admit Hamilton cycle transversals and derives optimal counting and packing corollaries that generalize single-graph Hamilton cycle results.