103 citations · 600 across the 30 of their papers we have counts for
13 papers · 1 filter
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…
Limit theorems for assortativity and clustering in null models for scale-free networks
Remco van der Hofstad, Pim van der Hoorn, Nelly Litvak +1
An important problem in modeling networks is how to generate a randomly sampled graph with given degrees. A popular model is the configuration model, a network with assigned degree…
Average nearest neighbor degrees in scale-free networks
Dong Yao, Pim van der Hoorn, Nelly Litvak
The average nearest neighbor degree (ANND) of a node of degree is widely used to measure dependencies between degrees of neighbor nodes in a network. We formally analyze ANND i…
Upper bounds for number of removed edges in the Erased Configuration Model
Pim van der Hoorn, Nelly Litvak
Models for generating simple graphs are important in the study of real-world complex networks. A well established example of such a model is the erased configuration model, where e…
PageRank in scale-free random graphs
Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto
We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of…
Convergence of rank based degree-degree correlations in random directed networks
Pim van der Hoorn, Nelly Litvak
We introduce, and analyze, three measures for degree-degree dependencies, also called degree assortativity, in directed random graphs, based on Spearman's rho and Kendall's tau. We…