Tobias Johnson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tobias Johnson has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Ioana Dumitriu
Mathematics University of Washington
3 shared publications - Elliot Paquette
Department of Mathematics and Statistics McGill University
2 shared publications - Soumik Pal
Indian Institute of Technology Guwahati 1 Stem Cell and Cancer Biology Group, Department of Biosciences and Bioengineering Guwahati, India
2 shared publications
Latest Publications
- Open Access
The Marčenko-Pastur law for sparse random bipartite biregular graphs
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 AccessThe Marčenko-Pastur law for sparse random bipartite biregular graphs
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).
- 25 August 2012
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 156 (3-4) , 921-975
Functional limit theorems for random regular graphs
- 25 August 2012
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 156 (3-4) , 921-975
Functional limit theorems for random regular graphs
- Open Access
Functional limit theorems for random regular graphs
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 AccessFunctional limit theorems for random regular graphs
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.