192 citations · 1.1k across the 83 of their papers we have counts for
8 papers · 1 filter
Scale-free network clustering in hyperbolic and other random graphs
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved success…
The number of partial Steiner systems and -partitions
Remco van der Hofstad, Rudi Pendavingh, Jorn van der Pol
We prove asymptotic upper bounds on the number of -partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture…
Scale-free Networks Well Done
Ivan Voitalov, Pim van der Hoorn, Remco van der Hofstad +1
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distrib…
Random intersection graphs with communities
Remco van der Hofstad, Julia Komjathy, Viktoria Vadon
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships…
Cliques in rank-1 random graphs: the role of inhomogeneity
Kay Bogerd, Rui M. Castro, Remco van der Hofstad
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of th…
Random walk on barely supercritical branching random walk
Remco van der Hofstad, Tim Hulshof, Jan Nagel
Let be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean , conditioned to survive. Let be a random embeddi…