13 citations · 23 across the 7 of their papers we have counts for
7 papers
Projective limits of probabilistic symmetries and their applications to random graph limits
Pim van der Hoorn, Huck Stepanyants, Dmitri Krioukov
We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limi…
Automatic Identification of Traps in Molecular Charge Transport Networks of Organic Semiconductors
Zhongquan Chen, Pim van der Hoorn, Björn Baumeier
This paper introduces a method to identify traps in molecular charge transport networks as obtained by multiscale modeling of organic semiconductors. Depending on the materials, tr…
Weighted hypersoft configuration model
Ivan Voitalov, Pim van der Hoorn, Maksim Kitsak +2
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequence…
Problems with classification, hypothesis testing, and estimator convergence in the analysis of degree distributions in networks
Pim van der Hoorn, Ivan Voitalov, Remco van der Hofstad +1
In their recent work "Scale-free networks are rare", Broido and Clauset address the problem of the analysis of degree distributions in networks to classify them as scale-free at di…
Regular graphs with linearly many triangles
Pim van der Hoorn, Gabor Lippner, Elchanan Mossel
A -regular graph on nodes has at most triangles. We compute the leading asymptotics of the probability that a large random -regular…
Generating maximally disassortative graphs with given degree distribution
Pim van der Hoorn, Liudmila Ostroumova Prokhorenkova, Egor Samosvat
In this paper we consider the optimization problem of generating graphs with a prescribed degree distribution, such that the correlation between the degrees of connected nodes, as…
Convergence of rank based degree-degree correlations in random directed networks
Pim van der Hoorn, Nelly Litvak
We introduce, and analyze, three measures for degree-degree dependencies, also called degree assortativity, in directed random graphs, based on Spearman's rho and Kendall's tau. We…