2,065 research outputs found

    Spectra of random linear combinations of matrices defined via representations and Coxeter generators of the symmetric group

    Full text link
    We consider the asymptotic behavior as nn\to\infty of the spectra of random matrices of the form 1n1k=1n1Znkρn((k,k+1)),\frac{1}{\sqrt{n-1}}\sum_{k=1}^{n-1}Z_{nk}\rho_n ((k,k+1)), where for each nn the random variables ZnkZ_{nk} are i.i.d. standard Gaussian and the matrices ρn((k,k+1))\rho_n((k,k+1)) are obtained by applying an irreducible unitary representation ρn\rho_n of the symmetric group on {1,2,...,n}\{1,2,...,n\} to the transposition (k,k+1)(k,k+1) that interchanges kk and k+1k+1 [thus, ρn((k,k+1))\rho_n((k,k+1)) is both unitary and self-adjoint, with all eigenvalues either +1 or -1]. Irreducible representations of the symmetric group on {1,2,...,n}\{1,2,...,n\} are indexed by partitions λn\lambda_n of nn. A consequence of the results we establish is that if λn,1λn,2...0\lambda_{n,1}\ge\lambda_{n,2}\ge...\ge0 is the partition of nn corresponding to ρn\rho_n, μn,1μn,2>...0\mu_{n,1}\ge\mu_{n,2}\ge >...\ge0 is the corresponding conjugate partition of nn (i.e., the Young diagram of μn\mu_n is the transpose of the Young diagram of λn\lambda_n), limnλn,in=pi\lim_{n\to\infty}\frac{\lambda_{n,i}}{n}=p_i for each i1i\ge1, and limnμn,jn=qj\lim_{n\to\infty}\frac{\mu_{n,j}}{n}=q_j for each j1j\ge1, then the spectral measure of the resulting random matrix converges in distribution to a random probability measure that is Gaussian with random mean θZ\theta Z and variance 1θ21-\theta^2, where θ\theta is the constant ipi2jqj2\sum_ip_i^2-\sum_jq_j^2 and ZZ is a standard Gaussian random variable.Comment: Published in at http://dx.doi.org/10.1214/08-AOP418 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Subtree prune and regraft: a reversible real tree-valued Markov process

    Full text link
    We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and regraft (SPR) Markov chains that appear in phylogenetic analysis. A key technical ingredient in this work is the use of a novel Gromov--Hausdorff type distance to metrize the space whose elements are compact real trees equipped with a probability measure. Also, the investigation of the Dirichlet form hinges on a new path decomposition of the Brownian excursion.Comment: Published at http://dx.doi.org/10.1214/009117906000000034 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org
    corecore