Two Problems Involving Random Walks on Graphs: Random surfers, PageRank, and short-time asymptotics for the heat kernel
2021-12
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Two Problems Involving Random Walks on Graphs: Random surfers, PageRank, and short-time asymptotics for the heat kernel
Authors
Published Date
2021-12
Publisher
Type
Thesis or Dissertation
Abstract
Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. In the first part of the thesis, we propose a framework for rigorously studying continuum limits of learning algorithms on directed graphs. We use the new framework to study the PageRank and show how it can be interpreted as a numerical scheme on a directed graph involving a type of normalized graph Laplacian. We show that the corresponding continuum limit problem, which is taken as the number of webpages grows to infinity, is a second-order, elliptic equation that contains reaction, diffusion, and advection terms. In the second part of the thesis, we work in the undirected graph setting and study the short-term behavior of a graph-based random walk defined via the heat kernel. We prove how to estimate the random walk via a Gaussian and propose a method for homogenizing the graph Laplacian to obtain better length-scale restrictions for parameters in the graph model.
Description
University of Minnesota Ph.D. dissertation. December 2021. Major: Mathematics. Advisor: Jeff Calder. 1 computer file (PDF); ii, 65 pages.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Yuan, Amber. (2021). Two Problems Involving Random Walks on Graphs: Random surfers, PageRank, and short-time asymptotics for the heat kernel. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/226381.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.