IDIoana Dumitriu

Ioana Dumitriu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ioana Dumitriu has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Spectra of Overlapping Wishart Matrices and the Gaussian Free Field

    by Ioana Dumitriu, Elliot Paquette

    Consider a doubly-infinite array of iid centered variables with moment conditions, from which one can extract a finite number of rectangular, overlapping submatrices, and form the corresponding Wishart matrices. We show that under basic smoothness assumptions, centered linear eigenstatistics of such matrices converge jointly to a Gaussian vector with an interesting covariance structure. This structure, which is similar to those appearing in work of Borodin, Borodin and Gorin, and Johnson and Pal can be described in terms of the height function, and leads to a connection with the Gaussian Free Field on the upper half-plane. Finally, we generalize our results from univariate polynomials to a special class of planar functions.

  • Open Access

    Recovery and Rigidity in a Regular Stochastic Block Model

    by Gerandy Brito, Ioana Dumitriu, Shirshendu Ganguly, Christopher Hoffman, Linh V. Tran

    The stochastic block model is a natural model for studying community detection in random networks. Its clustering properties have been extensively studied in the statistics, physics and computer science literature. Recently this area has experienced major mathematical breakthroughs, particularly for the binary (two-community) version, see Mossel, Neeman, Sly (2012, 2013) and Massoulie (2013). In this paper, we introduce a variant of the binary model which we call the regular stochastic block model (RSBM). We prove rigidity by showing that with high probability an exact recovery of the community structure is possible. Spectral methods exhibit a regime where this can be done efficiently. Moreover we also prove that, in this setting, any suitably good partial recovery can be bootstrapped to obtain a full recovery of the communities.

  • Open Access

    The Marčenko-Pastur law for sparse random bipartite biregular graphs

    by Ioana Dumitriu, Tobias Johnson

    We prove that the empirical spectral distribution of a (d_L, d_R)-biregular, bipartite random graph, under certain conditions, converges to a symmetrization of the Mar\v{c}enko-Pastur distribution of random matrix theory. This convergence is not only global (on fixed-length intervals) but also local (on intervals of increasingly smaller length). Our method parallels the one used previously by Dumitriu and Pal (2012).

  • Open Access

    Global Fluctuations for Linear Statistics of β-Jacobi Ensembles

    by Ioana Dumitriu, Elliot Paquette

    We study the global fluctuations for linear statistics of the form $\sum_{i=1}^n f(\lambda_i)$ as $n \rightarrow \infty$, for $C^1$ functions $f$, and $\lambda_1, ..., \lambda_n$ being the eigenvalues of a (general) $\beta$-Jacobi ensemble, for which tridiagonal models were given by Killip and Nenciu as well as Edelman and Sutton. The fluctuation from the mean ($\sum_{i=1}^n f(\lambda_i) - \Exp \sum_{i=1}^n f(\lambda_i)$) is given asymptotically by a Gaussian process. We compute the covariance matrix for the process and show that it is diagonalized by a shifted Chebyshev polynomial basis; in addition, we analyze the deviation from the predicted mean for polynomial test functions, and we obtain a law of large numbers.

  • Functional limit theorems for random regular graphs

    by Ioana Dumitriu, Tobias Johnson, Soumik Pal, Elliot Paquette


  • Open Access

    Functional limit theorems for random regular graphs

    by Ioana Dumitriu, Tobias Johnson, Soumik Pal, Elliot Paquette

    Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We consider limit theorems for various combinatorial and analytical properties of this graph (or the matrix) as n grows to infinity, either when d is kept fixed or grows slowly with n. In a suitable weak convergence framework, we prove that the (finite but growing in length) sequences of the number of short cycles and of cyclically non-backtracking walks converge to distributional limits. We estimate the total variation distance from the limit using Stein's method. As an application of these results we derive limits of linear functionals of the eigenvalues of the adjacency matrix. A key step in this latter derivation is an extension of the Kahn-Szemer\'edi argument for estimating the second largest eigenvalue for all values of d and n.

  • Open Access

    Smallest eigenvalue distributions for two classes of $β$-Jacobi ensembles

    by Ioana Dumitriu

    We compute the exact and limiting smallest eigenvalue distributions for two classes of $\beta$-Jacobi ensembles not covered by previous studies. In the general $\beta$ case, these distributions are given by multivariate hypergeometric ${}_2F_{1}^{2/\beta}$ functions, whose behavior can be analyzed asymptotically for special values of $\beta$ which include $\beta \in 2\mathbb{N}_{+}$ as well as for $\beta = 1$. Interest in these objects stems from their connections (in the $\beta = 1,2$ cases) to principal submatrices of Haar-distributed (orthogonal, unitary) matrices appearing in randomized, communication-optimal, fast, and stable algorithms for eigenvalue computations \cite{DDH07}, \cite{BDD10}.