The following pages link to Clara Stegehuis (Q785564):
Displaying 29 items.
- Counting triangles in power-law uniform random graphs (Q785565) (← links)
- Mesoscopic scales in hierarchical configuration models (Q1630667) (← links)
- Assemble-to-order systems: a review (Q1753635) (← links)
- Triadic closure in configuration models with unbounded degree fluctuations (Q1756538) (← links)
- Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (Q2116499) (← links)
- Optimal subgraph structures in scale-free configuration models (Q2240823) (← links)
- Degree distributions in \(AB\) random geometric graphs (Q2668250) (← links)
- Closure coefficients in scale-free complex networks (Q4992031) (← links)
- Limit theorems for assortativity and clustering in null models for scale-free networks (Q5005042) (← links)
- Locating highly connected clusters in large networks with HyperLogLog counters (Q5022511) (← links)
- Scale-free network clustering in hyperbolic and other random graphs (Q5055677) (← links)
- Cliques in geometric inhomogeneous random graphs (Q5057981) (← links)
- Subgraphs in preferential attachment models (Q5203960) (← links)
- Degree correlations in scale-free random graph models (Q5235048) (← links)
- Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs (Q5881224) (← links)
- On the distances within cliques in a soft random geometric graph (Q6131244) (← links)
- Scale-free graphs with many edges (Q6177606) (← links)
- Local clustering in scale-free networks with hidden variables (Q6279579) (← links)
- Clustering Spectrum of scale-free networks (Q6287542) (← links)
- Cliques in geometric inhomogeneous random graph (Q6369354) (← links)
- Robust subgraph counting with distribution-free random graph analysis (Q6373406) (← links)
- Detecting hyperbolic geometry in networks: why triangles are not enough (Q6506013) (← links)
- Large deviations for triangles in scale-free random graphs (Q6509198) (← links)
- Resource and location sharing in wireless networks (Q6509788) (← links)
- Configuration models for random directed hypergraphs (Q6521121) (← links)
- Optimal subgraphs in geometric scale-free random graphs (Q6531746) (← links)
- Reconstruction of geometric random graphs with the Simple algorithm (Q6738057) (← links)
- Hypercurveball algorithm for sampling hypergraphs with fixed degrees (Q6756908) (← links)
- Homophily Within and Across Groups (Q6757512) (← links)
