Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 46 min ago
PreprintCC BY-NC-ND 4.0arXiv

Mutual linearity in semi-Markov networks

Abstract

Despite their microscopic complexity, stochastic networks show a surprising degree of universal, parameter-independent properties. One example is mutual linearity, which has recently been characterized as a generic, pairwise-linear relation between observables of Markov processes under local perturbations, valid for both stationary dynamics and for transient dynamics in Laplace space. Here we show that mutual linearity arises if a certain global affine relation is satisfied. This allows us to demonstrate that mutual linearity also holds for a broad class of local perturbations in semi-Markov networks, which, unlike Markov networks, have memory in terms of the dwell time in the current state. However, exceptions exist, meaning that mutual linearity does not extend to all possible perturbations of semi-Markov networks. Strikingly, this restriction disappears for first-passage times. Thus, semi-Markov networks exhibit a fundamental asymmetry between occupation and first-passage statistics, different from Markov networks. Finally, we show that our results are directly applicable to stochastic resetting in semi-Markov networks, where the Laplace-space relations acquire a physical interpretation in terms of stationary occupations and the probability to reach a target before reset. This provides a natural setting in which the predicted affine relations can be probed.

Related

  1. Mutual Linearity of Complexes in Chemical Reaction Networks
    Pedro E. Harunari, Guilherme Fiusa, Matteo Polettini
    arXivPreprintCC BY 4.0Full textPhysical chemistryStatistical & nonlinear physicsarXiv
  2. Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
    Julian Voits
    arXivPreprintCC BY 4.0Full textProbabilityStatistical & nonlinear physicsarXiv
  3. Mutual linearity from classical response theory
    Timur Aslyamov, Massimiliano Esposito
    arXivPreprintCC BY 4.0Full textStatistical & nonlinear physicsarXiv
  4. Optimal design of higher-order interactions for mutual synchronization among three collectively oscillating networks
    Sotaro Kuroiwa, Yuzuru Kato
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  5. Fundamental Bounds on the Oscillation Efficiency of Markov Networks
    Chen Jia
    arXivPreprintarXiv licenceFull textSystems & synthetic biologyStatistical & nonlinear physicsarXiv
BibTeX
@misc{voits2026mutual,
  title = {{Mutual linearity in semi-Markov networks}},
  author = {Julian B. Voits and Ulrich S. Schwarz},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.06490},
  eprint = {2611.06490},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.06490},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Mutual linearity in semi-Markov networks
AU  - Julian B. Voits
AU  - Ulrich S. Schwarz
PY  - 2026
DA  - 2026/11/04
PB  - arXiv
DO  - 10.48550/arxiv.2611.06490
UR  - https://arxiv.org/abs/2611.06490
AB  - Despite their microscopic complexity, stochastic networks show a surprising degree of universal, parameter-independent properties. One example is mutual linearity, which has recently been characterized as a generic, pairwise-linear relation between observables of Markov processes under local perturbations, valid for both stationary dynamics and for transient dynamics in Laplace space. Here we show that mutual linearity arises if a certain global affine relation is satisfied. This allows us to demonstrate that mutual linearity also holds for a broad class of local perturbations in semi-Markov networks, which, unlike Markov networks, have memory in terms of the dwell time in the current state. However, exceptions exist, meaning that mutual linearity does not extend to all possible perturbations of semi-Markov networks. Strikingly, this restriction disappears for first-passage times. Thus, semi-Markov networks exhibit a fundamental asymmetry between occupation and first-passage statistics, different from Markov networks. Finally, we show that our results are directly applicable to stochastic resetting in semi-Markov networks, where the Laplace-space relations acquire a physical interpretation in terms of stationary occupations and the probability to reach a target before reset. This provides a natural setting in which the predicted affine relations can be probed.
ER  -