Search Results for author:
Found 2 papers, 1 papers with code
A novel measure to identify influential nodes: Return Random Walk Gravity Centrality
To validate the effectiveness of the proposed centrality measure, it is compared with classic measures, such as Degree, Closeness, Betweenness, PageRank, and other measures based on the gravity model, effective distance and community-aware approaches.
Approximating Betweenness-Centrality ranking
Node Classification
On the Interplay between Strong Regularity and Graph Densification
In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs.
