On the moments of the Ulam–Kac adder

Abstract Let left brace upper U left parenthesis n right parenthesis right brace Subscript n greater than or equals 0 { U ( n ) } n ≥ 0 $\{U(n)\}_{n \geq 0}$ be a sequence of independent random variables such that U ( n ) is distributed uniformly on StartSet 0 comma 1 comma 2 comma ellipsis comma n EndSet { 0 , 1 , 2 , … , n } $\{0, 1, 2, \dots, n\}$ . The Ulam–Kac adder is the history-dependent random sequence defined by upper X Subscript n plus 1 Baseline equals upper X Subscript n Baseline plus upper X Subscript upper U left parenthesis n right parenthesis X n + 1 = X n + X U ( n ) $X_{n + 1} = X_{n} + X_{U(n)}$ with the initial condition upper X 0 equals 1 X 0 = 1 $X_0 = 1$ . We show that for each m greater than or equals 1 m ≥ 1 $m \geq 1$ , log double struck upper E left bracket upper X Subscript n Superscript m Baseline right bracket divided by StartRoot n EndRoot log ⁡ E [ X n m ] / n

Authors

Institutions

Publication Details

Journal
Journal of Applied Probability
Published
2026-11-04
DOI
https://doi.org/10.1017/jpr.2026.10136
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the moments of the Ulam–Kac adder

Gage Bonner
Journal of Applied Probability
Stochastic processes and statistical mechanics
article

On the moments of the Ulam–Kac adder

Gage Bonner
article en

Abstract

Abstract Let left brace upper U left parenthesis n right parenthesis right brace Subscript n greater than or equals 0 { U ( n ) } n ≥ 0 $\{U(n)\}_{n \geq 0}$ be a sequence of independent random variables such that U ( n ) is distributed uniformly on StartSet 0 comma 1 comma 2 comma ellipsis comma n EndSet { 0 , 1 , 2 , … , n } $\{0, 1, 2, \dots, n\}$ . The Ulam–Kac adder is the history-dependent random sequence defined by upper X Subscript n plus 1 Baseline equals upper X Subscript n Baseline plus upper X Subscript upper U left parenthesis n right parenthesis X n + 1 = X n + X U ( n ) $X_{n + 1} = X_{n} + X_{U(n)}$ with the initial condition upper X 0 equals 1 X 0 = 1 $X_0 = 1$ . We show that for each m greater than or equals 1 m ≥ 1 $m \geq 1$ , log double struck upper E left bracket upper X Subscript n Superscript m Baseline right bracket divided by StartRoot n EndRoot log ⁡ E [ X n m ] / n

Journal of Applied Probability
Morgridge Institute for Research (US)
Openalex Percentile: Top 98%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
On the moments of the Ulam–Kac adder — Gage Bonner · Journal of Applied Probability (2026) | TGRS Research Map | TGRS