Random Structures & Algorithms

Upper triangular matrix walk: Cutoff for finitely many columns

Early View

We consider random walk on the space of all upper triangular matrices with entries in which forms an important example of a nilpotent group. Peres and Sly proved tight bounds on the mixing time of this walk up to constants. It is well known that the column projection of this chain is the one dimensional East process. In this article we complement the Peres‐Sly result by proving a cutoff result for the mixing of finitely many columns in the upper triangular matrix walk at the same location as the East process of the same dimension. The proof is based on a recursive argument which uses a local version of a dual process appearing in a previous study, various combinatorial consequences of mixing and concentration results for the movement of the front in the one dimensional East process.

Related Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.