activity
20182026
most citedCounting triangles in power-law uniform random graphs

10 citations · 31 across the 12 of their papers we have counts for

collaborators

13 papers

quant-ph2026

Double Localization for Quantum Gibbs Sampler Gaps: From an Abstract Framework to Finite-Group Models

Ryu Hayakawa, Angus Southwell, Caesnan M. G. Leditto +2

We introduce double localization, a framework for proving spectral gaps of quantum Gibbs samplers through two complementary operations: geometric localization, which selects update…

quant-ph2026

Efficient Quantum Algorithms for Higher-Order Coupled Oscillators

Caesnan M. G. Leditto, Angus Southwell, Muhammad Usman +1

Higher-order networks with multiway interactions can exhibit collective dynamical phenomena that are absent in traditional pairwise network models. However, analyzing such dynamics…

quant-ph2026

Spatiotemporal Pauli processes: Quantum combs for modeling correlated noise in quantum error correction

John F Kam, Angus Southwell, Spiro Gicev +2

Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microsco…

quant-ph2025

A graph-theoretic approach to chaos and complexity in quantum systems

Maxwell West, Neil Dowling, Angus Southwell +4

There has recently been considerable interest in studying quantum systems via dynamical Lie algebras (DLAs) -- Lie algebras generated by the terms which appear in the Hamiltonian o…

quant-ph2024★ 7 cited

Detrimental non-Markovian errors for surface code memory

John F Kam, Spiro Gicev, Kavan Modi +2

The realization of fault-tolerant quantum computers hinges on effective quantum error correction protocols, whose performance significantly relies on the nature of the underlying n…

quant-ph2024

Quantum HodgeRank: Topology-Based Rank Aggregation on Quantum Computers

Caesnan M. G. Leditto, Angus Southwell, Behnam Tonekaboni +2

HodgeRank generalizes ranking algorithms, e.g. Google PageRank, to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. It ana…

quant-ph2024★ 8 cited

Adversarial Robustness Guarantees for Quantum Classifiers

Neil Dowling, Maxwell T. West, Angus Southwell +4

Despite their ever more widespread deployment throughout society, machine learning algorithms remain critically vulnerable to being spoofed by subtle adversarial tampering with the…

quant-ph2023★ 2 cited

Topological Signal Processing on Quantum Computers for Higher-Order Network Analysis

Caesnan M. G. Leditto, Angus Southwell, Behnam Tonekaboni +3

Predicting and analyzing global behaviour of complex systems is challenging due to the intricate nature of their component interactions. Recent work has started modelling complex s…

math.CO2023

Sprinkling with random regular graphs

Mikhail Isaev, Brendan D. McKay, Angus Southwell +1

We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the com…

math.CO2023

Large induced subgraphs of random graphs with given degree sequences

Angus Southwell, Nicholas Wormald

We study a random graph with given degree sequence , with the aim of characterising the degree sequence of the subgraph induced on a given set of vertices.…

math.CO2020

The threshold of symmetry in random graphs with specified degree sequences

Lochlan Brick, Pu Gao, Angus Southwell

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation…

math.CO2019★ 4 cited

Distribution of tree parameters by martingale approach

Mikhail Isaev, Angus Southwell, Maksim Zhukovskii

For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure.…

math.PR2018★ 10 cited

Counting triangles in power-law uniform random graphs

Pu Gao, Remco van der Hofstad, Angus Southwell +1

We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent . We also analyze the local c…