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

推荐订阅源

P
Proofpoint News Feed
Blog — PlanetScale
Blog — PlanetScale
GbyAI
GbyAI
C
Check Point Blog
腾讯CDC
Stack Overflow Blog
Stack Overflow Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
The GitHub Blog
The GitHub Blog
A
About on SuperTechFans
Recent Announcements
Recent Announcements
L
LangChain Blog
Microsoft Azure Blog
Microsoft Azure Blog
小众软件
小众软件
J
Java Code Geeks
博客园_首页
Jina AI
Jina AI
美团技术团队
H
Help Net Security
MyScale Blog
MyScale Blog
Engineering at Meta
Engineering at Meta
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
人人都是产品经理
人人都是产品经理
Y
Y Combinator Blog
S
SegmentFault 最新的问题

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 mating-of-trees approach for graph distances in random ...
Ewain Gwynne, Nina Holden, Xin Sun · 2017-11-02 · via math.PR updates on arXiv.org

We introduce a general technique for proving estimates for certain random planar maps which belong to the $γ$-Liouville quantum gravity (LQG) universality class for $γ\in (0,2)$. The family of random planar maps we consider are those which can be encoded by a two-dimensional random walk with i.i.d.\ increments via a mating-of-trees bijection, and includes the uniform infinite planar triangulation (UIPT; $γ=\sqrt{8/3}$); and planar maps weighted by the number of different spanning trees ($γ=\sqrt 2$), bipolar orientations ($γ=\sqrt{4/3}$), or Schnyder woods ($γ=1$) that can be put on the map. Using our technique, we prove estimates for graph distances in the above family of random planar maps. In particular, we obtain non-trivial upper and lower bounds for the cardinality of a graph distance ball consistent with the Watabiki (1993) prediction for the Hausdorff dimension of $γ$-LQG and we establish the existence of an exponent for certain distances in the map. The basic idea of our approach is to compare a given random planar map $M$ to a mated-CRT map---a random planar map constructed from a correlated two-dimensional Brownian motion---using a strong coupling (Zaitsev, 1998) of the encoding walk for $M$ and the Brownian motion used to construct the mated-CRT map. This allows us to deduce estimates for graph distances in $M$ from the estimates for graph distances in the mated-CRT map which we proved (using continuum theory) in a previous work. In the special case when $γ=\sqrt{8/3}$, we instead deduce estimates for the $\sqrt{8/3}$-mated-CRT map from known results for the UIPT. The arguments of this paper do not directly use SLE/LQG, and can be read without any knowledge of these objects.