Asymptotic Evolution of Acyclic Random Mappings
| Dublin Core | PKP Metadata Items | Metadata for this Document | |
| 1. | Title | Title of document | Asymptotic Evolution of Acyclic Random Mappings |
| 2. | Creator | Author's name, affiliation, country | Steven Neil Evans; University of California at Berkeley |
| 2. | Creator | Author's name, affiliation, country | Tye Lidman; University of California at Berkeley |
| 3. | Subject | Discipline(s) | |
| 3. | Subject | Keyword(s) | random mapping; Dirichlet form; continuum random tree; Brownian bridge; Brownian excursion; path decomposition; excursion theory; Gromov-Hausdorff metric |
| 3. | Subject | Subject classification | 60J25; 60C05; 05C05; 05C80 |
| 4. | Description | Abstract | An acyclic mapping from an $n$ element set into itself is a mapping $\varphi$ such that if $\varphi^k(x) = x$ for some $k$ and $x$, then $\varphi(x) = x$. Equivalently, $\varphi^\ell = \varphi^{\ell+1} = \ldots$ for $\ell$ sufficiently large. We investigate the behavior as $n \rightarrow \infty$ of a sequence 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. Informal calculations indicate that the metric space valued process associated with the Markov chain should, after an appropriate time and ``space'' rescaling, converge as $n \rightarrow \infty$ 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. Although we don't prove such a limit theorem, we use Dirichlet form methods to construct a Markov process that is Hunt with respect to a suitable Gromov-Hausdorff-like metric and evolves according to the dynamics suggested by the heuristic arguments. This process is similar to one that appears in earlier work by Evans and Winter as a similarly informal limit of a Markov chain related to the subtree prune and regraft tree (SPR) rearrangements from phylogenetics. |
| 5. | Publisher | Organizing agency, location | |
| 6. | Contributor | Sponsor(s) | SNE supported in part by NSF grant DMS-0405778; TL supported in part by NSF VIGRE grant DMS-0130526 |
| 7. | Date | (YYYY-MM-DD) | 2007-09-02 |
| 8. | Type | Status & genre | Peer-reviewed Article |
| 8. | Type | Type | |
| 9. | Format | File format | |
| 10. | Identifier | Uniform Resource Identifier | http://ejp.ejpecp.org/article/view/437 |
| 10. | Identifier | Digital Object Identifier | 10.1214/EJP.v12-437 |
| 11. | Source | Journal/conference title; vol., no. (year) | Electronic Journal of Probability; Vol 12 |
| 12. | Language | English=en | |
| 14. | Coverage | Geo-spatial location, chronological period, research sample (gender, age, etc.) | |
| 15. | Rights | Copyright and permissions | The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available. Summary of the Creative Commons Attribution License You are free
|