192 citations · 1.1k across the 83 of their papers we have counts for
85 papers · 1 filter
A second-moment proof of quenched equals annealed for the Potts model on random regular graphs
Remco van der Hofstad, Kai-Chun Huang, Noela Müller +1
Ferromagnetic spin models on random regular graphs, such as the Ising and Potts models, have been studied extensively. Several equivalent variational and recursive representations…
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…
Percolation on random graphs
Remco van der Hofstad
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in ma…