Search arXivSearch

arXiv · 2603.19382

Emergent Higher-Order Structure from Fast Adaptive Networks

Abstract

We study adaptive network models in which coupling weights evolve on a fast time scale relative to the phase dynamics of the nodes. Using Geometric Singular Perturbation Theory (GSPT), we prove that, although the microscopic system is strictly pairwise, the effective slow dynamics on the invariant slow manifold can exhibit genuinely higher-order structure. More precisely, Fenichel reduction produces explicit $O(\varepsilon)$ triplet terms in the reduced phase dynamics. In addition, we give a rigorous criterion ensuring that these terms are irreducible, in the sense that the reduced vector field does not admit a pairwise decomposition in node coordinates. We derive the first-order slow-manifold correction explicitly, formulate the irreducibility criterion via mixed second derivatives, and verify it for the adaptive Kuramoto phase oscillator model. The results show that the class of pairwise-coupled fast--slow adaptive network systems is not closed under slow-manifold reduction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Kuehn, Fergal Murphy. 2026-03-19. Emergent Higher-Order Structure from Fast Adaptive Networks. https://arxiv.org/abs/2603.19382

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS