default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRemco van der Hofstad
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j47]Remco van der Hofstad, Noëla Müller, Haodong Zhu:
The rank of sparse symmetric matrices over arbitrary fields. Random Struct. Algorithms 66(1) (2025)- [j46]Marta Milewska, Remco van der Hofstad, Bert Zwart:
Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure. Random Struct. Algorithms 66(1) (2025) - 2024
- [j45]Henk Alkema
, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strips. Discret. Comput. Geom. 71(4): 1456-1506 (2024) - [j44]Maria Deijfen, Remco van der Hofstad, Matteo Sfragara:
The winner takes it all but one. J. Appl. Probab. 61(1): 137-152 (2024) - [j43]Remco van der Hofstad, Manish Pandey:
Connectivity of random graphs after centrality-based vertex removal. J. Appl. Probab. 61(3): 967-998 (2024) - [i14]Lourens Touwen, Doina Bucur, Remco van der Hofstad, Alessandro Garavaglia, Nelly Litvak:
Learning the mechanisms of network growth. CoRR abs/2404.00793 (2024) - 2023
- [j42]Remco van der Hofstad, Stella Kapodistria, Zbigniew Palmowski, Seva Shneer:
Unified approach for solving exit problems for additive-increase and multiplicative-decrease processes. J. Appl. Probab. 60(1): 85-105 (2023) - [j41]Martijn Gösgens, Remco van der Hofstad, Nelly Litvak:
The Hyperspherical Geometry of Community Detection: Modularity as a Distance. J. Mach. Learn. Res. 24: 112:1-112:36 (2023) - [c4]Martijn Gösgens, Remco van der Hofstad, Nelly Litvak:
Correcting for Granularity Bias in Modularity-Based Community Detection Methods. WAW 2023: 1-18 - [i13]Martijn Gösgens, Remco van der Hofstad, Nelly Litvak:
The Projection Method: a Unified Formalism for Community Detection. CoRR abs/2312.14568 (2023) - [i12]Max Hahn-Klimroth, Remco van der Hofstad, Noëla Müller, Connor Riddlesden:
On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem. CoRR abs/2312.14588 (2023) - 2022
- [j40]Remco van der Hofstad, Júlia Komjáthy, Viktória Vadon:
Phase transition in random intersection graphs with communities. Random Struct. Algorithms 60(3): 406-461 (2022) - 2021
- [i11]Martijn Gösgens, Remco van der Hofstad, Nelly Litvak:
The Hyperspherical Geometry of Community Detection: Modularity as a Distance. CoRR abs/2107.02645 (2021) - 2020
- [j39]Pu Gao, Remco van der Hofstad, Angus Southwell, Clara Stegehuis:
Counting Triangles in Power-Law Uniform Random Graphs. Electron. J. Comb. 27(3): 3 (2020) - [j38]Lorenzo Federico, Remco van der Hofstad, Frank Den Hollander, Tim Hulshof:
Expansion of Percolation Critical Points for Hamming Graphs. Comb. Probab. Comput. 29(1): 68-100 (2020) - [i10]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)
2010 – 2019
- 2019
- [j37]Viktória Vadon, Júlia Komjáthy, Remco van der Hofstad:
A new model for overlapping communities with arbitrary internal structure. Appl. Netw. Sci. 4(1): 42:1-42:19 (2019) - [j36]Tom Bannink, Remco van der Hofstad, Clara Stegehuis:
Switch chain mixing times and triangle counts in simple random graphs with given degrees. J. Complex Networks 7(2): 210-225 (2019) - [j35]Gianmarco Bet, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations. Math. Oper. Res. 44(3): 821-864 (2019) - [j34]Remco van der Hofstad, Harsha Honnappa:
Large deviations of bivariate Gaussian extrema. Queueing Syst. Theory Appl. 93(3-4): 333-349 (2019) - [j33]Francesco Caravenna, Alessandro Garavaglia, Remco van der Hofstad:
Diameter in ultra-small scale-free random graphs. Random Struct. Algorithms 54(3): 444-498 (2019) - [j32]Remco van der Hofstad, Svante Janson, Malwina J. Luczak:
Component structure of the configuration model: Barely supercritical case. Random Struct. Algorithms 55(1): 3-55 (2019) - [i9]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Variational principle for scale-free network motifs. CoRR abs/1904.08114 (2019) - [i8]Rowel Gündlach, Jaap-Henk Hoepman, Remco van der Hofstad, Tommy Koens, Stijn Meijer:
Hydra: A Multiple Blockchain Protocol for Improving Transaction Throughput. CoRR abs/1910.06682 (2019) - 2018
- [j31]Alessandro Garavaglia, Remco van der Hofstad:
From trees to graphs: collapsing continuous-time branching processes. J. Appl. Probab. 55(3): 900-919 (2018) - [i7]Ivan Voitalov, Pim van der Hoorn, Remco van der Hofstad, Dmitri V. Krioukov:
Scale-free Networks Well Done. CoRR abs/1811.02071 (2018) - [i6]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Scale-free network clustering in hyperbolic and other random graphs. CoRR abs/1812.03002 (2018) - 2017
- [j30]Lorenzo Federico, Remco van der Hofstad:
Critical Window for Connectivity in the Configuration Model. Comb. Probab. Comput. 26(5): 660-680 (2017) - [j29]Shankar Bhamidi, Remco van der Hofstad:
Diameter of the Stochastic Mean-Field Model of Distance. Comb. Probab. Comput. 26(6): 797-825 (2017) - [j28]Enrico Baroni, Remco van der Hofstad, Júlia Komjáthy:
Nonuniversality of weighted random graphs with infinite variance degree. J. Appl. Probab. 54(1): 146-164 (2017) - [j27]Gianmarco Bet, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Finite-pool queueing with heavy-tailed services. J. Appl. Probab. 54(3): 921-942 (2017) - [c3]Remco van der Hofstad:
Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions. WG 2017: 1-17 - [i5]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden, A. J. E. M. Janssen:
Clustering Spectrum of hierarchical scale-free networks. CoRR abs/1706.01727 (2017) - 2016
- [b1]Remco van der Hofstad:
Random Graphs and Complex Networks. Cambridge Series in Statistical and Probabilistic Mathematics 43, Cambridge University Press 2016, ISBN 9781316779422 - [j26]Jan Friso Groote, Remco van der Hofstad, Matthias Raffelsieper:
On the random structure of behavioural transition systems. Sci. Comput. Program. 128: 51-67 (2016) - [i4]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Power-law relations in random networks with communities. CoRR abs/1603.09711 (2016) - [i3]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Epidemic spreading on complex networks with community structures. CoRR abs/1611.06092 (2016) - 2014
- [j25]Jan Friso Groote, Remco van der Hofstad, Matthias Raffelsieper:
On the Random Structure of Behavioural Transition Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - [j24]Remco van der Hofstad, Nelly Litvak:
Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees. Internet Math. 10(3-4): 287-334 (2014) - [j23]Shankar Bhamidi, Remco van der Hofstad, Júlia Komjáthy:
The front of the epidemic spread and first passage percolation. J. Appl. Probab. 51(A): 101-121 (2014) - [c2]Konstantin Avrachenkov, Remco van der Hofstad, Marina Sokol:
Personalized PageRank with Node-Dependent Restart. WAW 2014: 23-33 - [i2]Konstantin Avrachenkov, Remco van der Hofstad, Marina Sokol:
Personalized PageRank with Node-dependent Restart. CoRR abs/1408.0719 (2014) - 2013
- [j22]Remco van der Hofstad:
Critical behavior in inhomogeneous random graphs. Random Struct. Algorithms 42(4): 480-508 (2013) - 2012
- [i1]Nelly Litvak, Remco van der Hofstad:
Large scale-free networks are not disassortative. CoRR abs/1204.0266 (2012) - 2011
- [j21]Shankar Bhamidi, Remco van der Hofstad, Gerard Hooghiemstra:
First Passage Percolation on the Erdős-Rényi Random Graph. Comb. Probab. Comput. 20(5): 683-707 (2011) - 2010
- [j20]Remco van der Hofstad, Malwina J. Luczak, Joel Spencer:
The second largest component in the supercritical 2D Hamming graph. Random Struct. Algorithms 36(1): 80-89 (2010)
2000 – 2009
- 2008
- [j19]Remco van der Hofstad, Michael Keane:
An Elementary Proof of the Hitting Time Theorem. Am. Math. Mon. 115(8): 753-756 (2008) - 2007
- [j18]Remco van der Hofstad, Gerard Hooghiemstra, Dmitri Znamenski:
A Phase Transition for the Diameter of the Configuration Model. Internet Math. 4(1): 113-128 (2007) - [j17]Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
The weight of the shortest path tree. Random Struct. Algorithms 30(3): 359-379 (2007) - [j16]Georgi I. Radulov, Markus Heydenreich, Remco van der Hofstad, Johannes A. Hegt, Arthur H. M. van Roermund:
Brownian-Bridge-Based Statistical Analysis of the DAC INL Caused by Current Mismatch. IEEE Trans. Circuits Syst. II Express Briefs 54-II(2): 146-150 (2007) - [j15]Tim C. W. Schenk, Remco van der Hofstad, Erik R. Fledderus, Peter F. M. Smulders:
Distribution of the ICI Term in Phase Noise Impaired OFDM Systems. IEEE Trans. Wirel. Commun. 6(4): 1488-1500 (2007) - [c1]D. P. M. Timmers, Erik R. Fledderus, Remco van der Hofstad:
Generating Snapshots and Analyzing Missed Traffic in Wireless Communications. GLOBECOM 2007: 5324-5328 - 2006
- [j14]Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer:
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube. Comb. 26(4): 395-410 (2006) - [j13]Remco van der Hofstad, Gordon Slade:
Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms. Comb. Probab. Comput. 15(5): 695-713 (2006) - [j12]Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
Size and Weight of Shortest Path Trees with Exponential Link Weights. Comb. Probab. Comput. 15(6): 903-926 (2006) - [j11]Remco van der Hofstad, Joel Spencer:
Counting connected graphs asymptotically. Eur. J. Comb. 27(8): 1294-1320 (2006) - [j10]Remco van der Hofstad, Matthias Löwe, Franck Vermet:
The Effect of System Load on the Existence of Bit Errors in CDMA With and Without Parallel Interference Cancelation. IEEE Trans. Inf. Theory 52(10): 4733-4741 (2006) - 2005
- [j9]Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
Distances in random graphs with finite variance degrees. Random Struct. Algorithms 27(1): 76-123 (2005) - [j8]Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel H. Spencer:
Random subgraphs of finite graphs: I. The scaling window under the triangle condition. Random Struct. Algorithms 27(2): 137-184 (2005) - [j7]Remco van der Hofstad, Gordon Slade:
Asymptotic expansions in n-1 for percolation critical values on the n-Cube and Zn. Random Struct. Algorithms 27(3): 331-357 (2005) - 2003
- [j6]Remco van der Hofstad, Gordon Slade:
The lace expansion on a tree with application to networks of self-avoiding walks. Adv. Appl. Math. 30(3): 471-528 (2003) - [j5]Remco van der Hofstad, Marten J. Klok:
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation. IEEE Trans. Inf. Theory 49(11): 2918-2940 (2003) - 2002
- [j4]Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
On the covariance of the level sizes in random recursive trees. Random Struct. Algorithms 20(4): 519-539 (2002) - [j3]Gerard Hooghiemstra, Marten J. Klok, Remco van der Hofstad:
Large Deviations for Code Division Multiple Access Systems. SIAM J. Appl. Math. 62(3): 1044-1065 (2002) - [j2]Marten J. Klok, Gerard Hooghiemstra, Remco van der Hofstad:
Analytical Methods for CDMA Systems with Parallel Interference Cancellation: The Large Deviation Approach. Wirel. Pers. Commun. 21(3): 289-307 (2002) - 2001
- [j1]Piet Van Mieghem, Gerard Hooghiemstra, Remco van der Hofstad:
On the efficiency of multicast. IEEE/ACM Trans. Netw. 9(6): 719-732 (2001)
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 2025-01-07 01:09 CET 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:
