Random Walks and Plane Arrangements in Three Dimensions

From MaRDI portal





Consider a finite family of planes in \(\mathbb R^3\) through the origin, such that their intersection is \(\{0\}\). The planes divide the unit sphere into regions. Given a region \(C\) and a vertex \(v\), there is a unique region \(C'\) (called the projection of \(C\) on \(v\) and denoted \(vC\)) adjacent to \(v\) that is separated from \(C\) by the minimum number of great circles. One can define a random walk on the set of regions by choosing a vertex at random with equal probability and moving, when starting from region \(C\), to the projection \(vC\). In an earlier work by \textit{P. Bidigare, P. Hanlon} and \textit{D. Rockmore} [Duke Math. J. 99, No. 1, 135-174 (1999; Zbl 0955.60043)] all eigenvalues and their multiplicities of the transition matrix have been identified in terms of the numbers of vertices, edges and regions. The main object of study of the present paper is the stationary distribution \(\pi\) of the random walk under interest. In particular, a surprising formula is proved: if \(C\) is a region with \(i\) sides, then \(\pi(C)=(i-2)/2(f_0-2)\), where \(f_0\) is the number of vertices. The authors are likewise surprised and cannot offer any intuitive explanation. Furthermore, some earlier results on hyperplane arrangements are reviewed, with special emphasis on the three-dimensional case. Interesting connections to card shuffling and random tiling models are discussed. The text is written in a rather accessible way. No familiarity with probability theory is assumed.











This page was built for publication: Random Walks and Plane Arrangements in Three Dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757381)