Browsing Theses by Supervisor "Lau, Lap Chi"
Now showing items 1-5 of 5
-
The Complexity of Network Design for s-t Eff ective Resistance
(University of Waterloo, 2018-08-23)We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two ... -
Geodesic Convex Analysis of Group Scaling for the Paulsen Problem and the Tensor Normal Model
(University of Waterloo, 2021-11-18)The framework of scaling problems has recently had much interest in the theoretical computer science community due to its variety of applications, from algebraic complexity to machine learning. In this thesis, our main ... -
Higher Order Random Walks, Local Spectral Expansion, and Applications
(University of Waterloo, 2020-09-16)The study of spectral expansion of graphs and expander graphs has been an extremely fruitful line of research in Mathematics and Computer Science, with applications ranging from random walks and fast sampling to optimization. ... -
Incorporating Linear Dependencies into Graph Gaussian Processes
(University of Waterloo, 2023-08-28)Graph Gaussian processes are an important technique for learning unknown functions on graphs while quantifying uncertainty. These processes encode prior information by using kernels that reflect the structure of the graph, ... -
A Spectral Approach to Network Design and Experimental Design
(University of Waterloo, 2020-12-15)Over the last decade, the spectral sparsification technique has become a powerful tool in designing fast graph algorithms for various problems with numerous applications. In this thesis, we extend this spectral approach, ...