Metraipolis › archive › dc_34ee4ace0d87

Optimal exponential memory for sequential Euclidean connections: edge-power costs and phase transitions — arXiv:2608.27777

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27777
License (as archived)
CC0-1.0
Archived
2026-10-17T11:17:53.630Z
SHA-256 of the archived text
e8eada63bd1fcc9d535b8c36da8bcd4ea0a3b0ddfb6e21fb200e6d0a7b4257e3
Stable URL of this page
https://metraipolis.com/documento/dc_34ee4ace0d87

How to cite

Optimal exponential memory for sequential Euclidean connections: edge-power costs and phase transitions — arXiv:2608.27777 — arXiv (en), https://arxiv.org/abs/2608.27777 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34ee4ace0d87 (Metraipolis archive dc_34ee4ace0d87, sha256 e8eada63bd1fcc9d535b8c36da8bcd4ea0a3b0ddfb6e21fb200e6d0a7b4257e3)
BibTeX
@misc{dc34ee4ace0d87,
  title = {Optimal exponential memory for sequential Euclidean connections: edge-power costs and phase transitions — arXiv:2608.27777},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27777},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34ee4ace0d87; sha256 e8eada63bd1fcc9d535b8c36da8bcd4ea0a3b0ddfb6e21fb200e6d0a7b4257e3},
  year = {2026}
}

Archived text

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

We study the edge-power cost of the labelled tree generated by the $\gamma$-strategy, a constant-gain rule for sequential Euclidean connections. Starting with $x_0=p_0$, each input point $p_i$ is attached to $x_{i-1}$, and the state is updated by $x_i=\gamma x_{i-1}+(1-\gamma)p_i$. Retaining $x_i$ subdivides the insertion segment into a spine edge and a leaf edge. The memory parameter $\gamma$ controls how long earlier points influence subsequent attachment points. We minimize the sum of the $\alpha$-powers of the edge lengths under independent uniform input and arbitrary input sequences. For uniform points in the unit ball, the stationary problem has a transition at $\alpha=1$. Its continuous extension is minimized at the boundary for $0<\alpha\leq1$, while every global minimizer is interior for $\alpha>1$. We determine the finite optimizer in the joint window $\alpha_N=1+\varepsilon_N$, $\varepsilon_N\log N\to\lambda$. Below an explicit threshold it lies on the $N^{-1/2}$ scale, at the threshold its scale is $\sqrt{\log N/(N\log\log N)}$, and above the threshold it approaches an explicit stationary root with two computable corrections. A second threshold identifies the governing correction, and differentiated estimates prove eventual uniqueness. At $\alpha=3d+8$, the linear coefficient at the stationary endpoint changes sign and a branch of strict local maxima enters the parameter interval. For arbitrary input sequences, the optimal parameter and asymptotic worst-case edge-power cost per point are explicit for $0<\alpha\leq3$. At high powers, periodic antipodal block inputs give explicit lower bounds which, with a separation argument, show that the optimized cost is asymptotic to $2\log2/\log\alpha$. Exact results for powers two and four, a rational recursion for every even power, and a high-dimensional expansion complete the analysis.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.OC).
Categorie arXiv: Computational Geometry (cs.CG) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.27777 — 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-17T10:58:16.486Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).