Mixing time for a random walk on rooted trees (Q2380305): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Import IPFS CIDs |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0908.1141 / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreibetiysacw7asuvdtp43ssq5iptc72jfrs6h4zfpxs2kcqxdkd5va / rank | |||
Normal rank | |||
Latest revision as of 10:36, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mixing time for a random walk on rooted trees |
scientific article |
Statements
Mixing time for a random walk on rooted trees (English)
0 references
26 March 2010
0 references
Summary: We define an analog of Plancherel measure for the set of rooted unlabeled trees on \(n\) vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order \(n^2\) steps are necessary and suffice for convergence to the stationary distribution.
0 references
