login
This site is supported by donations to The OEIS Foundation.

 

Logo

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

Hints
(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)
OFFSET

0,3

LINKS

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

EXAMPLE

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).

CROSSREFS

Sequence in context: A209185 A216608 A238819 * A220940 A012600 A157479

Adjacent sequences:  A110896 A110897 A110898 * A110900 A110901 A110902

KEYWORD

hard,nonn,more

AUTHOR

Colin Mallows, Sep 20 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 03:18 EST 2016. Contains 278772 sequences.