Pim van der Hoorn

Pim van der Hoorn

Auto-generated profile, based on publicly available information

Pim van der Hoorn

Eindhoven University of Technology

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 October 2019 in Physical Review Research
Verified
Journal Article
Open access
PDF file
IVIvan Voitalov
Ivan Voitalov
PHPim van der Hoorn
Pim van der Hoorn
RHRemco van der Hofstad
Remco van der Hofstad
DKDmitri Krioukov
Dmitri Krioukov
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 distributions, equivalent to the definition of regularly varying distributions that are widely used in statistics and other fields. This definition allows the distribution to deviate from a pure power law arbitrarily but without affecting the power-law tail exponent. We then identify three estimators of these exponents that are proven to be statistically consistent—that is, converging to the true value of the exponent for any regularly varying distribution—and that satisfy some additional niceness requirements. In contrast to estimators that are currently popular in network science, the estimators considered here are based on fundamental results in extreme value theory, and so are the proofs of their consistency. Finally, we apply these estimators to a representative collection of synthetic and real-world data. According to their estimates, real-world scale-free networks are definitely not as rare as one would conclude based on the popular but unrealistic assumption that real-world data come from power laws of pristine purity, void of noise, and deviations.

5 March 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
PHPim van der Hoorn
Pim van der Hoorn
WCWilliam J. Cunningham
William J. Cunningham
GLGabor Lippner
Gabor Lippner
CTCarlo Trugenberger
Carlo Trugenberger
DKDmitri Krioukov
Dmitri Krioukov
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional definition of curvature of a Riemannian manifold. Here we show that Ollivier curvature of random geometric graphs in any Riemannian manifold converges in the continuum limit to Ricci curvature of the underlying manifold, but only if the definition of Ollivier graph curvature is properly generalized to apply to mesoscopic graph neighborhoods. This result establishes a rigorous link between a definition of curvature applicable to networks and a traditional definition of curvature of smooth spaces.

6 October 2017 in Journal of Statistical Physics
Verified
Journal Article
Closed access
PDF file
PHPim van der Hoorn
Pim van der Hoorn
GLGabor Lippner
Gabor Lippner
DKDmitri Krioukov
Dmitri Krioukov

14 April 2023 in Advances in Applied Probability
Verified
Journal Article
Closed access
PDF file
RHRemco van der Hofstad
Remco van der Hofstad
PHPim van der Hoorn
Pim van der Hoorn
NMNeeladri Maitra
Neeladri Maitra
Consider a set of n vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$ , and a weight associated to it. Construct a random graph by placing edges independently for each vertex pair with a probability that is a function of the distance between the locations and the vertex weights.Under appropriate integrability assumptions on the edge probabilities that imply sparseness of the model, after appropriately blowing up the locations, we prove that the local limit of this random graph sequence is the (countably) infinite random graph on $\mathbb{R}^d$ with vertex locations given by a homogeneous Poisson point process, having weights which are independent and identically distributed copies of limiting vertex weights. Our set-up covers many sparse geometric random graph models from the literature, including geometric inhomogeneous random graphs (GIRGs), hyperbolic random graphs, continuum scale-free percolation, and weight-dependent random connection models.We prove that the limiting degree distribution is mixed Poisson and the typical degree sequence is uniformly integrable, and we obtain convergence results on various measures of clustering in our graphs as a consequence of local convergence. Finally, as a byproduct of our argument, we prove a doubly logarithmic lower bound on typical distances in this general setting.

9 January 2018 in Internet Mathematics
Verified
Journal Article
Closed access
PHPim van der Hoorn
Pim van der Hoorn
DYDong Yao
Dong Yao
NLNelly Litvak
Nelly Litvak

7 July 2014 in Internet Mathematics
Verified
Journal Article
Closed access
PDF file
PHPim van der Hoorn
Pim van der Hoorn
NLNelly Litvak
Nelly Litvak
By Pim van der Hoorn, Nelly Litvak. In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting...