2026-09-19T07:10:52Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1240752026-06-17T14:45:09Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Jonathan A. Kelner and Ronitt Rubinfeld.
Peebles, John Lee Thompson,Jr.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2020-03-09T18:52:25Z
2020-03-09T18:52:25Z
2019
2019
https://hdl.handle.net/1721.1/124075
1142190523
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 331-345).
In this thesis, we study several algorithmic problems involving numerical linear algebra, probability, and statistics. Its main results include the following: -- We give the first nearly linear time algorithms for a large class of directed graph problems including computing the stationary distribution of a Markov chain with only a logarithmic dependence on the mixing time. Our approach is based on developing new spectral tools for directed graphs, including the first algorithms for sparsifying directed graphs and solving directed Laplacian linear systems. -- Symmetric diagonally dominant matrices frequently arise in science and engineering applications, often when one is discretization certain types of differential equations. We give faster algorithms for estimating the determinant of a symmetric diagonally dominant matrix and for sampling random spanning trees from a graph. --
Generative adversarial networks (GANs) are an important technique used in deep learning. However, the methods for training them are not satisfactorily understood from a theoretical perspective. To help improve this understanding, we devise a parametric problem which is sophisticated enough to capture many of the main difficulties associated with GAN training, yet simple enough to analyze rigorously. -- Fibonacci heaps are a data structure that provide a heap (a priority queue) and have optimal amortized runtimes for these operations. They are especially useful when one has to change the priorities of element many more times than one needs to remove elements from the data structure. We resolve two conjectures regarding the efficiency of variants of Fibonacci heaps, the first due to Karger and the second due to Fredman. --
Perhaps the most basic statistical question one can ask is how many samples of data one needs in order to check whether the data came from a hypothesis distribution or not. This is sometimes called goodness of fit testing in statistics or identity testing in computer science. We give the first algorithms that provably use as few samples as possible for these problems in all parameter regimes up to constant factors.
by John Peebles.
Ph.D.
Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
345 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Fast spectral primitives for directed graphs
Thesis
application/pdf
2020-03-09T18:52:25Z
Publication
Doctoral
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a09b459c-a4bb-44e6-ba16-74882f168c01">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Fast spectral primitives for directed graphs</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Peebles, John Lee Thompson,Jr.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis, we study several algorithmic problems involving numerical linear algebra, probability, and statistics. Its main results include the following: -- We give the first nearly linear time algorithms for a large class of directed graph problems including computing the stationary distribution of a Markov chain with only a logarithmic dependence on the mixing time. Our approach is based on developing new spectral tools for directed graphs, including the first algorithms for sparsifying directed graphs and solving directed Laplacian linear systems. -- Symmetric diagonally dominant matrices frequently arise in science and engineering applications, often when one is discretization certain types of differential equations. We give faster algorithms for estimating the determinant of a symmetric diagonally dominant matrix and for sampling random spanning trees from a graph. --</Abstract>
<Abstract>Generative adversarial networks (GANs) are an important technique used in deep learning. However, the methods for training them are not satisfactorily understood from a theoretical perspective. To help improve this understanding, we devise a parametric problem which is sophisticated enough to capture many of the main difficulties associated with GAN training, yet simple enough to analyze rigorously. -- Fibonacci heaps are a data structure that provide a heap (a priority queue) and have optimal amortized runtimes for these operations. They are especially useful when one has to change the priorities of element many more times than one needs to remove elements from the data structure. We resolve two conjectures regarding the efficiency of variants of Fibonacci heaps, the first due to Karger and the second due to Fredman. --</Abstract>
<Abstract>Perhaps the most basic statistical question one can ask is how many samples of data one needs in order to check whether the data came from a hypothesis distribution or not. This is sometimes called goodness of fit testing in statistics or identity testing in computer science. We give the first algorithms that provably use as few samples as possible for these problems in all parameter regimes up to constant factors.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>