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

推荐订阅源

月光博客
月光博客
罗磊的独立博客
The GitHub Blog
The GitHub Blog
V
V2EX
Last Week in AI
Last Week in AI
博客园 - 聂微东
MyScale Blog
MyScale Blog
美团技术团队
L
LangChain Blog
博客园 - Franky
腾讯CDC
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园_首页
S
SegmentFault 最新的问题
爱范儿
爱范儿
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Stack Overflow Blog
Stack Overflow Blog
量子位
小众软件
小众软件
宝玉的分享
宝玉的分享
J
Java Code Geeks
Google DeepMind News
Google DeepMind News
D
Docker
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报

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
Explicit dynamical properties of the Pelikan random map i...
Cecile Monthus · 2024-09-30 · via math.PR updates on arXiv.org

The Pelikan random trajectories $x_t \in [0,1[$ are generated by choosing the chaotic doubling map $x_{t+1}=2 x_t [mod 1]$ with probability $p$ and the non-chaotic half-contracting map $x_{t+1}=\frac{x_t}{2}$ with probability $(1-p)$. We compute various dynamical observables as a function of the parameter $p$ via two perspectives. In the first perspective, we focus on the closed dynamics within the subspace of probability densities that remain constant on the binary-intervals $x \in [ 2^{-n-1}, 2^{-n}[$ partitioning the interval $x \in [0,1[$ : the dynamics for the weights $π_t(n)$ of these intervals corresponds to a biased random walk on the half-infinite lattice $n \in \{0,1,2,..+\infty\}$ with resetting occurring with probability $p$ from the origin $n=0$ towards any site $n$ drawn with the distribution $2^{-n-1}$. In the second perspective, we study the Pelikan dynamics for any initial condition $x_0$ via the binary decomposition $x_t = \sum_{l=1}^{+\infty} \frac{σ_l (t)}{2^l} $, where the dynamics for the half-infinite lattice $l=1,2,..$ of the binary variables $σ_l(t) \in \{0,1\}$ can be reformulated in terms of two global variables : $z_t$ corresponds to a biased random walk on the half-infinite lattice $z \in \{0,1,2,..+\infty\}$ that may remain at the origin $z=0$ with probability $p$, while $F_t \in \{0,1,2,..t\}$ counts the number of time-steps $τ\in [0,t-1]$ where $z_{τ+1}=0=z_τ$ and represents the number of the binary coefficients of the initial condition that have been erased. We discuss typical and large deviations properties in the chaotic region $\frac{1}{2}<p<1 $ as well as at the intermittent critical point $p_c=\frac{1}{2}$ towards the non-chaotic region $0<p<\frac{1}{2}$.