Skip to main content
Duke University Libraries
DukeSpace Scholarship by Duke Authors
  • Login
  • Ask
  • Menu
  • Login
  • Ask a Librarian
  • Search & Find
  • Using the Library
  • Research Support
  • Course Support
  • Libraries
  • About
View Item 
  •   DukeSpace
  • Theses and Dissertations
  • Duke Dissertations
  • View Item
  •   DukeSpace
  • Theses and Dissertations
  • Duke Dissertations
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Towards a Spectral Theory for Simplicial Complexes

Thumbnail
View / Download
628.9 Kb
Date
2013
Author
Steenbergen, John Joseph
Advisor
Mukherjee, Sayan
Repository Usage Stats
266
views
901
downloads
Abstract

In this dissertation we study combinatorial Hodge Laplacians on simplicial com-

plexes using tools generalized from spectral graph theory. Specifically, we consider

generalizations of graph Cheeger numbers and graph random walks. The results in

this dissertation can be thought of as the beginnings of a new spectral theory for

simplicial complexes and a new theory of high-dimensional expansion.

We first consider new high-dimensional isoperimetric constants. A new Cheeger-

type inequality is proved, under certain conditions, between an isoperimetric constant

and the smallest eigenvalue of the Laplacian in codimension 0. The proof is similar

to the proof of the Cheeger inequality for graphs. Furthermore, a negative result is

proved, using the new Cheeger-type inequality and special examples, showing that

certain Cheeger-type inequalities cannot hold in codimension 1.

Second, we consider new random walks with killing on the set of oriented sim-

plexes of a certain dimension. We show that there is a systematic way of relating

these walks to combinatorial Laplacians such that a certain notion of mixing time

is bounded by a spectral gap and such that distributions that are stationary in a

certain sense relate to the harmonics of the Laplacian. In addition, we consider the

possibility of using these new random walks for semi-supervised learning. An algo-

rithm is devised which generalizes a classic label-propagation algorithm on graphs to

simplicial complexes. This new algorithm applies to a new semi-supervised learning

problem, one in which the underlying structure to be learned is flow-like.

Type
Dissertation
Department
Mathematics
Subject
Mathematics
Applied mathematics
Theoretical mathematics
Graph Expansion
Isoperimetric Theory
Random Walks
Semi-Supervised Learning
Simplicial Complexes
Permalink
https://hdl.handle.net/10161/8256
Citation
Steenbergen, John Joseph (2013). Towards a Spectral Theory for Simplicial Complexes. Dissertation, Duke University. Retrieved from https://hdl.handle.net/10161/8256.
Collections
  • Duke Dissertations
More Info
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 United States License.

Rights for Collection: Duke Dissertations


Works are deposited here by their authors, and represent their research and opinions, not that of Duke University. Some materials and descriptions may include offensive content. More info

Make Your Work Available Here

How to Deposit

Browse

All of DukeSpaceCommunities & CollectionsAuthorsTitlesTypesBy Issue DateDepartmentsAffiliations of Duke Author(s)SubjectsBy Submit DateThis CollectionAuthorsTitlesTypesBy Issue DateDepartmentsAffiliations of Duke Author(s)SubjectsBy Submit Date

My Account

LoginRegister

Statistics

View Usage Statistics
Duke University Libraries

Contact Us

411 Chapel Drive
Durham, NC 27708
(919) 660-5870
Perkins Library Service Desk

Digital Repositories at Duke

  • Report a problem with the repositories
  • About digital repositories at Duke
  • Accessibility Policy
  • Deaccession and DMCA Takedown Policy

TwitterFacebookYouTubeFlickrInstagramBlogs

Sign Up for Our Newsletter
  • Re-use & Attribution / Privacy
  • Harmful Language Statement
  • Support the Libraries
Duke University