192 citations · 529 across the 38 of their papers we have counts for
44 papers
Stationary distribution of node2vec random walks on household models
Lars Schroeder, Clara Stegehuis
The node2vec random walk has proven to be a key tool in network embedding algorithms. These random walks are tuneable, and their transition probabilities depend on the previous vis…
Homophily Within and Across Groups
Abbas K. Rizi, Riccardo Michielan, Clara Stegehuis +1
Homophily -- the tendency of individuals to interact with similar others -- shapes how networks form and function. Yet existing approaches typically collapse homophily to a single…
Hypercurveball algorithm for sampling hypergraphs with fixed degrees
Yanna J. Kraakman, Clara Stegehuis
Comparative analysis between a network and a random graph model can uncover network properties that significantly deviate from those in random networks. The standard random graph m…
Reconstruction of geometric random graphs with the Simple algorithm
Clara Stegehuis, Lotte Weedage
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edg…
Optimal subgraphs in geometric scale-free random graphs
Riccardo Michielan, Clara Stegehuis, Matthias Walter
Geometric scale-free random graphs are popular models for networks that exhibit as heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices…
Uniformly sampling random directed hypergraphs with fixed degrees
Yanna J. Kraakman, Clara Stegehuis
Many complex systems show non-pairwise interactions, which can be captured by hypergraphs. In this work, we propose an edge-swapping method to sample random directed hypergraphs wi…
Maximal Cliques in Scale-Free Random Graphs
Thomas Bläsius, Maximillian Katzmann, Clara Stegehuis
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erdős-Rényi random graphs, inhomogeneous random gr…
On the distances within cliques in a soft random geometric graph
Ercan Sönmez, Clara Stegehuis
We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away point…
Resource and location sharing in wireless networks
Clara Stegehuis, Lotte Weedage
With more and more demand from devices to use wireless communication networks, there has been an increased interest in resource sharing among operators, to give a better link quali…
Localized geometry detection in scale-free random graphs
Gianmarco Bet, Riccardo Michielan, Clara Stegehuis
We consider the problem of detecting whether a power-law inhomogeneous random graph contains a geometric community, and we frame this as an hypothesis testing problem. More precise…
Large deviations for triangles in scale-free random graphs
Clara Stegehuis, Bert Zwart
We provide large deviations estimates for the upper tail of the number of triangles in scale-free inhomogeneous random graphs where the degrees have power law tails with index $-α,…
On the resilience of cellular networks: how can national roaming help?
Lotte Weedage, Syllas Rangel, Clara Stegehuis +1
Cellular networks have become one of the critical infrastructures, as many services depend increasingly on wireless connectivity. Therefore, it is important to quantify the resilie…
Scale-free graphs with many edges
Clara Stegehuis, Bert Zwart
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying weight distribution. Our results show that the most likely way to have an unusua…
Sharpest possible clustering bounds using robust random graph analysis
Judith Brugman, Johan S. H. van Leeuwaarden, Clara Stegehuis
Complex network theory crucially depends on the assumptions made about the degree distribution, while fitting degree distributions to network data is challenging, in particular for…
Beam-align: distributed user association for mmWave networks with multi-connectivity
Lotte Weedage, Clara Stegehuis, Suzan Bayhan
Since the spectrum below 6 GHz bands is insufficient to meet the high bandwidth requirements of 5G use cases, 5G networks expand their operation to mmWave bands. However, operation…
Detecting hyperbolic geometry in networks: why triangles are not enough
Riccardo Michielan, Nelly Litvak, Clara Stegehuis
In the past decade, geometric network models have received vast attention in the literature. These models formalize the natural idea that similar vertices are likely to connect. Be…
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…
Cliques in geometric inhomogeneous random graph
Riccardo Michielan, Clara Stegehuis
Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geom…
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…
Impact of Multi-connectivity on Channel Capacity and Outage Probability in Wireless Networks
Lotte Weedage, Clara Stegehuis, Suzan Bayhan
Multi-connectivity facilitates higher throughput, shorter delay, and lower outage probability for a user in a wireless network. Considering these promises, a rationale policy for a…
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…
Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
Clara Stegehuis
We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degree…
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…