Pim van der Hoorn
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
Pim van der Hoorn has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Dmitri Krioukov
Northeastern University
7 shared publications Nelly Litvak
Eindhoven University of Technology
6 shared publications- Nelly Litvak
Eindhoven University of Technology
3 shared publications - Remco van der Hofstad
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
3 shared publications - Björn Baumeier
Eindhoven University of Technology
2 shared publications - Federica Eduati
Laboratory of Chemical Biology, Department of Biomedical Engineering, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands
2 shared publications
Latest Publications
- 1 February 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (1) , 494-546
Condensation in scale-free geometric graphs with excess edges
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with heavy-tailed radius distribution, and the age-dependent random connection model. In all these cases the mechanism behind the large deviation is based on a condensation effect. Loosely speaking, the mechanism randomly selects a finite number of vertices and increases their power, so that they connect to a macroscopic number of vertices in the graph, while the other vertices retain a degree close to their expectation and thus make no more than the expected contribution to the large deviation event. We verify this intuition by means of limit theorems for the empirical distributions of degrees and edge lengths under the conditioning. We observe that at large finite volumes, the edge-length distribution splits into a bulk and travelling wave part of asymptotically positive proportions.
- 1 February 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (1) , 494-546
Condensation in scale-free geometric graphs with excess edges
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with heavy-tailed radius distribution, and the age-dependent random connection model. In all these cases the mechanism behind the large deviation is based on a condensation effect. Loosely speaking, the mechanism randomly selects a finite number of vertices and increases their power, so that they connect to a macroscopic number of vertices in the graph, while the other vertices retain a degree close to their expectation and thus make no more than the expected contribution to the large deviation event. We verify this intuition by means of limit theorems for the empirical distributions of degrees and edge lengths under the conditioning. We observe that at large finite volumes, the edge-length distribution splits into a bulk and travelling wave part of asymptotically positive proportions.
- Open Access
- 10 January 2026
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 196
From inhomogeneous random digraphs to random graphs with fixed arc counts
- 10 January 2026
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 196
Open AccessFrom inhomogeneous random digraphs to random graphs with fixed arc counts
- 24 June 2025
- Published by American Physical Society (APS) in Physical Review B
- Vol. 111 (22)
Automatic identification of traps in molecular charge transport networks of organic semiconductors
- 24 June 2025
- Published by American Physical Society (APS) in Physical Review B
- Vol. 111 (22)
Automatic identification of traps in molecular charge transport networks of organic semiconductors
- Open Access
Unifying Directed and Undirected Random Graph Models
In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and investigate which graph events can subsequently be translated between equivalent models. We finally give coupling techniques that can be used to establish an approximate equivalence between directed and undirected random graph models. As an application of these tools, we give conditions under which two broad classes of random graph models are equivalent. In one of these classes the presence of edges/arcs is determined by independent Bernoulli random variables, while in the other class a fixed number of edges/arcs is placed in between vertices according to some probability measure. We finally use these equivalences to extend a previously established relationship between the directed versions of these model classes to their undirected counterparts.
Open AccessUnifying Directed and Undirected Random Graph Models
In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and investigate which graph events can subsequently be translated between equivalent models. We finally give coupling techniques that can be used to establish an approximate equivalence between directed and undirected random graph models. As an application of these tools, we give conditions under which two broad classes of random graph models are equivalent. In one of these classes the presence of edges/arcs is determined by independent Bernoulli random variables, while in the other class a fixed number of edges/arcs is placed in between vertices according to some probability measure. We finally use these equivalences to extend a previously established relationship between the directed versions of these model classes to their undirected counterparts.
- Open Access
- 14 February 2025
- Published by Elsevier in Cell Reports Methods
- Vol. 5 (2) , 100985
Mathematically mapping the network of cells in the tumor microenvironment
- 14 February 2025
- Published by Elsevier in Cell Reports Methods
- Vol. 5 (2) , 100985
Open AccessMathematically mapping the network of cells in the tumor microenvironment
- 21 November 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 108 (5) , 054310
Nearest-neighbor directed random hyperbolic graphs
Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyperbolic model where nodes randomly distributed on a hyperbolic disk are connected to a fixed number of their nearest spatial neighbors. We introduce also a canonical version of this network (which we call “network with varied connection radius”), where maximal length of outgoing bond is space dependent and is determined by fixing the average out-degree to . We study local bond length, in-degree, and reciprocity in these networks as a function of spacial coordinates of the nodes and show that the network has a distinct core-periphery structure. We show that for small densities of nodes the overall in-degree has a truncated power-law distribution. We demonstrate that reciprocity of the network can be regulated by adjusting an additional temperature-like parameter without changing other global properties of the network.- 21 November 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 108 (5) , 054310
Nearest-neighbor directed random hyperbolic graphs
Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyperbolic model where nodes randomly distributed on a hyperbolic disk are connected to a fixed number of their nearest spatial neighbors. We introduce also a canonical version of this network (which we call “network with varied connection radius”), where maximal length of outgoing bond is space dependent and is determined by fixing the average out-degree to . We study local bond length, in-degree, and reciprocity in these networks as a function of spacial coordinates of the nodes and show that the network has a distinct core-periphery structure. We show that for small densities of nodes the overall in-degree has a truncated power-law distribution. We demonstrate that reciprocity of the network can be regulated by adjusting an additional temperature-like parameter without changing other global properties of the network.- Open Access
From inhomogeneous random digraphs to random graphs with fixed arc counts
Consider a random graph model with $n$ vertices where each vertex has a vertex-type drawn from some discrete distribution. Suppose that the number of arcs to be placed between each pair of vertex-types is known, and that each arc is placed uniformly at random without replacement between one of the vertex-pairs with matching types. In this paper, we will show that under certain conditions this random graph model is equivalent to the well-studied inhomogeneous random digraph model. We will use this equivalence in three applications. First, we will apply the equivalence on some well known random graph models (the Erdős-Rényi model, the stochastic block model, and the Chung-Lu model) to showcase what their equivalent counterparts with fixed arcs look like. Secondly, we will extend this equivalence to a practical model for inferring cell-cell interactions to showcase how theoretical knowledge about inhomogeneous random digraphs can be transferred to a modeling context. Thirdly, we will show how our model induces a natural fast algorithm to generate inhomogeneous random digraphs.Open AccessFrom inhomogeneous random digraphs to random graphs with fixed arc counts
Consider a random graph model with $n$ vertices where each vertex has a vertex-type drawn from some discrete distribution. Suppose that the number of arcs to be placed between each pair of vertex-types is known, and that each arc is placed uniformly at random without replacement between one of the vertex-pairs with matching types. In this paper, we will show that under certain conditions this random graph model is equivalent to the well-studied inhomogeneous random digraph model. We will use this equivalence in three applications. First, we will apply the equivalence on some well known random graph models (the Erdős-Rényi model, the stochastic block model, and the Chung-Lu model) to showcase what their equivalent counterparts with fixed arcs look like. Secondly, we will extend this equivalence to a practical model for inferring cell-cell interactions to showcase how theoretical knowledge about inhomogeneous random digraphs can be transferred to a modeling context. Thirdly, we will show how our model induces a natural fast algorithm to generate inhomogeneous random digraphs. - Open Access
- 27 June 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (3) , 671-712
Ollivier Curvature of Random Geometric Graphs Converges to Ricci Curvature of Their Riemannian Manifolds
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete notions of curvature and their smooth counterparts remain lurking and moot. In particular, it is not rigorously known if any notion of graph curvature converges to any traditional notion of curvature of smooth space. Here we prove that in proper settings the Ollivier–Ricci curvature of random geometric graphs in Riemannian manifolds converges to the Ricci curvature of the manifold. This is the first rigorous result linking curvature of random graphs to curvature of smooth spaces. Our results hold for different notions of graph distances, including the rescaled shortest path distance, and for different graph densities. Here the scaling of the average degree, as a function of the graph size, can range from nearly logarithmic to nearly linear.
- 27 June 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (3) , 671-712
Open AccessOllivier Curvature of Random Geometric Graphs Converges to Ricci Curvature of Their Riemannian Manifolds
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete notions of curvature and their smooth counterparts remain lurking and moot. In particular, it is not rigorously known if any notion of graph curvature converges to any traditional notion of curvature of smooth space. Here we prove that in proper settings the Ollivier–Ricci curvature of random geometric graphs in Riemannian manifolds converges to the Ricci curvature of the manifold. This is the first rigorous result linking curvature of random graphs to curvature of smooth spaces. Our results hold for different notions of graph distances, including the rescaled shortest path distance, and for different graph densities. Here the scaling of the average degree, as a function of the graph size, can range from nearly logarithmic to nearly linear.
- 14 April 2023
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 55 (3) , 793-840
Local limits of spatial inhomogeneous random graphs
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.- 14 April 2023
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 55 (3) , 793-840
Local limits of spatial inhomogeneous random graphs
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.