22 citations · 49 across the 5 of their papers we have counts for
14 papers
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…
Network processes on clique-networks with high average degree: the limited effect of higher-order structure
Clara Stegehuis, Thomas Peron
In this paper, we investigate the effect of local structures on network processes. We investigate a random graph model that incorporates local clique structures to deviate from the…
Degree distributions in AB random geometric graphs
Clara Stegehuis, Lotte Weedage
In this paper, we provide degree distributions for random geometric graphs, in which points of type connect to the closest points of type . The motivating example t…
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…
Contact tracing in configuration models
Ivan Kryven, Clara Stegehuis
Quarantining and contact tracing are popular ad hoc practices for mitigating epidemic outbreaks. However, few mathematical theories are currently available to asses the role of a n…
Closure coefficients in scale-free complex networks
Clara Stegehuis
The formation of triangles in complex networks is an important network property that has received tremendous attention. The formation of triangles is often studied through the clus…