惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

The Cloudflare Blog
L
LangChain Blog
WordPress大学
WordPress大学
V
V2EX
M
MIT News - Artificial intelligence
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Stack Overflow Blog
Stack Overflow Blog
J
Java Code Geeks
F
Fortinet All Blogs
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
腾讯CDC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
D
Docker
Recent Announcements
Recent Announcements
GbyAI
GbyAI
博客园 - 叶小钗
小众软件
小众软件
Hugging Face - Blog
Hugging Face - Blog
T
The Blog of Author Tim Ferriss
人人都是产品经理
人人都是产品经理
Engineering at Meta
Engineering at Meta
Y
Y Combinator Blog
雷峰网
雷峰网
The GitHub Blog
The GitHub Blog

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for Primes in Short Intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
The macroscopic shape of Gelfand-Tsetlin patterns and fre...
[Submitted on 14 Oct 2024 (v1), last revised 23 Jul 2026 (this v · 2024-10-15 · via math.PR updates on arXiv.org

View PDF

Abstract:A compression is a function $F:\mathbb{R}\times[0,1]\to[0,1]$ such that each $F(\cdot,\tau)$ is the distribution function of a measure of mass $\tau$, while each $F(x,\cdot)$ is increasing and $1$-Lipschitz. Compressions are continuum analogues of Gelfand--Tsetlin patterns: if $(t_{k,j})_{ 0 \leq j \leq k \leq n}$ is a Gelfand--Tsetlin pattern, setting $F(t_{k,j},k/n) = j/n$ and interpolating creates a compression. For a differentiable compression $F$, we define the compression entropy \begin{align*} \mathcal{H}[F] :=\int_{-\infty}^\infty\int_0^1 F_x \left\{-\log F_x+\log\sin(\pi F_\tau)+1-\log\pi\right\} \mathrm{d}\tau\mathrm{d}x. \end{align*} If $\mu$ is absolutely continuous and compactly supported, we prove \begin{equation*} \sup\left\{\mathcal{H}[F]:F \text{ compression}, F(\cdot,1)\text{ is the distribution function of }\mu\right\} =\chi[\mu], \end{equation*} where $\chi[\mu]$ is Voiculescu's free entropy. By identifying the Euler--Lagrange equations for $\mathcal{H}[F]$ with a Burgers equation for Cauchy transforms, we show that the supremum is attained uniquely by the free compression of free probability theory.
We also view Gelfand--Tsetlin patterns as Ginzburg--Landau $\nabla\phi$-interface models with a hard-core interaction, and compute the surface tension: \begin{equation*} \sigma(u_1,u_2) =-\log(u_1+u_2)-\log\sin\left(\pi\frac{u_1}{u_1+u_2}\right)-1+\log\pi. \end{equation*} Finally, we prove that uniform $n$-dimensional Gelfand--Tsetlin patterns with deterministic bottom rows converging to $\mu$ satisfy a large deviation principle with speed $n^2$ and rate function \begin{equation*} I_\mu[F]=-\mathcal{H}[F]+\chi[\mu]. \end{equation*} These results resolve a conjecture of Shlyakhtenko and Tao stating that the Euler--Lagrange equations for free compression arise from the statistical mechanics of interlacing point processes.

Submission history

From: Samuel Johnston [view email]
[v1] Mon, 14 Oct 2024 17:26:27 UTC (62 KB)
[v2] Tue, 15 Oct 2024 07:40:23 UTC (62 KB)
[v3] Thu, 23 Jul 2026 18:59:39 UTC (3,275 KB)