Metraipolis › archive › dc_800de67d840c

Recombination in discrete and continuous time from the viewpoint of Markov embedding — arXiv:2609.04849

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04849
License (as archived)
CC0-1.0
Archived
2026-10-16T23:16:02.714Z
SHA-256 of the archived text
f26e933483e6a2d772951cad9171725b8117c11390a094e16416ae2aa5699b8c
Stable URL of this page
https://metraipolis.com/documento/dc_800de67d840c

How to cite

Recombination in discrete and continuous time from the viewpoint of Markov embedding — arXiv:2609.04849 — arXiv (en), https://arxiv.org/abs/2609.04849 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_800de67d840c (Metraipolis archive dc_800de67d840c, sha256 f26e933483e6a2d772951cad9171725b8117c11390a094e16416ae2aa5699b8c)
BibTeX
@misc{dc800de67d840c,
  title = {Recombination in discrete and continuous time from the viewpoint of Markov embedding — arXiv:2609.04849},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04849},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_800de67d840c; sha256 f26e933483e6a2d772951cad9171725b8117c11390a094e16416ae2aa5699b8c},
  year = {2026}
}

Archived text

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

The classic recombination equation, both in discrete and in continuous time, can be solved in a way that derives from the Markov chain of a partitioning process. Here, we revisit this structure from the point of view of the Markov embedding problem. In particular, we analyse when a discrete-time Markov matrix of recombination type can occur in a time-homogeneous Markov semigroup that is generated by a recombination rate matrix. En route, we also show that such rate matrices (or Markov generators) generally do not form a matrix algebra, but span a real Lie algebra.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.04849 — 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-10-16T23:02:42.106Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).