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

推荐订阅源

有赞技术团队
有赞技术团队
美团技术团队
博客园 - 司徒正美
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
阮一峰的网络日志
阮一峰的网络日志
S
SegmentFault 最新的问题
博客园_首页
雷峰网
雷峰网
V
V2EX
The Cloudflare Blog
博客园 - 三生石上(FineUI控件)
量子位
Last Week in AI
Last Week in AI
人人都是产品经理
人人都是产品经理
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 聂微东
V
Visual Studio Blog
Hugging Face - Blog
Hugging Face - Blog
博客园 - 【当耐特】
Jina AI
Jina AI
月光博客
月光博客
L
LangChain 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
Tightness of $(H, H^{RW})$-Gibbsian line ensembles
Evgeni Dimitrov, Xuan Wu · 2021-08-17 · via math.PR updates on arXiv.org

We develop a black-box theory, which can be used to show that a sequence of Gibbsian line ensembles is tight, provided that the one-point marginals of the lowest labeled curves of the ensembles are tight and globally approximate an inverted parabola. Our theory is applicable under certain technical assumptions on the nature of the Gibbs property and the underlying random walk measure. As a particular application of our general framework we show that a certain sequence of Gibbsian line ensembles, which naturally arises in the log-gamma polymer, is tight in the ubiquitous KPZ class $1/3: 2/3$ scaling, and also that all subsequential limits satisfy the Brownian Gibbs property, introduced by Corwin and Hammond in (Invent. Math. 195, 441-508, 2014). One of the core results proved in the paper, which underlies many of our arguments, is the construction of a continuous grand monotone coupling of Gibbsian line ensembles with respect to their boundary data (entrance and exit values, and bounding curves). Continuous means that the Gibbsian line ensemble measure varies continuously as one varies the boundary data, grand means that all uncountably many measures (one for each boundary data) are coupled to the same probability space, and monotone means that raising the values of the boundary data likewise raises the associated measure. Our continuous grand monotone coupling generalizes an analogous construction, which was recently implemented by Barraquand, Corwin and Dimitrov in (arXiv:2101.03045), from line ensembles with a single curve to ones with an arbitrary finite number of curves.