Related papers: Random symmetric matrices: rank distribution and i…

We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

Let $X_1,\ldots,X_n$ be independent identically distributed random vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…

Let p be an odd prime, and A_n the alternating group of degree n. We determine which ordinary irreducible representations of A_n remain irreducible in characteristic p, verifying the author's conjecture from [Represent. Theory 14, 601-626].…

Orthogonally invariant functions of symmetric matrices often inherit properties from their diagonal restrictions: von Neumann's theorem on matrix norms is an early example. We discuss the example of "identifiability", a common property of…

Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…

Let $M$ be a matroid on a finite ground set $E$, and suppose that the automorphism group of $M$ acts transitively on $E$. We show the following: if $X_1,\ldots,X_K$ are sampled independently from a distribution $p$ on $E$, then the…

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

We introduce random matrix ensembles that correspond to the infinite families of irreducible Riemannian symmetric spaces of type I. In particular, we recover the Circular Orthogonal and Symplectic Ensembles of Dyson, and find other families…

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…

We completely characterize $\Delta$- and local subexponentialities of positive-half compound Poisson distributions and extend the characterization on two-sided distributions. Moreover, $\Delta$-subexponentiality of infinitely divisible…

We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that the dimension of the…

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

Correlation functions for matrix ensembles with orthogonal and unitarysymplectic rotation symmetry are more complicated to calculate than in the unitary case. The supersymmetry method and the orthogonal polynomials are two techniques to…

We solve a supersymmetric matrix model with a general potential. While matrix models usually describe surfaces, supersymmetry enforces a cancellation of bosonic and fermionic loops and only diagrams corresponding to so-called branched…

In this article the statistical properties of symmetrical random matrices whose elements are drawn from a q-parametrized non-extensive statistics power-law distribution are investigated. In the limit as q->1 the well known Gaussian…