research
∙
11/10/2021
Geometric Bounds on the Fastest Mixing Markov Chain
In the Fastest Mixing Markov Chain problem, we are given a graph G = (V,...
share
research
∙
06/18/2020
Random walks on randomly evolving graphs
A random walk is a basic stochastic process on graphs and a key primitiv...
research
∙
08/06/2019
Hermitian matrices for clustering directed graphs: insights and applications
Graph clustering is a basic technique in machine learning, and has wides...
research
∙
03/04/2019
Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities
We establish and generalise several bounds for various random walk quant...
research
∙
11/27/2018
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem
We study spectral approaches for the MAX-2-LIN(k) problem, in which we a...
research
∙
11/03/2017