Omer Angel - Random Infinite Permutations and the Cyclic Time Random Walk

dmtcs:3342 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) - https://doi.org/10.46298/dmtcs.3342
Random Infinite Permutations and the Cyclic Time Random Walk

Authors: Omer Angel

    The random stirring process is a natural random walk on the set of permutations of the vertex set of a graph. The cyclic time random walk is a self interacting random walk on a graph. It is influenced by its past, in that it is constrained to repeat its past choices if it returns to a previously visited edge after a multiple of some period of time. The two models are fundamentally equivalent to each other as well as to a certain coalescence and fragmentation process.


    Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
    Section: Proceedings
    Published on: January 1, 2003
    Imported on: May 10, 2017
    Keywords: Self interacting random walk,Random permutation,Phase transition,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 161 times.
    This article's PDF has been downloaded 163 times.