A phase transition in the random transposition random walk

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A phase transition in the random transposition random walk

Our work is motivated by Bourque and Pevzner’s (2002) simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk on the group of permutations on n elements. Consider this walk in continuous time starting at the identity and let Dt be the minimum number of transpositions needed to go back to...

متن کامل

Cutoff for the Star Transposition Random Walk

In this note, we give a complete proof of the cutoff phenomenon for the star transposition random walk on the symmetric group.

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

Order-disorder phase transition in random-walk networks.

In this paper we study in detail the behavior of random-walk networks (RWN's). These networks are a generalization of the well-known random Boolean networks (RBN's), a classical approach to the study of the genome. RWN's are also discrete networks, but their response is defined by small variations in the state of each gene, thus being a more realistic representation of the genome and a natural ...

متن کامل

A Coupling Argument for the Random Transposition Walk

This paper explores the mixing time of the random transposition walk on the symmetric group Sn. While it has long been known that this walk mixes in O(n log n) time, this result has not previously been attained using coupling. A coupling argument showing the correct order mixing time is presented. This is accomplished by first projecting to conjugacy classes, and then using the Bubley-Dyer path...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2005

ISSN: 0178-8051,1432-2064

DOI: 10.1007/s00440-005-0479-7