Asymptotic evolution of acyclic random mappings

DOI10.1214/EJP.V12-437MaRDI QIDQ2462005zbMATHOpenAlexFDO

Authors Steven Neil Evans, Tye Lidman

Publication date 23 November 2007

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0701657

zbMATH Keywords

Brownian bridgeDirichlet formBrownian excursionpath decompositioncontinuum random treeexcursion theoryGromov-Hausdorff metricrandom mapping

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Continuous-time Markov processes on general state spaces (60J25) Combinatorial probability (60C05)

Abstract: An acyclic mapping from an $n$ element set into itself is a mapping $phi$ such that if $ph{i}^k(x)=x$ for some $k$ and $x$, then $phi(x)=x$. Equivalently, $ph{i}^{e}ll=ph{i}^{ell+1}=\mathrm{...}$ for $ell$ sufficiently large. We investigate the behavior as $noinfty$ of a Markov chain on the collection of such mappings. At each step of the chain, a point in the $n$ element set is chosen uniformly at random and the current mapping is modified by replacing the current image of that point by a new one chosen independently and uniformly at random, conditional on the resulting mapping being again acyclic. We can represent an acyclic mapping as a directed graph (such a graph will be a collection of rooted trees) and think of these directed graphs as metric spaces with some extra structure. Heuristic calculations indicate that the metric space valued process associated with the Markov chain should, after an appropriate time and ``space rescaling, converge as $noinfty$ to a real tree ($R$-tree) valued Markov process that is reversible with respect to a measure induced naturally by the standard reflected Brownian bridge. The limit process, which we construct using Dirichlet form methods, is a Hunt process with respect to a suitable Gromov-Hausdorff-like metric. This process is similar to one that appears in earlier work by Evans and Winter as the limit of chains involving the subtree prune and regraft tree (SPR) rearrangements from phylogenetics.

Recommendations

• The Markov chain asymptotics of random mapping graphs
• scientific article; zbMATH DE number 4107819
• Subtree prune and regraft: a reversible real tree-valued Markov process
• scientific article; zbMATH DE number 3956090
• scientific article; zbMATH DE number 3846541

Cited in

(4)

• Tree-valued Fleming-Viot dynamics with mutation and selection
• scientific article; zbMATH DE number 1053531 (Why is no real title available?)
• scientific article; zbMATH DE number 4107819 (Why is no real title available?)
• Tree-valued resampling dynamics martingale problems and applications

This page was built for publication: Asymptotic evolution of acyclic random mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462005)