Publication date
March 2016
DOIAbstract
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
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
AbstractNonstatistical notions of uniformity suitable for small samples are proposed and studied. Ne...
AbstractGiven an m×n matrix A and a positive integer k, we describe a randomized procedure for the a...
In the development of information processing algorithms that insist on matrix-manifold-type paramete...
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from g...
Abstract. We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at ran...
We present a "practical" algorithm to construct random elements of a finite group. We ana...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
Binary matrices not containing a smaller matrix as a submatrix have become an interesting topic rece...
This book presents a unified theory of random matrices for applications in machine learning, offerin...
Abstract: "We discuss the application of random walks to generating a random basis of a totally unim...
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
Random dendrograms, Random matrices, Uniform sampling, Tree algorithm, Monte Carlo studies, Clusteri...
The purpose of this text is to provide an accessible introduction to a set of recently developed alg...
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed accord...
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed accord...
AbstractNonstatistical notions of uniformity suitable for small samples are proposed and studied. Ne...
AbstractGiven an m×n matrix A and a positive integer k, we describe a randomized procedure for the a...
In the development of information processing algorithms that insist on matrix-manifold-type paramete...
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from g...
Abstract. We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at ran...
We present a "practical" algorithm to construct random elements of a finite group. We ana...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
Binary matrices not containing a smaller matrix as a submatrix have become an interesting topic rece...
This book presents a unified theory of random matrices for applications in machine learning, offerin...
Abstract: "We discuss the application of random walks to generating a random basis of a totally unim...
AbstractWe consider the application of the Schreier-Sims algorithm and its variations to matrix grou...
Random dendrograms, Random matrices, Uniform sampling, Tree algorithm, Monte Carlo studies, Clusteri...
The purpose of this text is to provide an accessible introduction to a set of recently developed alg...
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed accord...
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed accord...
AbstractNonstatistical notions of uniformity suitable for small samples are proposed and studied. Ne...
AbstractGiven an m×n matrix A and a positive integer k, we describe a randomized procedure for the a...
In the development of information processing algorithms that insist on matrix-manifold-type paramete...
Add to ORKG