192 citations · 529 across the 38 of their papers we have counts for
4 papers · 1 filter
Robust subgraph counting with distribution-free random graph analysis
Johan S. H. van Leeuwaarden, Clara Stegehuis
Subgraphs such as cliques, loops and stars form crucial connections in the topologies of real-world networks. Random graph models provide estimates for how often certain subgraphs…
Locating highly connected clusters in large networks with HyperLogLog counters
Lotte Weedage, Nelly Litvak, Clara Stegehuis
In this paper we introduce a new method to locate highly connected clusters in a network. Our proposed approach adapts the HyperBall algorithm to localize regions with a high densi…
Variational principle for scale-free network motifs
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden
For scale-free networks with degrees following a power law with an exponent , the structures of motifs (small subgraphs) are not yet well understood. We introduce a meth…
Clustering Spectrum of scale-free networks
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden +1
Real-world networks often have power-law degrees and scale-free properties such as ultra-small distances and ultra-fast information spreading. In this paper, we study a third unive…