Functions of random walks on hyperplane arrangements

DOI10.1016/j.aam.2010.02.001zbMath1239.60071arXiv0912.1686OpenAlexW2004035289MaRDI QIDQ990770

Persi Diaconis, Christos A. Athanasiadis

Publication date: 1 September 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.1686

zbMATH Keywords

eigenvaluesrandom walkacyclic orientationhyperplane arrangementmixing rateTsetlin librarydescent setinverse shufflessubarrangement

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (19)

Quivers of monoids with basic algebras ⋮ Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry ⋮ Mixing time for Markov chain on linear extensions ⋮ Mixing time bounds for edge flipping on regular graphs ⋮ Markov Chains for Promotion Operators ⋮ Face monoid actions and tropical hyperplane arrangements ⋮ Combinatorial topology and the global dimension of algebras arising in combinatorics ⋮ Edge flipping in graphs ⋮ Hopf algebras and Markov chains: two examples and a theory ⋮ Edge flipping in the complete graph ⋮ Random walks on rings and modules ⋮ Combinatorial Markov chains on linear extensions ⋮ A rule of thumb for riffle shuffling ⋮ The full spectrum of random walks on complete finite \(d\)-ary trees ⋮ Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement ⋮ Markov chains, ${\mathscr R}$-trivial monoids and representation theory ⋮ Lumpings of algebraic Markov chains arise from subquotients ⋮ Character theory of monoids over an arbitrary field.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rule of thumb for riffle shuffling
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• From association to causation via regression
• Carries, shuffling, and symmetric functions
• Trailing the dovetail shuffle to its lair
• Buildings of spherical type and finite BN-pairs
• Random walks and hyperplane arrangements
• Deformations of Coxeter hyperplane arrangements
• Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
• Semigroups, rings, and Markov chains
• The size distribution for Markov equivalence classes of acyclic digraph models.
• A general commutative descent algebra
• Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Convergence of some time inhomogeneous Markov chains via spectral techniques
• Algebras associated to acyclic directed graphs
• Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
• Limiting search cost distribution for the move-to-front rule with random request probabilities
• Coxeter groups and Hopf algebras.
• Möbius functions and semigroup representation theory.
• Acyclic orientations of graphs
• Characteristic polynomials of subspace arrangements and finite fields
• On the matrix occurring in a linear search problem
• A Hodge decomposition interpretation for the coefficients of the chromatic polynomial
• Finite Continuous Time Markov Chains
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Analysis of Top To Random Shuffles
• Oriented Matroids
• Hyperplane arrangements, interval orders, and trees.
• Markov functions
• The coloring ideal and coloring complex of a graph

This page was built for publication: Functions of random walks on hyperplane arrangements