default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPim van der Hoorn
Person information
- affiliation: Northeastern University, Boston, MA, USA
- affiliation (PhD 2016): University of Twente, Enschede, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Pim van der Hoorn
, Gabor Lippner, Carlo A. Trugenberger, Dmitri Krioukov:
Ollivier Curvature of Random Geometric Graphs Converges to Ricci Curvature of Their Riemannian Manifolds. Discret. Comput. Geom. 70(3): 671-712 (2023)- [i8]I. A. Kasyanov, Pim van der Hoorn, Dmitri V. Krioukov, M. V. Tamm:
Nearest-neighbour directed random hyperbolic graphs. CoRR abs/2303.01002 (2023) - 2022
- [j3]Pim van der Hoorn, Gabor Lippner, Elchanan Mossel:
Regular Graphs with Many Triangles are Structured. Electron. J. Comb. 29(1) (2022) - [i7]Jeremy Paton, Harrison Hartle, Jakob Stepanyants, Pim van der Hoorn, Dmitri V. Krioukov:
Entropy of labeled versus unlabeled networks. CoRR abs/2204.08508 (2022) - 2020
- [c2]Liudmila Prokhorenkova, Egor Samosvat, Pim van der Hoorn:
Global Graph Curvature. WAW 2020: 16-35 - [i6]Pim van der Hoorn, Ivan Voitalov, Remco van der Hofstad, Dmitri V. Krioukov:
Problems with classification, hypothesis testing, and estimator convergence in the analysis of degree distributions in networks. CoRR abs/2003.14012 (2020) - [i5]Ivan Voitalov, Pim van der Hoorn, Maksim Kitsak, Fragkiskos Papadopoulos, Dmitri V. Krioukov:
Weighted hypersoft configuration model. CoRR abs/2007.00124 (2020) - [i4]Pim van der Hoorn, William J. Cunningham, Gabor Lippner, Carlo A. Trugenberger, Dmitri V. Krioukov:
Ollivier-Ricci curvature convergence in random geometric graphs. CoRR abs/2008.01209 (2020)
2010 – 2019
- 2018
- [j2]Pim van der Hoorn, Dong Yao, Nelly Litvak:
Average nearest neighbor degrees in scale-free networks. Internet Math. 2018 (2018) - [i3]Ivan Voitalov, Pim van der Hoorn, Remco van der Hofstad, Dmitri V. Krioukov:
Scale-free Networks Well Done. CoRR abs/1811.02071 (2018) - 2017
- [i2]Pim van der Hoorn, Gabor Lippner, Dmitri V. Krioukov:
Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution. CoRR abs/1705.10261 (2017) - 2016
- [b1]Pim van der Hoorn:
Asymptotic analysis of network structures: degree-degree correlations and directed paths. University of Twente, Enschede, Netherlands, 2016 - 2015
- [j1]Pim van der Hoorn, Nelly Litvak:
Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees. Internet Math. 11(2): 155-179 (2015) - [c1]Pim van der Hoorn, Nelly Litvak:
Upper Bounds for Number of Removed Edges in the Erased Configuration Model. WAW 2015: 54-65 - [i1]Pim van der Hoorn, Nelly Litvak:
Phase transitions for scaling of structural correlations in directed networks. CoRR abs/1504.01535 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
