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

推荐订阅源

Y
Y Combinator Blog
腾讯CDC
Recent Announcements
Recent Announcements
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Hugging Face - Blog
Hugging Face - Blog
H
Help Net Security
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Last Week in AI
Last Week in AI
博客园_首页
D
DataBreaches.Net
P
Proofpoint News Feed
云风的 BLOG
云风的 BLOG
V
Visual Studio Blog
月光博客
月光博客
Jina AI
Jina AI
Stack Overflow Blog
Stack Overflow Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 【当耐特】
Vercel News
Vercel News
WordPress大学
WordPress大学
J
Java Code Geeks
博客园 - 聂微东
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
U
Unit 42

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
A direct comparison between the mixing time of the interc...
Jonathan Hermon, Richard Pymar · 2021-05-28 · via math.PR updates on arXiv.org

We consider the interchange process with $k$ particles (${\rm IP}(k)$) on $n$-vertex hypergraphs in which each hyperedge $e$ rings at rate $r_e$. When $e$ rings, the particles occupying it are permuted according to a random permutation from some arbitrary law, where our only assumption is that ${\rm IP}(2)$ has uniform stationary distribution. We show that $t_{\rm mix}^{{\rm IP}(k)}(ε)=O_{b}(t_{\rm mix}^{{\rm IP}(2)}(ε/k))$, where $t_{\rm mix}^{{\rm IP}(i)}(ε)$ is the $ε$ total-variation mixing time of ${\rm IP}(i)$, provided that $kn^{-2}Rt_{\rm mix}^{{\rm IP}(2)}(ε/k)=O((ε/k)^b)$ for some $b>0$, where $R=\sum_e r_e|e|(|e|-1)$ is $n(n-1)$ times the particle-particle interaction rate at equilibrium. This has some consequences concerning the validity in this regime of conjectures of Oliveira about comparison of the $ε$ mixing time of ${\rm IP}(k)$ to that of $k$ independent particles, each evolving according to ${\rm IP}(1)$, denoted ${\rm RW}(k)$, and of Caputo about comparison of the spectral-gap of ${\rm IP}(k)$ to that of a single particle ${\rm IP}(1)={\rm RW}(1)$. We also show that $t_{\rm mix}^{\mathrm{IP}(k)}(ε) \asymp t_{\rm mix}^{{\rm RW}(1)}(ε)\asymp t_{\rm mix}^{{\rm RW}(k)}(εk/4)$ for all $k\lesssim n^{1-Ω(1)}$ and all $ε\le\frac 1k\wedge\frac 14$ for vertex-transitive graphs of constant degree, as well as for general graphs satisfying a mild ("transience-like") heat-kernel condition. In the case where the particles occupying a hyperedge $e$ are permuted uniformly at random when $e$ rings we obtain results bounding the spectral gap of ${\rm IP}(k)$ in terms of that ${\rm RW}(1)$. The proof does not use Morris' chameleon process. It can be seen as a rigorous and direct way of arguing that when the number of particles is fairly small, the system behaves similarly to $k$ independent particles.