Skip to content
DraconiticResearch
Search Sources API
197,785 studies31 sourcesUpdated 26 min ago
PreprintCC BY 4.0arXiv

Age-targeted failure in evolving networks with addition and deletion of vertices

  • Peter Mann
  • Simon Dobson
Open at sourcePDFDOICite

Abstract

We present a message passing formalism to study the age-targeted robustness of networks that have evolved under the addition and deletion of vertices. We show that in the growing regime removing the oldest vertices fragments the network far sooner than random failure, while the oldest core is far more robust under targeted removal of the young. At a balanced turnover of vertices the attack value vanishes identically and we prove that the giant component is invariant under arbitrary age-targeting.

Related

  1. Exact solutions for models of evolving clustered networks with addition and deletion via age-resolved message passing
    Peter Mann, Lei Fang, Simon Dobson
    arXivPreprintCC BY 4.0Full textStatistical & nonlinear physicsarXiv
  2. Discrete Diffusion Models via Evolving Variational Autoregressive Networks
    Kewen Pan, Ying Tang
    arXivPreprintCC BY 4.0Full textStatisticsCondensed matterarXiv
  3. Self-Shielded Multigroup Microscopic Cross Section Generation Using Targeted Artificial Neural Networks
    Joshua Nichols, Andrew Osborne, Ben Whewell +1
    arXivPreprintCC BY 4.0Full textComputational physicsarXiv
  4. Earth-scale searches for displaced vertices: KM3NeT meets the LHC
    Ui Min, Wen Yin
    arXivPreprintCC0Full textHigh-energy & particle physicsarXiv
  5. Probing νSMEFT at Belle II with displaced dilepton vertices
    Patrick D. Bolton, Fabian Esser, Lukáš Gráf +3
    arXivPreprintarXiv licenceFull textHigh-energy & particle physicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{mann2026agetargeted,
  title = {{Age-targeted failure in evolving networks with addition and deletion of vertices}},
  author = {Peter Mann and Simon Dobson},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.18981},
  eprint = {2609.18981},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.18981},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Age-targeted failure in evolving networks with addition and deletion of vertices
AU  - Peter Mann
AU  - Simon Dobson
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.18981
UR  - https://arxiv.org/abs/2609.18981
AB  - We present a message passing formalism to study the age-targeted robustness of networks that have evolved under the addition and deletion of vertices. We show that in the growing regime removing the oldest vertices fragments the network far sooner than random failure, while the oldest core is far more robust under targeted removal of the young. At a balanced turnover of vertices the attack value vanishes identically and we prove that the giant component is invariant under arbitrary age-targeting.
ER  -