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

推荐订阅源

WordPress大学
WordPress大学
大猫的无限游戏
大猫的无限游戏
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 叶小钗
月光博客
月光博客
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
人人都是产品经理
人人都是产品经理
阮一峰的网络日志
阮一峰的网络日志
罗磊的独立博客
IT之家
IT之家
美团技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Hugging Face - Blog
Hugging Face - Blog
博客园_首页
S
SegmentFault 最新的问题
宝玉的分享
宝玉的分享
博客园 - Franky
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Jina AI
Jina AI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The Cloudflare Blog
博客园 - 司徒正美
爱范儿
爱范儿

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Martingale approach for first-passage problems of time-ad...
[Submitted on 4 Apr 2025 (v1), last revised 13 Aug 2026 (this ve · 2025-04-04 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We develop a method based on martingales to study first-passage problems of time-additive observables exiting an interval of finite width in a Markov process. In the limit that the interval width is large, we derive generic expressions for the splitting probability and the cumulants of the first-passage time. These expressions relate first-passage quantities to the large deviation properties of the time-additive observable. We find that there are three qualitatively different regimes depending on the properties of the large deviation rate function of the time-additive observable. These regimes correspond to exponential, super-exponential, or sub-exponential suppression of events at the unlikely boundary of the interval. Furthermore, we show that the statistics of first-passage times at both interval boundaries are in general different, even for symmetric thresholds and in the limit of large interval widths. While the statistics of the times to reach the likely boundary are determined by the cumulants of the time-additive observables in the original process, those at the unlikely boundary are determined by a dual process. We obtain these results from a one-parameter family of positive martingales that we call Perron martingales, as these are related to the Perron root of a tilted version of the transition rate matrix defining the Markov process. Furthermore, we show that each eigenpair of the tilted matrix has a one-parameter family of martingales. To solve first-passage problems at finite thresholds, we generally require all one-parameter families of martingales, including the non-positive ones. We illustrate this by solving the first-passage problem for run-and-tumble particles exiting an interval of finite width.

Submission history

From: Izaak Neri [view email]
[v1] Fri, 4 Apr 2025 13:31:46 UTC (699 KB)
[v2] Tue, 13 May 2025 12:09:18 UTC (699 KB)
[v3] Thu, 13 Aug 2026 23:27:37 UTC (700 KB)