1 citations · 1 across the 2 of their papers we have counts for
5 papers
Spectrum of complex networks
Daniel Montealegre, Van Vu
The study of complex networks has been one of the most active fields in science in recent decades. Spectral properties of networks (or graphs that represent them) are of fundamenta…
Union of Random Trees and Applications
Austen James, Matthew Larson, Daniel Montealegre +1
In 1986, Janson showed that the number of edges in the union of random spanning trees in the complete graph is a shifted Poisson distribution. Using results from the theo…
Packing Loose Hamilton Cycles
Asaf Ferber, Kyle Luh, Daniel Montealegre +1
A subset of edges in a -uniform hypergraph is a \emph{loose Hamilton cycle} if covers all the vertices of and there exists a cyclic ordering of these vertices su…
Law of Iterated Logarithm for random graphs
Asaf Ferber, Daniel Montealegre, Van Vu
A milestone in Probability Theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random var…
Random matrices: Law of the iterated logarithm
Asaf Ferber, Daniel Montealegre, Van Vu
The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiti…