1 citations · 1 across the 5 of their papers we have counts for
5 papers
Matrix concentration inequalities for time-inhomogeneous Markov chains
Luca Zanetti
We establish Chernoff-type bounds for the largest eigenvalue of sums of Hermitian random matrices generated by a time-inhomogeneous Markov chain. Our primary regime assumes a compa…
An iterative spectral algorithm for digraph clustering
James Martin, Tim Rogers, Luca Zanetti
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the pr…
Percolation and localisation: Sub-leading eigenvalues of the nonbacktracking matrix
James Martin, Tim Rogers, Luca Zanetti
The spectrum of the nonbacktracking matrix associated to a network is known to contain fundamental information regarding percolation properties of the network. Indeed, the inverse…
Wireless Network Topology Inference: A Markov Chains Approach
James Martin, Tristan Pryer, Luca Zanetti
We address the problem of inferring the topology of a wireless network using limited observational data. Specifically, we assume that we can detect when a node is transmitting, but…
Cycle-Free Polytopal Mesh Sweeping for Boltzmann Transport
Ansar Calloo, Matthew Evans, Henry Lockyer +3
We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi t…