Back to search

University of British Columbia

Variations on sparsifier constructions

Abstract

dc:description

We studied Joshua Batson, Daniel A. Spielman, and Nikhil Srivastava's Twice-Ramanujan Sparsifiers. On this basis, we try to generalize their potential function. Inspired by the idea of non-backtracking matrices, we designed the new potential formula that puts all eigenvalues on the complex plane. Following the construction of the twice Ramanujan sparsifier, we conclude some obstacles must be encountered to improve their bound.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
University of British Columbia
Year dc:date
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Xiao, Ke Han
Contributors dc:contributor
  • Friedman, Joel, 1962-

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/84582

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Xiao, Ke Han. Variations on sparsifier constructions. master's thesis, University of British Columbia, 2023. http://hdl.handle.net/2429/84582