Functions of random walks on hyperplane arrangements
From MaRDI portal
Publication:990770
Abstract: Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only selected features of the chains are of interest, then the mixing times may change. We study the behavior of hyperplane walks, viewed on a subarrangement of a hyperplane arrangement. These include many new examples, for instance a random walk on the set of acyclic orientations of a graph. All such walks can be treated in a uniform fashion, yielding diagonalizable matrices with known eigenvalues, stationary distribution and good rates of convergence to stationarity.
Recommendations
- Random walks and hyperplane arrangements
- Random Walks and Plane Arrangements in Three Dimensions
- Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
Cites work
- scientific article; zbMATH DE number 3812655 (Why is no real title available?)
- scientific article; zbMATH DE number 3727273 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1981749 (Why is no real title available?)
- scientific article; zbMATH DE number 2070260 (Why is no real title available?)
- scientific article; zbMATH DE number 953298 (Why is no real title available?)
- scientific article; zbMATH DE number 795110 (Why is no real title available?)
- A Hodge decomposition interpretation for the coefficients of the chromatic polynomial
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- A general commutative descent algebra
- A rule of thumb for riffle shuffling
- Acyclic orientations of graphs
- Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
- Algebras associated to acyclic directed graphs
- An introduction to hyperplane arrangements
- Analysis of Top To Random Shuffles
- Buildings of spherical type and finite BN-pairs
- Carries, shuffling, and symmetric functions
- Characteristic polynomials of subspace arrangements and finite fields
- Convergence of some time inhomogeneous Markov chains via spectral techniques
- Coxeter groups and Hopf algebras.
- Deformations of Coxeter hyperplane arrangements
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Finite Continuous Time Markov Chains
- From association to causation via regression
- Hyperplane arrangements, interval orders, and trees.
- Limiting search cost distribution for the move-to-front rule with random request probabilities
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Markov functions
- Möbius functions and semigroup representation theory.
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- On the matrix occurring in a linear search problem
- Oriented Matroids
- Random walks and hyperplane arrangements
- Semigroups, rings, and Markov chains
- Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
- The coloring ideal and coloring complex of a graph
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Trailing the dovetail shuffle to its lair
Cited in
(24)- Mixing time bounds for edge flipping on regular graphs
- Character theory of monoids over an arbitrary field.
- Edge flipping in the complete graph
- Combinatorial topology and the global dimension of algebras arising in combinatorics
- The full spectrum of random walks on complete finite \(d\)-ary trees
- Generating a random signed permutation with random reversals
- Edge flipping in graphs
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Markov Chains for Promotion Operators
- scientific article; zbMATH DE number 2127717 (Why is no real title available?)
- Eigenvectors for a random walk on a left-regular band
- Random walks on rings and modules
- Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
- Face monoid actions and tropical hyperplane arrangements
- Combinatorial Markov chains on linear extensions
- Quivers of monoids with basic algebras.
- Mixing time for Markov chain on linear extensions
- Upper Bounds on Mixing Time of Finite Markov Chains
- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
- Lumpings of algebraic Markov chains arise from subquotients
- A rule of thumb for riffle shuffling
- Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- Hopf algebras and Markov chains: two examples and a theory
This page was built for publication: Functions of random walks on hyperplane arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990770)
