Ego-net Community Mining Applied to Friend Suggestion
Summary: Study of ego-net communities in online social graphs; introduces a parallel, scalable method to build and cluster all ego-nets on large networks. Develops friend-suggestion features from cross-ego-net co-occurrences; efficient neighborhood-based computation with formal and empirical evidence of outperforming local features. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alessandro Epasto
- 2. Silvio Lattanzi
- 3. Vahab Mirrokni
- 4. Ismail Oner Sebe
- 5. Ahmed Taei
- 6. Sunita Verma
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,039 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.7061003e-05 |
| 7,804 | RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs | 2021 | VLDB | 4.6466513e-05 |
| 9,712 | Maximizing Fair Content Spread via Edge Suggestion in Social Networks | 2022 | VLDB | 4.299267e-05 |
| 9,887 | Graph Exploration: From Users to Large Graphs | 2017 | SIGMOD | 4.2621158e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next