47 citations · 297 across the 23 of their papers we have counts for
Showing 2013 · math.PRShow all
2 papers · 2 filters
math.PR2013★ 1 cited
Quantitative Small Subgraph Conditioning
Tobias Johnson, Elliot Paquette
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for ra…
math.PR2013★ 5 cited
The Marčenko-Pastur law for sparse random bipartite biregular graphs
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čenko-Pastur…