This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110899 Number of different stationary distributions of a certain random walk whose states are permutations of 1,...,n. The transitions depend on two sorted vectors x and z. The state sigma goes to rank((z[sigma]-x)[rperm] +x), where rperm is a random (uniform) permutation. If x and z are realizations of independent random variables X and Z and pi is a permutation drawn from the stationary distribution, the vector z[pi]-x is a realization of a random variable Y where Z ~ X+Y. 0
0, 1, 2, 208 (list; graph; refs; listen; history; text; internal format)



Table of n, a(n) for n=0..3.

C. L. Mallows, Deconvolution by simulation, arXiv:0708.1051 [stat.CO].

C. L. Mallows, Deconvolution by simulation


If n=2, the transition matrix is one of (0.5, 0.5), (1, 0.5), (0.5, 0.5), or (0, 0.5). The stationary distributions are (0.5, 0.5) and (1, 0).


Sequence in context: A209185 A216608 A238819 * A220940 A012600 A157479

Adjacent sequences:  A110896 A110897 A110898 * A110900 A110901 A110902




Colin Mallows, Sep 20 2005



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 25 18:43 EST 2015. Contains 264418 sequences.