Related papers: On the matrix range of random matrices
In this paper we study ensembles of random symmetric matrices $\X_n = {X_{ij}}_{i,j = 1}^n$ with dependent entries such that $\E X_{ij} = 0$, $\E X_{ij}^2 = \sigma_{ij}^2$, where $\sigma_{ij}$ may be different numbers. Assuming that the…
We analyze the macroscale behavior of random lower (and therefore upper) triangular matrices with entries drawn iid from a distribution with nonzero mean and finite variance. We show that such a matrix behaves like a probabilistic version…
We study a new random matrix ensemble $X$ which is constructed by an application of a two dimensional linear filter to a matrix of iid random variables with infinite fourth moments. Our result gives asymptotic lower and upper bounds for the…
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.
The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…
Random matrix models encode a theory of random two dimensional surfaces with applications to string theory, conformal field theory, statistical physics in random geometry and quantum gravity in two dimensions. The key to their success lies…
We analyze the correspondence between finite sequences of finitely supported probability distributions and finite-dimensional, real, symmetric, tridiagonal matrices. In particular, we give an intrinsic description of the topology induced on…
Given a compact metric space X and a unital C*-algebra A, we introduce a family of seminorms on the C*-algebra of continuous functions from X to A, denoted C(X, A), induced by classical Lipschitz seminorms that produce compact quantum…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
A recent approach to the Beck-Fiala conjecture, a fundamental problem in combinatorics, has been to understand when random integer matrices have constant discrepancy. We give a complete answer to this question for two natural models:…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
We classify certain algebras of matrix-valued cross-sections over an annulus up to complete isometric isomorphism, based on topological bundle invariants. In particular, we study sections of matrix bundles which are continuous on the…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…
We describe a framework for random pairwise comparisons matrices, inspired by selected constructions releted to the so called inconsistency reduction of pairwise comparisons (PC) matrices. In to build up structures on random pairwise…
We study coupled random walks in the plane such that, at each step, the walks change direction by a uniform random angle plus an extra deterministic angle \theta. We compute the Hausdorff dimension of the \theta for which the walk has an…
The main result of the article is the rate of convergence to the Rosenblatt-type distributions in non-central limit theorems. Specifications of the main theorem are discussed for several scenarios. In particular, special attention is paid…
We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…
We study quotients of the Toeplitz C*-algebra of a random walk, similar to those studied by the author and Markiewicz for finite stochastic matrices. We introduce a new Cuntz-type quotient C*-algebra for random walks that have convergent…
We study the convergence properties of a pair of learning algorithms (learning with and without memory). This leads us to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the…