Clara Stegehuis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Clara Stegehuis has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
Johan S. H. van Leeuwaarden
Department of Econometrics and Operations Research, Tilburg University, The Netherlands
9 shared publicationsRemco van der Hofstad
Technische Universiteit Eindhoven, Eindhoven, Netherlands
8 shared publications- Riccardo Michielan
Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, Netherlands
6 shared publications - Lotte Weedage
Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, The Netherlands
4 shared publications - Suzan Bayhan
University of Twente, Enschede, Netherlands
3 shared publications - Yanna J. Kraakman
University of Twente
3 shared publications
Latest Publications
- 1 August 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (4) , 3266-3294
Optimal subgraphs in geometric scale-free random graphs
Geometric scale-free random graphs are popular models for networks that exhibit heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices have weights that cause the heavy-tailed degrees and are embedded in a metric space so that close-by groups of vertices tend to cluster. The interplay between the vertex weights and positions heavily affects the local structure of the random graph, in particular the occurrence of subgraph patterns, but the dependencies in these structures and weights make them difficult to analyze. In this paper we investigate subgraph counts using a divide et impera strategy: first counting the number of subgraphs in specific classes of vertices; then computing which class yields maximum contribution. Interestingly, the scaling behavior of induced and general subgraphs in such geometric heavy-tailed random graphs is closely related to the solution of a mixed-integer linear program which also shows that subgraphs appear predominantly on vertices with some prescribed degrees and inter-distances. Finally, we derive precise asymptotics for trees and Hamiltonian subgraphs.
- 1 August 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (4) , 3266-3294
Optimal subgraphs in geometric scale-free random graphs
Geometric scale-free random graphs are popular models for networks that exhibit heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices have weights that cause the heavy-tailed degrees and are embedded in a metric space so that close-by groups of vertices tend to cluster. The interplay between the vertex weights and positions heavily affects the local structure of the random graph, in particular the occurrence of subgraph patterns, but the dependencies in these structures and weights make them difficult to analyze. In this paper we investigate subgraph counts using a divide et impera strategy: first counting the number of subgraphs in specific classes of vertices; then computing which class yields maximum contribution. Interestingly, the scaling behavior of induced and general subgraphs in such geometric heavy-tailed random graphs is closely related to the solution of a mixed-integer linear program which also shows that subgraphs appear predominantly on vertices with some prescribed degrees and inter-distances. Finally, we derive precise asymptotics for trees and Hamiltonian subgraphs.
- Open Access
- 22 June 2026
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 193 (7) , 81
Large Deviations for Subgraphs in Inhomogeneous Random Graphs
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the heavy-tailed nature observed in many contexts. While various graph functionals have been studied in this setting, inhomogeneity makes their analysis significantly more challenging. Here, we investigate the large deviations of subgraph counts in inhomogeneous random graphs. Rare events concerning these functionals translate into quantifying the probability that extremely large hubs appear in the graph. This can be achieved by defining a specific optimization problem that captures the most likely way to generate numerous additional subgraphs. When the expected number of subgraphs is sublinear in the graph size, polynomially large deviations are possible, and in this case, we can derive sharp results on clique counts.
- 22 June 2026
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 193 (7) , 81
Open AccessLarge Deviations for Subgraphs in Inhomogeneous Random Graphs
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the heavy-tailed nature observed in many contexts. While various graph functionals have been studied in this setting, inhomogeneity makes their analysis significantly more challenging. Here, we investigate the large deviations of subgraph counts in inhomogeneous random graphs. Rare events concerning these functionals translate into quantifying the probability that extremely large hubs appear in the graph. This can be achieved by defining a specific optimization problem that captures the most likely way to generate numerous additional subgraphs. When the expected number of subgraphs is sublinear in the graph size, polynomially large deviations are possible, and in this case, we can derive sharp results on clique counts.
- Open Access
- 13 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1)
Homophily within and across groups
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 scale, either one parameter for the whole network or one per community, thereby detaching it from other structural features. Here, we introduce a maximum-entropy random graph model that moves beyond these limits, capturing homophily across all social scales in the network, with parameters for each group size. The framework decomposes homophily into within- and across-group contributions, recovering the stochastic block model as a special case. As an exponential-family model, it fits empirical data and enables inference of group-level variation of homophily that aggregate metrics miss. The group-dependence of homophily substantially impacts network percolation thresholds, altering predictions for epidemic spread, information diffusion, and the effectiveness of interventions. Ignoring such heterogeneity risks systematically misjudging connectivity and dynamics in complex systems.
- 13 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1)
Open AccessHomophily within and across groups
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 scale, either one parameter for the whole network or one per community, thereby detaching it from other structural features. Here, we introduce a maximum-entropy random graph model that moves beyond these limits, capturing homophily across all social scales in the network, with parameters for each group size. The framework decomposes homophily into within- and across-group contributions, recovering the stochastic block model as a special case. As an exponential-family model, it fits empirical data and enables inference of group-level variation of homophily that aggregate metrics miss. The group-dependence of homophily substantially impacts network percolation thresholds, altering predictions for epidemic spread, information diffusion, and the effectiveness of interventions. Ignoring such heterogeneity risks systematically misjudging connectivity and dynamics in complex systems.
- Open Access
- 25 August 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (5)
Stationary distribution of node2vec random walks on household models
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 visited node and on the triangles containing the current and the previously visited node. Even though these walks are widely used in practice, most mathematical properties of node2vec walks are largely unexplored, including their stationary distribution. We study the node2vec random walk on community-structured household model graphs. We prove an explicit description of the stationary distribution of node2vec walks in terms of the walk parameters. We then show that by tuning the walk parameters, the stationary distribution can interpolate between uniform, size-biased, or the simple random walk stationary distributions, demonstrating the wide range of possible walks. We further explore these effects on some specific graph settings.
- 25 August 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (5)
Open AccessStationary distribution of node2vec random walks on household models
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 visited node and on the triangles containing the current and the previously visited node. Even though these walks are widely used in practice, most mathematical properties of node2vec walks are largely unexplored, including their stationary distribution. We study the node2vec random walk on community-structured household model graphs. We prove an explicit description of the stationary distribution of node2vec walks in terms of the walk parameters. We then show that by tuning the walk parameters, the stationary distribution can interpolate between uniform, size-biased, or the simple random walk stationary distributions, demonstrating the wide range of possible walks. We further explore these effects on some specific graph settings.
- Open Access
- 15 July 2025
- Published by Elsevier in Computer Networks
- Vol. 270
beam-align: Distributed user association for mmWave networks with multi-connectivity
- 15 July 2025
- Published by Elsevier in Computer Networks
- Vol. 270
Open Accessbeam-align: Distributed user association for mmWave networks with multi-connectivity
- Open Access
- 26 June 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (4)
Hypercurveball algorithm for sampling hypergraphs with fixed degrees
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 model used for comparison uniformly samples random graphs with the same degrees as the network data, often achieved through edge-swap algorithms. However, for hypergraphs, fewer such methodologies are available. This study introduces the Hypercurveball algorithm, designed to sample random, potentially directed, hypergraphs with fixed degrees. Minor adjustments enable the sampling of hypergraphs without degenerate hyperedges, self-loops, or multi-hyperedges. For most of these algorithms, we prove whether they sample uniformly or with bias. We experimentally show that the Hypercurveball algorithm can be significantly faster or slower than the standard hyperedge-shuffling algorithm, which is the hyperedge-equivalent of the edge-swap algorithm. We present criteria on the hypergraph degree sequence that indicate when the Hypercurveball algorithm is more efficient than the standard hyperedge-shuffling method. Finally, our experimental results suggest polynomial scaling of the mixing time for both the Hypercurveball and hyperedge-shuffling algorithms.
- 26 June 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (4)
Open AccessHypercurveball algorithm for sampling hypergraphs with fixed degrees
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 model used for comparison uniformly samples random graphs with the same degrees as the network data, often achieved through edge-swap algorithms. However, for hypergraphs, fewer such methodologies are available. This study introduces the Hypercurveball algorithm, designed to sample random, potentially directed, hypergraphs with fixed degrees. Minor adjustments enable the sampling of hypergraphs without degenerate hyperedges, self-loops, or multi-hyperedges. For most of these algorithms, we prove whether they sample uniformly or with bias. We experimentally show that the Hypercurveball algorithm can be significantly faster or slower than the standard hyperedge-shuffling algorithm, which is the hyperedge-equivalent of the edge-swap algorithm. We present criteria on the hypergraph degree sequence that indicate when the Hypercurveball algorithm is more efficient than the standard hyperedge-shuffling method. Finally, our experimental results suggest polynomial scaling of the mixing time for both the Hypercurveball and hyperedge-shuffling algorithms.
- 17 June 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (1) , 014314
Optimal network geometry detection for weak geometry
Network geometry, characterized by nodes with associated latent variables, is a fundamental feature of real-world networks. Still, when only the network edges are given, it may be difficult to assess whether the network contains an underlying source of geometry. This paper investigates the limits of geometry detection in networks in a wide class of models that contain geometry and power-law degrees, which include the popular hyperbolic random graph model. We specifically focus on the regime in which the geometric signal is weak. We show that the dependencies between edges in these models can be tackled through mixed-integer linear problems, which lift the nonlinear nature of network analysis into an exponential space in which simple linear optimization techniques can be employed. This approach allows us to investigate which subgraph and degree-based statistic is most effective at detecting the presence of an underlying geometric space. Interestingly, we show that even when the geometric effect is extremely weak, our mixed-integer programming approach identifies a network statistic that efficiently distinguishes geometric and nongeometric random graph models.
- 17 June 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (1) , 014314
Optimal network geometry detection for weak geometry
Network geometry, characterized by nodes with associated latent variables, is a fundamental feature of real-world networks. Still, when only the network edges are given, it may be difficult to assess whether the network contains an underlying source of geometry. This paper investigates the limits of geometry detection in networks in a wide class of models that contain geometry and power-law degrees, which include the popular hyperbolic random graph model. We specifically focus on the regime in which the geometric signal is weak. We show that the dependencies between edges in these models can be tackled through mixed-integer linear problems, which lift the nonlinear nature of network analysis into an exponential space in which simple linear optimization techniques can be employed. This approach allows us to investigate which subgraph and degree-based statistic is most effective at detecting the presence of an underlying geometric space. Interestingly, we show that even when the geometric effect is extremely weak, our mixed-integer programming approach identifies a network statistic that efficiently distinguishes geometric and nongeometric random graph models.
- Open Access
- 8 January 2025
- Published by Royal Society of Chemistry (RSC) in Chemical Science
- Vol. 16 (7) , 3099-3106
Identify structures underlying out-of-equilibrium reaction networks with random graph analysis
Temporal network analysis reveal when feedback interactions emerge in an out-of-equilibrium reaction network. This method could be broadly applied to provide data-driven analysis of experimentally-designed chemical reaction networks.
- 8 January 2025
- Published by Royal Society of Chemistry (RSC) in Chemical Science
- Vol. 16 (7) , 3099-3106
Open AccessIdentify structures underlying out-of-equilibrium reaction networks with random graph analysis
Temporal network analysis reveal when feedback interactions emerge in an out-of-equilibrium reaction network. This method could be broadly applied to provide data-driven analysis of experimentally-designed chemical reaction networks.
- Open Access
- 28 October 2024
- Published by Cambridge University Press (CUP) in Network Science
- Vol. 12 (4) , 366-391
Maximal cliques in scale-free random graphs
We investigate the number of maximal cliques, that is, cliques that are not contained in any larger clique, in three network models: Erdős–Rényi random graphs, inhomogeneous random graphs (IRGs) (also called Chung–Lu graphs), and geometric inhomogeneous random graphs (GIRGs). For sparse and not-too-dense Erdős–Rényi graphs, we give linear and polynomial upper bounds on the number of maximal cliques. For the dense regime, we give super-polynomial and even exponential lower bounds. Although (G)IRGs are sparse, we give super-polynomial lower bounds for these models. This comes from the fact that these graphs have a power-law degree distribution, which leads to a dense subgraph in which we find many maximal cliques. These lower bounds seem to contradict previous empirical evidence that (G)IRGs have only few maximal cliques. We resolve this contradiction by providing experiments indicating that, even for large networks, the linear lower-order terms dominate, before the super-polynomial asymptotic behavior kicks in only for networks of extreme size.
- 28 October 2024
- Published by Cambridge University Press (CUP) in Network Science
- Vol. 12 (4) , 366-391
Open AccessMaximal cliques in scale-free random graphs
We investigate the number of maximal cliques, that is, cliques that are not contained in any larger clique, in three network models: Erdős–Rényi random graphs, inhomogeneous random graphs (IRGs) (also called Chung–Lu graphs), and geometric inhomogeneous random graphs (GIRGs). For sparse and not-too-dense Erdős–Rényi graphs, we give linear and polynomial upper bounds on the number of maximal cliques. For the dense regime, we give super-polynomial and even exponential lower bounds. Although (G)IRGs are sparse, we give super-polynomial lower bounds for these models. This comes from the fact that these graphs have a power-law degree distribution, which leads to a dense subgraph in which we find many maximal cliques. These lower bounds seem to contradict previous empirical evidence that (G)IRGs have only few maximal cliques. We resolve this contradiction by providing experiments indicating that, even for large networks, the linear lower-order terms dominate, before the super-polynomial asymptotic behavior kicks in only for networks of extreme size.
- Open Access
- 23 July 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Identify structures underlying out-of-equilibrium reaction networks with random graph analysis
Network measures have proven very successful in identifying structural patterns in complex systems (e.g., a living cell, a neural network, the Internet). How such measures can be made applicable for the de novo design of chemical reaction networks (CRNs) is unknown. Here, we develop a procedure to model CRNs as a mathematical graph on which network measures and a random graph analysis can be applied. We used an enzymatic CRN (for which a mass-action model was previously developed) to show that the procedure provides insights into its network structure and properties. Temporal analyses, in particular, revealed when feedback interactions emerge in such a network, indicating that CRNs may comprise various subgraphs at different time steps but never the entire graph with all its edges present. We envision that the method developed here could be broadly applied in chemistry to characterize the network properties of many other CRNs, promising data-driven predictions designs of future molecular systems of ever greater complexity.
- 23 July 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessIdentify structures underlying out-of-equilibrium reaction networks with random graph analysis
Network measures have proven very successful in identifying structural patterns in complex systems (e.g., a living cell, a neural network, the Internet). How such measures can be made applicable for the de novo design of chemical reaction networks (CRNs) is unknown. Here, we develop a procedure to model CRNs as a mathematical graph on which network measures and a random graph analysis can be applied. We used an enzymatic CRN (for which a mass-action model was previously developed) to show that the procedure provides insights into its network structure and properties. Temporal analyses, in particular, revealed when feedback interactions emerge in such a network, indicating that CRNs may comprise various subgraphs at different time steps but never the entire graph with all its edges present. We envision that the method developed here could be broadly applied in chemistry to characterize the network properties of many other CRNs, promising data-driven predictions designs of future molecular systems of ever greater complexity.