Metraipolis › archive › dc_26df97b0a378

Balancing fractional Brownian motion — arXiv:2608.09465

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09465
License (as archived)
CC0-1.0
Archived
2026-10-19T09:07:02.225Z
SHA-256 of the archived text
97a35436b9f47e0b70d6cc83c73218222c5adf0af65c95238c80513b784b26bf
Stable URL of this page
https://metraipolis.com/documento/dc_26df97b0a378

How to cite

Balancing fractional Brownian motion — arXiv:2608.09465 — arXiv (en), https://arxiv.org/abs/2608.09465 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_26df97b0a378 (Metraipolis archive dc_26df97b0a378, sha256 97a35436b9f47e0b70d6cc83c73218222c5adf0af65c95238c80513b784b26bf)
BibTeX
@misc{dc26df97b0a378,
  title = {Balancing fractional Brownian motion — arXiv:2608.09465},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09465},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_26df97b0a378; sha256 97a35436b9f47e0b70d6cc83c73218222c5adf0af65c95238c80513b784b26bf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09465. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the discrepancy of balancing $n$ independent sample paths of fractional Brownian motion with Hurst exponent $H\in(0,1)$ on $[0,1]$, an infinite-dimensional analogue of balancing Gaussian vectors. We establish a phase transition at $H=1/2$: with high probability, the discrepancy is $\Omega(n^{1/2-H})$ and $\mathcal O(n^{1/2-H}(\log n)^{c(H)})$, where $c(H)=H+1/2$ if $H\geq 1/2$ and $c(H)=1/2$ otherwise. At the critical exponent $H=1/2$, we show that the discrepancy is $\Theta(1)$ with constant probability as $n\to\infty$. In this regime, we further characterize the geometry of the solution space by computing the expected number of local minima, establishing an overlap gap property near the existence threshold, and proving its absence at every diverging optimality threshold. We also give randomized polynomial-time algorithms that compute signings with discrepancy $\mathcal O(n^{1/2-H}\sqrt{\log n})$ for $H<1/2$, $\mathcal O((\log n)^{3/2})$ for $H=1/2$, and $\mathcal O(\sqrt{\log n})$ for $H>1/2$, with high probability. Our analysis combines a truncated balancing argument based on a wavelet representation of fractional Brownian motion with probabilistic methods.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.PR).
Categorie arXiv: Probability (math.PR) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2608.09465 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:04:32.179Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).