Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Holoclean: Holistic data repairs with probabilistic inference
We introduce HoloClean, a framework for holistic data repairing driven by probabilistic
inference. HoloClean unifies existing qualitative data repairing approaches, which rely on …
inference. HoloClean unifies existing qualitative data repairing approaches, which rely on …
Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion
We prove an optimal mixing time bound for the single-site update Markov chain known as
the Glauber dynamics or Gibbs sampling in a variety of settings. Our work presents an …
the Glauber dynamics or Gibbs sampling in a variety of settings. Our work presents an …
On mixing of markov chains: Coupling, spectral independence, and entropy factorization∗
For general spin systems, we prove that a contractive coupling for an arbitrary local Markov
chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a …
chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a …
Dissipative phase transitions and passive error correction
We classify different ways to passively protect classical and quantum information, ie, we do
not allow for syndrome measurements, in the context of local Lindblad models for spin …
not allow for syndrome measurements, in the context of local Lindblad models for spin …
Rigorous inequalities between length and time scales in glassy systems
Glassy systems are characterized by an extremely sluggish dynamics without any simple
sign of long range order. It is a debated question whether a correct description of such …
sign of long range order. It is a debated question whether a correct description of such …
From coupling to spectral independence and blackbox comparison with the down-up walk
K Liu - arxiv preprint arxiv:2103.11609, 2021 - arxiv.org
We show that the existence of a" good"'coupling wrt Hamming distance for any local Markov
chain on a discrete product space implies rapid mixing of the Glauber dynamics in a …
chain on a discrete product space implies rapid mixing of the Glauber dynamics in a …
Optimal mixing for two-state anti-ferromagnetic spin systems
We prove an optimal Ω(n^-1) lower bound for modified \log-Sobolev (MLS) constant of the
Glauber dynamics for anti-ferromagnetic two-spin systems with n vertices in the tree …
Glauber dynamics for anti-ferromagnetic two-spin systems with n vertices in the tree …
Improved bounds for randomly sampling colorings via linear programming
A well-known conjecture in computer science and statistical physics is that Glauber
dynamics on the set of k-colorings of a graph G on n vertices with maximum degree Δ is …
dynamics on the set of k-colorings of a graph G on n vertices with maximum degree Δ is …
Flip Dynamics for Sampling Colorings: Improving (11/6—ε) Using A Simple Metric
We present improved bounds for randomly sampling k-colorings of graphs with maximum
degree Δ; our results hold without any further assumptions on the graph. The Glauber …
degree Δ; our results hold without any further assumptions on the graph. The Glauber …
Exact thresholds for Ising–Gibbs samplers on general graphs
We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising
model on general graphs. We show that if (d-1)\tanhβ<1, then there exists a constant C such …
model on general graphs. We show that if (d-1)\tanhβ<1, then there exists a constant C such …