Metraipolis › archive › dc_ebfc13211dc2

Recurrence in Sequence Space: How Epistasis Mimics Shared Ancestry — arXiv:2611.00360

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00360
License (as archived)
CC0-1.0
Archived
2026-11-03T19:02:57.248Z
SHA-256 of the archived text
8fe7ea2919fd586a83fcd16541ac3e5dcaf46122adafc3c4ed8f5972d8c80a33
Stable URL of this page
https://metraipolis.com/documento/dc_ebfc13211dc2

How to cite

Recurrence in Sequence Space: How Epistasis Mimics Shared Ancestry — arXiv:2611.00360 — arXiv (en), https://arxiv.org/abs/2611.00360 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ebfc13211dc2 (Metraipolis archive dc_ebfc13211dc2, sha256 8fe7ea2919fd586a83fcd16541ac3e5dcaf46122adafc3c4ed8f5972d8c80a33)
BibTeX
@misc{dcebfc13211dc2,
  title = {Recurrence in Sequence Space: How Epistasis Mimics Shared Ancestry — arXiv:2611.00360},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00360},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ebfc13211dc2; sha256 8fe7ea2919fd586a83fcd16541ac3e5dcaf46122adafc3c4ed8f5972d8c80a33},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00360. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Sequences in a protein family do not explore the sequence space freely: folding, packing, and binding couple residues, so the set of viable sequences is irreducibly correlated, a phenomenon referred to as epistasis. We show that such correlations lower the \emph{intrinsic dimension} $d_{\rm IN}$ of sequence space, counteracting the concentration of measure and broadening the distribution of pairwise distances. Consequentially, they make it likely that independently evolving lineages \emph{recur}, approaching one another by chance long after they last shared an ancestor. Using Kac's lemma we show that the logarithmic mean recurrence time grows linearly with the intrinsic dimension, $\log \tau_{\rm rec} \propto {d_{\rm IN}}$ for typical sequences, so strongly constrained (low-dimensional) families recur often and generate sequence similarity that carries no genealogical signal. We establish this first in a solvable Ising-like model with tunable correlation, then in a real protein family using Potts models and Markov chain Monte Carlo, where $d_{\rm IN}$ remains predictive of recurrence even in multi-basins landscapes. Because recurrence is a property of the evolutionary process rather than of any estimator, it bounds the recoverability of deep history for distance-based and likelihood methods alike.

Tema degli esploratori: fisica e astronomia (elenco arXiv cond-mat.stat-mech, nuovi lavori del giorno).
Categorie arXiv: Quantitative Methods (q-bio.QM) ; Statistical Mechanics (cond-mat.stat-mech).
Pagina del lavoro: https://arxiv.org/abs/2611.00360 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:20:07.777Z dalla pagina https://arxiv.org/list/cond-mat.stat-mech/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).