3 papers
cs.SI2024
Learning the mechanisms of network growth
Lourens Touwen, Doina Bucur, Remco van der Hofstad +2
We propose a novel model-selection method for dynamic networks. Our approach involves training a classifier on a large body of synthetic network data. The data is generated by simu…
math.PR2018
Local weak convergence for PageRank
Alessandro Garavaglia, Remco van der Hofstad, Nelly Litvak
PageRank is a well-known algorithm for measuring centrality in networks. It was originally proposed by Google for ranking pages in the World-Wide Web. One of the intriguing empiric…
math.PR2017
From trees to graphs: collapsing continuous-time branching processes
Alessandro Garavaglia, Remco van der Hofstad
Continuous-time branching processes (CTBPs) are powerful tools in random graph theory, but are not appropriate to describe real-world networks, since they produce trees rather than…