192 citations · 529 across the 38 of their papers we have counts for
5 papers · 2 filters
Limit theorems for assortativity and clustering in null models for scale-free networks
Remco van der Hofstad, Pim van der Hoorn, Nelly Litvak +1
An important problem in modeling networks is how to generate a randomly sampled graph with given degrees. A popular model is the configuration model, a network with assigned degree…
Switch chain mixing times through triangle counts
Tom Bannink, Remco van der Hofstad, Clara Stegehuis
Sampling uniform simple graphs with power-law degree distributions with degree exponent is a non-trivial problem. We propose a method to sample uniform simple graphs th…
Triadic closure in configuration models with unbounded degree fluctuations
Remco van der Hofstad, Johan S. H. van Leeuwaarden, Clara Stegehuis
The configuration model generates random graphs with any given degree distribution, and thus serves as a null model for scale-free networks with power-law degrees and unbounded deg…
Optimal subgraph structures in scale-free configuration models
Remco van der Hofstad, Johan S. H. van Leeuwaarden, Clara Stegehuis
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of th…
Degree correlations in scale-free null models
Clara Stegehuis
We study the average nearest neighbor degree of vertices with degree . In many real-world networks with power-law degree distribution falls off in , a property…