25 citations · 39 across the 7 of their papers we have counts for
7 papers
Quantifying Network Similarity using Graph Cumulants
Gecia Bravo-Hermsdorff, Lee M. Gunderson, Pierre-André Maugis +1
How might one test the hypothesis that networks were sampled from the same distribution? Here, we compare two statistical tests that use subgraph counts to address this question. T…
Central limit theorems for local network statistics
P-A. Maugis
Subgraph counts - in particular the number of occurrences of small shapes such as triangles - characterize properties of random networks, and as a result have seen wide use as netw…
Nonparametric regression for multiple heterogeneous networks
Swati Chandna, Pierre-Andre Maugis
We study nonparametric methods for the setting where multiple distinct networks are observed on the same set of nodes. Such samples may arise in the form of replicated networks dra…
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…