activity
20162024
most citedThe dynamics of power laws: Fitness and aging in preferential attachment trees

18 citations · 37 across the 5 of their papers we have counts for

collaborators

7 papers

cs.SI2024★ 6 cited

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.PR2022★ 1 cited

Universality of the local limit of preferential attachment models

Alessandro Garavaglia, Rajat Subhra Hazra, Remco van der Hofstad +1

We study preferential attachment models where vertices enter the network with i.i.d. random numbers of edges that we call the out-degree. We identify the local limit of such models…

math.PR2018★ 11 cited

Subgraphs in preferential attachment models

Alessandro Garavaglia, Clara Stegehuis

We consider subgraph counts in general preferential attachment models with power-law degree exponent . For all subgraphs , we find the scaling of the expected number of sub…

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…

math.PR2017★ 18 cited

The dynamics of power laws: Fitness and aging in preferential attachment trees

Alessandro Garavaglia, Remco van der Hofstad, Gerhard Woeginger

Continuous-time branching processes describe the evolution of a population whose individuals generate a random number of children according to a birth process. Such branching proce…

math.PR2016★ 1 cited

Diameter in ultra-small scale-free random graphs: Extended version

Francesco Caravenna, Alessandro Garavaglia, Remco van der Hofstad

It is well known that many random graphs with infinite variance degrees are ultrasmall. More precisely, for configuration models and preferential attachment models where the propor…