How to pick a random integer matrix? (and other questions)
From MaRDI portal
Abstract: We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.
Recommendations
Cites work
- A Note on the Generation of Random Normal Deviates
- Asymptotics for pseudo-Anosov elements in Teichmüller lattices
- Counting modular matrices with specified Euclidean norm
- Density of integer points on affine homogeneous varieties
- Expander graphs and their applications
- Factoring polynomials with rational coefficients
- Finite simple groups of Lie type as expanders.
- Gauss' algorithm revisited
- Geometry and Topology for Mesh Generation
- Groups of Lie type as products of \(\text{SL}_2\) subgroups.
- scientific article; zbMATH DE number 5763317 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- Lie groups beyond an introduction
- Low-dimensional lattice basis reduction revisited
- Manin’s and Peyre’s conjectures on rational points and adelic mixing
- Mixing, counting, and equidistribution in Lie groups
- Random walks on the mapping class group
- Representation theory of semisimple groups. An overview based on examples. With a new preface by the author.
- Splitting fields of elements in arithmetic groups
- Symmetric groups and expander graphs.
- Symplectic Geometry
- Symplectic Lattice Reduction and NTRU
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)
- Universal lattices and unbounded rank expanders.
- Walks on graphs and lattices – effective bounds and applications
- Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
Cited in
(13)- Factorization, invariant measure, and random selection of matrices in SU(n) and other groups
- Random selection from trace-biased invariant distributions of SU(3) matrices
- Models of random knots
- Volumes for \(\text{SL}_N(\mathbb{R})\), the Selberg integral and random lattices
- Volumes and distributions for random unimodular complex and quaternion lattices
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- Random trigonometric polynomials: universality and non-universality of the variance for the number of real roots
- Linear groups and computation
- Testing of random matrices
- Universal knot diagrams
- Distribution of coefficients of rank polynomials for random sparse graphs
- Size of discriminants of periodic geodesics on the modular surface
- Randomness and complexity in matrix groups
This page was built for publication: How to pick a random integer matrix? (and other questions)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2792341)