1 citations · 1 across the 10 of their papers we have counts for
17 papers · 1 filter
Logarithmic typical distances in preferential attachment models
Remco van der Hofstad, Haodong Zhu
We prove that the typical distances in a preferential attachment model with out-degree and strictly positive fitness parameter are close to , where is th…
Power-law hypothesis and (un)fairness of PageRank on undirected multi-type PAMs
Christian Borgs, Florian Henning, Remco van der Hofstad +1
The preferential attachment model (PAM) describes the sequential growth of a network based on the "rich-get-richer" principle. Several versions of it have become established for mo…
Network evolution with self-reinforcement
Shankar Bhamidi, Remco van der Hofstad, Frank den Hollander +1
We study a new class of preferential attachment trees with \emph{self-reinforcement}. At each time, each vertex is assigned a weight equal to the cumulative sum over past times of…
The stochastic block model has the overlap graph property for modularity
Shankar Bhamidi, David Gamarnik, Remco van der Hofstad +4
The overlap gap property (OGP) is a statement about the geometry of near-optimal solutions. Exhibiting OGP implies failure of a class of local algorithms; and has been observed to…
Clustering without geometry in sparse networks with independent edges
Alessio Catanzaro, Remco van der Hofstad, Diego Garlaschelli
The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubi…
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…