Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Villani's conjecture for Kac's walk

Abstract

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every N≥2, with total collision rate N, the optimal entropy production constant is 2/(N−1). We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With N fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

Related

  1. On the lower bound of the refined Bessis--Moussa--Villani conjecture: proof of the cases S_{6,3} and S_{7,3} for 3x3 matrices
    Daniel Hägele
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsarXiv
  2. A Walk From Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer Conjecture
    Tarun Kathuria
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. On the critical branching random walk I: branching capacity and visiting probability
    Qingsan Zhu
    Probability Theory and Related FieldsPeer-reviewedLicence not statedFull text21 citedMathematical physicsOpenAlex
  4. Interpolating walk between discrete-time quantum walk and its intrinsic random walk on graph
    Yusuke Higuchi, Etsuo Segawa, Honoka Shiratori +1
    arXivPreprintarXiv licenceFull textMathematical physicsarXiv
  5. Walk-on-Ambient-Patch: Solver-Adapted Isometric Embeddings for Projected Walk on Spheres
    Yunfeng Liao, Xiucheng Li
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{gao2026villanis,
  title = {{Villani's conjecture for Kac's walk}},
  author = {Fuqing Gao and Shaochen Wang and Xianjie Xia},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.22675},
  eprint = {2609.22675},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.22675},
}
RIS
TY  - UNPB
TI  - Villani's conjecture for Kac's walk
AU  - Fuqing Gao
AU  - Shaochen Wang
AU  - Xianjie Xia
PY  - 2026
DA  - 2026/09/19
PB  - arXiv
DO  - 10.48550/arxiv.2609.22675
UR  - https://arxiv.org/abs/2609.22675
AB  - We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every N≥2, with total collision rate N, the optimal entropy production constant is 2/(N−1). We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With N fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.
ER  -