Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.23065

Synchronization over Resource-Causal Temporal Networks with Consumable Entanglement Links

Ruiwu Niu·Xiaoqun Wu·Guanrong Chen·Michaël Antonie van Wyk
View original source ↗Read source document ↗Export metadata ↓

Abstract

When communication consumes shared entanglement, a physical link does not guarantee that an interaction is available. We study synchronization of classical continuous-time systems whose interactions consume randomly replenished resources stored on edges. Under isotropic tangent coupling and state independent scheduling, the linearized evolution separates exactly into intrinsic node growth and an ordered product of communication matrices. This yields temporal contraction conditions and local nonlinear synchronization. Resource conservation bounds the contraction achievable by every schedule with acyclic event services. On a fixed acyclic orientation with a unique source, serving each ready edge immediately is optimal: the non-source node with the least total incoming supply determines the rate. Balanced incoming supplies attain the bound. For linear coupling on these orientations, a further condition guarantees synchronization throughout a convex invariant domain. In the specified Lorenz domain, this sufficient contraction requirement is about three percent above a necessary requirement for uniform exponential synchronization. Kuramoto simulations illustrate the effect of service direction, while Lorenz simulations compare resource policies and test local growth predictions against finite-time dynamics.

Explore related subjects

nlin.CD

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruiwu Niu, Xiaoqun Wu, Guanrong Chen, Michaël Antonie van Wyk. 2026-10-16. Synchronization over Resource-Causal Temporal Networks with Consumable Entanglement Links. https://arxiv.org/abs/2610.23065

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

KEEP EXPLORING

Related papers

arXiv2026

Statistical Characterization of Erratic and Chaotic Processes through Their Extrema I. Thermodynamics

We propose a general statistical framework for characterizing erratic functions through the statistics of their extrema, with the aim of identifying statistical signatures associated with chaotic processes. It is based on analyzing the extrema points of erratic functions associated with these processes. One is instructed to determine the probability distribution functions ( PDF)s of the locations of the extrema points, the spacings between the locations, in particular the nearest neighbors, and the ratios between adjacent spacings. We then fit these PDFs with PDFs known to relate to chaotic behavior like of random matrix theory. The extrema considered establish a cloud of points in general in $D$ dimensions for erratic function of several variables. For certain systems one finds also extrema curves. We further determine the ``thermodynamic" description of the erratic functions by computing the Shannon or differential entropy and by equating the PDFs to the Gibbs one. With this map we determine the ``energy function" and for certain cases also the ``temperature". We analyze three benchmark spacing PDFs: the Bernoulli shift map, the Poisson and the Gaussian beta ensemble and several others. We want to emphasize that the map to thermodynamics can be applied to variety of chaotic processes including non-physics ones. We distinguish marginal spacing distributions from joint distributions of consecutive spacings. The latter probe correlations and statistical organization that are invisible in one-spacing PDFs and may provide stronger signatures for distinguishing structured chaotic-like behavior from uncorrelated irregularity.

nlin.CD↗
arXiv2026

A general feedback mechanism unifying stochasticity, long transients, and resilience

Stochasticity in complex systems is commonly treated either as external noise added to deterministic dynamics or as an effective stochastic description of deterministic chaos. A framework in which stochastic dynamics arise endogenously from deterministic chaos and subsequently feed back on the deterministic dynamics, thereby fundamentally reshaping system dynamics, remains rare. Here, we develop such a framework. Through the interaction between deterministic and stochastic dynamics, alternative stable states, critical transitions, adaptive capacity, stochasticity, and resilience become dynamically interconnected within a single model. Furthermore, the framework establishes a new mechanism of long transients, driven by two key factors: (i) time-scale separation and (ii) time-delay-induced cancellation. Stochasticity plays a dual stabilizing-destabilizing role in long transients: it promotes their persistence while also facilitating their eventual escape and collapse. This dual role allows resilience to be quantified dynamically through escape and stochastic recapture dynamics. Finally, we establish the generality of the mechanism mathematically and numerically across a broad class of one-dimensional nonlinear systems, suggesting that it reflects a general dynamical principle.

nlin.CD↗
arXiv2026

Ordinal-pattern transition networks as a symbolic substrate for reservoir computing

Reservoir computing has established itself as a computationally efficient alternative to fully trained recurrent neural networks using a fixed high-dimensional nonlinear substrate to map temporal input into a feature space for a simple readout. Here, we argue that reservoir computing can be realized entirely within a coarse-grained, symbolic state space, and that constrained random walks on ordinal-pattern transition networks provide a natural instance of this realization, replacing the reservoir's continuous state space with a discrete and directly data-derived one. We develop a formal correspondence between the two frameworks, show that the echo-state property has a natural discrete analog in the ergodicity and spectral gap of the walk's underlying Markov chain, and illustrate the correspondence with a minimal example and an empirical one-step-ahead prediction task evaluated across five paradigmatic model systems. These systems exhibit dynamics that correspond to strictly periodic, quasiperiodic, chaotic, or stochastic signals. We argue that this symbolic reservoir perspective allows a redefinition of the reservoir substrate itself, replacing the requirement of a continuous, randomly generated dynamical system with any sufficiently ergodic, data-derived symbolic process. This opens a route toward interpretable, data-adaptive reservoirs whose internal structure is inferred rather than randomly assigned, with implications for surrogate-data methods and reservoir design more broadly.

nlin.CD↗