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

推荐订阅源

Google DeepMind News
Google DeepMind News
B
Blog RSS Feed
The GitHub Blog
The GitHub Blog
Recent Announcements
Recent Announcements
A
About on SuperTechFans
G
Google Developers Blog
aimingoo的专栏
aimingoo的专栏
U
Unit 42
WordPress大学
WordPress大学
Y
Y Combinator Blog
罗磊的独立博客
J
Java Code Geeks
Microsoft Azure Blog
Microsoft Azure Blog
腾讯CDC
博客园 - 叶小钗
Stack Overflow Blog
Stack Overflow Blog
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
GbyAI
GbyAI
V
V2EX
雷峰网
雷峰网
H
Hackread – Cybersecurity News, Data Breaches, AI and More
S
SegmentFault 最新的问题
酷 壳 – CoolShell
酷 壳 – CoolShell

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 ant on loops: Alexander-Orbach conjecture for the cri...
Shirshendu Ganguly, Kyeongsik Nam · 2024-03-05 · via math.PR updates on arXiv.org

Alexander and Orbach (AO) in 1982 conjectured that the simple random walk on critical percolation clusters (also known as the ant in the labyrinth) in Euclidean lattices exhibit mean field behavior; for instance, its spectral dimension is $4/3$. While false in low dimensions, this is expected to be true above the upper critical dimension of six. First rigorous results in this direction go back to Kesten who verified this on the tree. After many developments, in a breakthrough work, Kozma and Nachmias [KN] established the AO conjecture for bond percolation on $\mathbb{Z}^d$ for $d>19$ and $d>6$ for the spread out lattice. We investigate the validity of the AO conjecture for the critical level set of the Gaussian Free Field (GFF), a canonical dependent percolation model of central importance. In an influential work, Lupu proved that for the cable graph of $\mathbb{Z}^d$ (which is obtained by also including the edges), the signed clusters of the associated GFF are given by the corresponding clusters in a Poisson loop soup, thus reducing the analysis to the study of the latter. In 2021, Werner put forth an evocative picture for the critical behavior in this setting drawing an analogy with the usual bond case. Building on this, Cai and Ding established the universality of the extrinsic one arm exponent for all $d > 6.$ In this article, we carry this program further, and consider the random walk on sub-sequential limits of the cluster of the origin conditioned to contain far away points. These form candidates for the Incipient Infinite Cluster (IIC), first introduced by Kesten in the planar case. Inspired by the program of [KN], introducing several novel ideas to tackle the long range nature of this model and its effect on the intrinsic geometry of the percolation cluster, we establish that the AO conjecture indeed holds for any sub-sequential IIC, for all large enough dimensions.