Remco van der Hofstad

Orcid: 0000-0003-1331-9697

According to our database1, Remco van der Hofstad authored at least 61 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Euclidean TSP in Narrow Strips.
Discret. Comput. Geom., June, 2024

The winner takes it all but one.
J. Appl. Probab., March, 2024

Connectivity of random graphs after centrality-based vertex removal.
J. Appl. Probab., 2024

Learning the mechanisms of network growth.
CoRR, 2024

2023
Unified approach for solving exit problems for additive-increase and multiplicative-decrease processes.
J. Appl. Probab., March, 2023

The Hyperspherical Geometry of Community Detection: Modularity as a Distance.
J. Mach. Learn. Res., 2023

On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem.
CoRR, 2023

The Projection Method: a Unified Formalism for Community Detection.
CoRR, 2023

Correcting for Granularity Bias in Modularity-Based Community Detection Methods.
Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

2022
Phase transition in random intersection graphs with communities.
Random Struct. Algorithms, 2022

2020
Expansion of Percolation Critical Points for Hamming Graphs.
Comb. Probab. Comput., 2020

Problems with classification, hypothesis testing, and estimator convergence in the analysis of degree distributions in networks.
CoRR, 2020

Counting Triangles in Power-Law Uniform Random Graphs.
Electron. J. Comb., 2020

2019
Component structure of the configuration model: Barely supercritical case.
Random Struct. Algorithms, 2019

Diameter in ultra-small scale-free random graphs.
Random Struct. Algorithms, 2019

Large deviations of bivariate Gaussian extrema.
Queueing Syst. Theory Appl., 2019

Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations.
Math. Oper. Res., 2019

Hydra: A Multiple Blockchain Protocol for Improving Transaction Throughput.
CoRR, 2019

Variational principle for scale-free network motifs.
CoRR, 2019

Switch chain mixing times and triangle counts in simple random graphs with given degrees.
J. Complex Networks, 2019

A new model for overlapping communities with arbitrary internal structure.
Appl. Netw. Sci., 2019

2018
From trees to graphs: collapsing continuous-time branching processes.
J. Appl. Probab., 2018

Scale-free network clustering in hyperbolic and other random graphs.
CoRR, 2018

Scale-free Networks Well Done.
CoRR, 2018

2017
Finite-pool queueing with heavy-tailed services.
J. Appl. Probab., 2017

Nonuniversality of weighted random graphs with infinite variance degree.
J. Appl. Probab., 2017

Critical Window for Connectivity in the Configuration Model.
Comb. Probab. Comput., 2017

Diameter of the Stochastic Mean-Field Model of Distance.
Comb. Probab. Comput., 2017

Clustering Spectrum of hierarchical scale-free networks.
CoRR, 2017

Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016
On the random structure of behavioural transition systems.
Sci. Comput. Program., 2016

Epidemic spreading on complex networks with community structures.
CoRR, 2016

Power-law relations in random networks with communities.
CoRR, 2016

Random Graphs and Complex Networks
Cambridge Series in Statistical and Probabilistic Mathematics 43, Cambridge University Press, ISBN: 9781316779422, 2016

2014
The front of the epidemic spread and first passage percolation.
J. Appl. Probab., 2014

Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees.
Internet Math., 2014

Personalized PageRank with Node-Dependent Restart.
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2013
Critical behavior in inhomogeneous random graphs.
Random Struct. Algorithms, 2013

2012
Large scale-free networks are not disassortative
CoRR, 2012

2011
First Passage Percolation on the Erdős-Rényi Random Graph.
Comb. Probab. Comput., 2011

2010
The second largest component in the supercritical 2D Hamming graph.
Random Struct. Algorithms, 2010

2008
An Elementary Proof of the Hitting Time Theorem.
Am. Math. Mon., 2008

2007
Distribution of the ICI Term in Phase Noise Impaired OFDM Systems.
IEEE Trans. Wirel. Commun., 2007

Brownian-Bridge-Based Statistical Analysis of the DAC INL Caused by Current Mismatch.
IEEE Trans. Circuits Syst. II Express Briefs, 2007

The weight of the shortest path tree.
Random Struct. Algorithms, 2007

A Phase Transition for the Diameter of the Configuration Model.
Internet Math., 2007

Generating Snapshots and Analyzing Missed Traffic in Wireless Communications.
Proceedings of the Global Communications Conference, 2007

2006
The Effect of System Load on the Existence of Bit Errors in CDMA With and Without Parallel Interference Cancelation.
IEEE Trans. Inf. Theory, 2006

Counting connected graphs asymptotically.
Eur. J. Comb., 2006

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., 2006

Size and Weight of Shortest Path Trees with Exponential Link Weights.
Comb. Probab. Comput., 2006

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The <i>n</i>-Cube.
Comb., 2006

2005
Asymptotic expansions in <i>n</i><sup>-1</sup> for percolation critical values on the <i>n</i>-Cube and Z<sup><i>n</i></sup>.
Random Struct. Algorithms, 2005

Distances in random graphs with finite variance degrees.
Random Struct. Algorithms, 2005

Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Random Struct. Algorithms, 2005

2003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation.
IEEE Trans. Inf. Theory, 2003

The lace expansion on a tree with application to networks of self-avoiding walks.
Adv. Appl. Math., 2003

2002
Analytical Methods for CDMA Systems with Parallel Interference Cancellation: The Large Deviation Approach.
Wirel. Pers. Commun., 2002

Large Deviations for Code Division Multiple Access Systems.
SIAM J. Appl. Math., 2002

On the covariance of the level sizes in random recursive trees.
Random Struct. Algorithms, 2002

2001
On the efficiency of multicast.
IEEE/ACM Trans. Netw., 2001


  Loading...