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

推荐订阅源

C
Check Point Blog
罗磊的独立博客
量子位
Microsoft Azure Blog
Microsoft Azure Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
J
Java Code Geeks
M
MIT News - Artificial intelligence
月光博客
月光博客
IT之家
IT之家
D
DataBreaches.Net
A
About on SuperTechFans
博客园 - 三生石上(FineUI控件)
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Last Week in AI
Last Week in AI
D
Docker
The GitHub Blog
The GitHub Blog
B
Blog
V
Visual Studio Blog
博客园 - Franky
N
Netflix TechBlog - Medium
博客园 - 【当耐特】
Martin Fowler
Martin Fowler
博客园 - 聂微东
U
Unit 42

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
Variable-Length Markov Chains on Finite Quivers: Boundary...
Oleg Kiriukhin · 2026-04-13 · via math.PR updates on arXiv.org

Variable-length Markov chains on finite quivers provide a natural framework for context-dependent stochastic growth under incidence constraints. I study quiver-valued variable-length Markov chains observed through finite boundary windows and develop a first-order theory of visible-depth identifiability via stationary visible one-step transition laws and their restricted differentials on prescribed tangent blocks. For visible depth $m$, the main object is the stationary one-step informative map $q_{\mathcal{Q}}^{(m)}$. In the edge-homogeneous regime, once the local visible support is fixed and the representation hypothesis holds, all admissible visible depths encode the same edge-level extension law and hence have the same first-order rank. In the exact-depth regime of context length $r$, the depth-$r$ boundary process is the canonical finite-state Markov chain, smaller visible windows are deterministic truncations, and every coarser informative map factors $C^1$-smoothly through the depth-$r$ informative map on the relevant affine transition-array neighborhood. Hence rank cannot increase beyond depth $r$. After quotienting a tangent block by directions already invisible at depth $r$, I characterize strict coarse-depth loss exactly by coarse rank deficiency, equivalently by strict rank drop from depth $r$ to depth $m$ on the original block. I also give subspace-based and global selected-coordinate criteria, a global one-coordinate branching criterion, and an explicit depth-two example. Under full fine-depth rank and strict coordinate-rank loss at every smaller depth, a global coordinate-rank theorem yields $m_*(T,θ_0)=r$. Reduced local coordinates remove stochastic redundancies, first-order criteria are invariant under $C^1$ reparameterization, and the statistical and LAN consequences remain conditional on additional estimation and likelihood-level hypotheses.