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

推荐订阅源

Microsoft Azure Blog
Microsoft Azure Blog
Engineering at Meta
Engineering at Meta
A
About on SuperTechFans
T
The Blog of Author Tim Ferriss
I
InfoQ
博客园_首页
G
Google Developers Blog
爱范儿
爱范儿
Last Week in AI
Last Week in AI
量子位
阮一峰的网络日志
阮一峰的网络日志
雷峰网
雷峰网
酷 壳 – CoolShell
酷 壳 – CoolShell
Vercel News
Vercel News
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
GbyAI
GbyAI
月光博客
月光博客
The GitHub Blog
The GitHub Blog
V
Visual Studio Blog
N
Netflix TechBlog - Medium
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 司徒正美
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 聂微东

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
Comparison of Brownian jump and Brownian bridge resetting...
Ross G. Pinsky · 2022-05-04 · via math.PR updates on arXiv.org

For $d\ge1$ and $r>0$, let $X^{(d;r)}(\cdot)$ be a $d$-dimensional Brownian motion with diffusion coefficient $D$, equipped with an exponential clock with rate $r$. When the clock rings, the process jumps to the origin and begins anew. For a parameter $T>0$, let $X^{\text{bb},d;T}(\cdot)$ be the process that performs a $d$-dimensional Brownian bridge with diffusion coefficient $D$ and bridge interval $T$, and then at time $T$ starts anew from the origin, and let $X^{d;T}$ be the process that performs a $d$-dimensional Brownian motion with diffusion coefficient $D$ up until time $T$, at which time it jumps to the origin and begins anew. Denote expectations by $E_0^{d;r},E_0^{\text{bb},d;T}$ and $E_0^{d;T}$. These Markov processes with resetting search for a random target $a\in\mathbb{R}^d$ with centered Gaussian distribution of variance $σ^2$, denoted by $μ_{σ^2}^{\text{Gauss},d}$. Fix $ε_0>0$. Let $τ_a$ be the hitting time of $a$, for $d=1$, and the hitting time of the $ε_0$-ball around $a$, for $d\ge2$. The expected time to locate the target for each of the processes is $\int_{\mathbb{R}^d}\big(E_0^*τ_a\big)μ_{σ^2}^{\text{Gauss},d}(da)$, where $E_0^*$ stands for $E_0^{d;r}, E_0^{\text{bb},d;T}$ or $E_0^{d;T}$. For $d=1$ and $d=3$, we calculate the infimum of each of the above expressions over $r>0$ or $T>0$ as appropriate, in order to compare the relative efficiencies of the three search processes. In terms of the parameters $D$ and $σ$, in the 1-dimensional case these infima scale as $\frac{σ^2}D$, which is a natural scaling, but in the 3-dimensional case, they scale anomalously as $\frac{σ^3}D$. We also show that in the 2-dimensional case, the infimum over $r>0$ for the first of the three search processes scales as $\frac{σ^2}D$ as in the 1-dimensional case.