activity
20002026
most citedRandom subgraphs of finite graphs: I. The scaling window under the triangle condition

89 citations · 475 across the 65 of their papers we have counts for

collaborators

71 papers

cs.SI2026

Bringing order to network centrality measures

G. Exarchakos, R. van der Hofstad, O. Nagy +1

We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually s…

math.PR2025

Non-equilibrium coagulation processes and subcritical percolation on evolving networks

Sayan Banerjee, Shankar Bhamidi, Remco van der Hofstad +1

We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $…

math.CO2025

The asymptotic rank of adjacency matrices of weighted configuration models over arbitrary fields

Remco van der Hofstad, Noela Müller, Haodong Zhu

We study the asymptotic rank of adjacency matrices of a large class of edge-weighted configuration models. Here, the weight of a (multi-)edge can be any fixed non-zero element from…

math.PR2025

Local limit of Prim's algorithm

Benoît Corsini, Rowel Gündlach, Remco van der Hofstad

We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for steps, where is the size of the graph, Prim's algorithm will construct…

physics.soc-ph2025

Degrees in Preferential Attachment Networks with an Anomaly

Qiu Liang, Remco van der Hofstad, Nelly Litvak

We consider a preferential attachment model that incorporates an anomaly. Our goal is to understand the evolution of the network before and after the occurrence of the anomaly by s…

math.PR2025

Ising model on preferential attachment models

Remco van der Hofstad, Rounak Ray

We study the Ising model on affine preferential attachment models with general parameters. We identify the thermodynamic limit of several quantities, arising in the large graph lim…