162 citations · 840 across the 63 of their papers we have counts for
4 papers · 1 filter
Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs
Gesine Reinert, Nathan Ross
We provide a general bound on the Wasserstein distance between two arbitrary distributions of sequences of Bernoulli random variables. The bound is in terms of a mixing quantity fo…
Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
Matthew Coulson, Robert E. Gaunt, Gesine Reinert
We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic…
Efficient method for estimating the number of communities in a network
Maria A. Riolo, George T. Cantwell, Gesine Reinert +1
While there exist a wide range of effective methods for community detection in networks, most of them require one to know in advance how many communities one is looking for. Here w…
Identifying networks with common organizational principles
Anatol E. Wegner, Luis Ospina-Forero, Robert E. Gaunt +2
Many complex systems can be represented as networks, and the problem of network comparison is becoming increasingly relevant. There are many techniques for network comparison, from…