2108.01332
Arcsine and Darling–Kac laws for a piecewise linear random interval map
Genji Hata, Kouji Yano
correctmedium confidence
- Category
- Not specified
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper proves arcsine and Darling–Kac laws for the Hata random map via Markov partitions, conjugacy to a Markov chain on the λ-partition, wandering-rate asymptotics, and the Thaler–Zweimüller framework, obtaining exactly the two limit laws in Theorem 1.2. The candidate solution reaches the same two conclusions by a different, renewal/local-time route: it coarse-grains the dynamics into side/depth variables, derives heavy-tailed sojourns, invokes Lamperti’s arcsine law, and identifies the √N-normalized visit counts with Brownian local time. One technical imprecision in the model solution is the identification of a side-sojourn length with a single hitting time from a geometric height; in fact it is a geometric sum of such hitting times, but this does not affect the limiting laws. Overall, both are correct; the paper’s proof is rigorous and complete; the model’s proof outline is essentially correct but glosses some details.
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions
\textbf{Journal Tier:} specialist/solid
\textbf{Justification:}
The paper presents a rigorous and well-structured proof of arcsine and Darling–Kac laws for a concrete random interval map, complementing classical deterministic intermittent systems. The methodology—Markov partition, conjugacy to a Markov chain, and wandering-rate analysis tied to an embedded simple symmetric random walk—is both clear and effective. Minor improvements in exposition would further aid readers, but the mathematical content appears correct and valuable to the field.