A Crawling Metric on the Space of Subtrees of a Tree

Thu-Le Tran; Cao Minh Quang; Nguyen Chi Tam; Kien Trung Nguyen

Home/Archive/arXiv

arXiv · 2610.24448

A Crawling Metric on the Space of Subtrees of a Tree

Thu-Le Tran·Cao Minh Quang·Nguyen Chi Tam·Kien Trung Nguyen

View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a crawling metric on the space of subtrees of a tree. The symmetric difference cannot tell whether two disjoint subtrees are close or far; we halve it and add the gap between them. The result is a metric, one half is the smallest factor, and the tree embeds canonically. The metric equals the least cost of crawling between subtrees by growing and shrinking without jumping. With simultaneous growth and shrinkage, subtrees of fixed length form a geodesic space.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Thu-Le Tran, Cao Minh Quang, Nguyen Chi Tam, Kien Trung Nguyen. 2026-10-17. A Crawling Metric on the Space of Subtrees of a Tree. https://arxiv.org/abs/2610.24448

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks

A key challenge in decentralized optimization is determining the optimal convergence rate and designing algorithms to achieve it. While this problem has been extensively addressed for doubly-stochastic and column-stochastic mixing matrices, the row-stochastic scenario remains unexplored. This paper bridges this gap by introducing effective metrics to capture the influence of row-stochastic mixing matrices and establishing the first convergence lower bound for decentralized learning over row-stochastic networks. However, existing algorithms fail to attain this lower bound due to two key issues: deviation in the descent direction caused by the adapted gradient tracking (GT) and instability introduced by the Pull-Diag protocol. To address descent deviation, we propose a novel analysis framework demonstrating that Pull-Diag-GT achieves linear speedup, the first such result for row-stochastic decentralized optimization. Moreover, by incorporating a multi-step gossip (MG) protocol, we resolve the instability issue and attain the lower bound, achieving near-optimal complexity for decentralized optimization over row-stochastic networks.

math.OC↗

arXiv2026

A new $ν$-metric computational example for the diffusion equation with boundary control and point observation

The $ν$-metric used in robust control is computed for control systems with parametric uncertainty, governed by a diffusion equation in a bounded one-dimensional spatial region with boundary control and point observation.

math.OC↗

arXiv2026

Muon Dynamics as a Spectral Wasserstein Flow

Gradient normalization can stabilize deep-learning optimization, and spectral normalizations are especially natural for matrix-shaped parameter blocks; Muon is the motivating example. We study an idealized deterministic, continuous-time, vanishing-momentum version of this idea in the mean-field regime, where wide models are represented by probability measures on parameter space. Starting from normalized matrix flows, we introduce Spectral Wasserstein distances indexed by norms $γ$ on positive semidefinite matrices: the trace norm recovers the classical $W_2$ distance, the operator norm gives the Muon geometry, and Schatten norms interpolate between them. We develop a static Kantorovich formulation, a max--min robust-cost representation, and Gaussian reductions extending the Bures formula. For monotone norms, we prove equivalence with a Benamou--Brenier formulation and obtain a gradient-flow interpretation of normalized mean-field training dynamics. Numerical experiments illustrate the resulting flows for MMD objectives, Gaussian reductions, two-layer ReLU models, and shallow attention.

math.OC↗