234 citations · 1.2k across the 33 of their papers we have counts for
3 papers · 1 filter
Topology reveals universal features for network comparison
Pierre-André G. Maugis, Sofia C. Olhede, Patrick J. Wolfe
The topology of any complex system is key to understanding its structure and function. Fundamentally, algebraic topology guarantees that any system represented by a network can be…
Fast counting of medium-sized rooted subgraphs
P-A. G. Maugis, S. C. Olhede, P. J. Wolfe
We prove that counting copies of any graph in another graph can be achieved using basic matrix operations on the adjacency matrix of . Moreover, the resulting algorithm…
Statistical inference for network samples using subgraph counts
P-A. G. Maugis, Carey E. Priebe, S. C. Olhede +1
We consider that a network is an observation, and a collection of observed networks forms a sample. In this setting, we provide methods to test whether all observations in a networ…