Research map / Graph learning / Graph algorithms and clustering
Individual-centered Partial Information in Social Networks
Xiao Han, Y. X. Rachel Wang, Qing Yang, Xin Tong
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| delete the edge between node 20 and hub A (ablation) | partial network of node 20 · Karate club | detection accuracy: .676 | Hurt |
| use partial network of low-degree node 20 instead of hubs H and A | Algorithm 2 (DCSBM) · Karate club | empirical lambda_min: .117 -> .276 | Improved |
| use partial network of node 1075 instead of 1073 | Algorithm 2 · Political blogs | clustering accuracy: .5798 -> .9261 | Improved |
| increase edge density q to 0.1 or above, away from 1/sqrt(n) | Algorithm 1 (SBM) · Model 1 simulation | misclustering rate | Improved |
| use partial network instead of full network | spectral clustering · Model 1 simulation | misclustering rate | Hurt |
| add degree heterogeneity (DCSBM, Unif(.5,1.5) theta) | Algorithm 2 · Model 2 simulation | misclustering rate | Hurt |
| use lambda_min instead of degree, eigenvector or betweenness centrality | centrality measure · Model 2 simulation (n=600, q=0.2) | correlation with clustering accuracy | Improved |
| use lambda_min instead of diffusion centrality for predicting accuracy | centrality measure · Microfinance villages | correlation with clustering accuracy | Mixed |
| use lambda_min instead of diffusion centrality for participation rate | centrality measure · Microfinance villages | correlation with participation rate: slope 0.621 (p 0.022) vs 0.022 (p 0.003) | Hurt |
| use village leaders rather than non-leaders | Algorithm 2 · Microfinance villages | mean clustering accuracy | Improved |
Closest papers by meaning
- Community models for networks observed through edge nominations (JMLR 2023 · similarity 0.89)
- Information-theoretic Limits for Community Detection in Network Models (NeurIPS 2018 · similarity 0.88)
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.88)
- Detecting Overlapping and Correlated Communities without Pure Nodes: Identifiability and Algorithm (ICML 2019 · similarity 0.88)
- Exact Community Recovery under Side Information: Optimality of Spectral Algorithms (ICLR 2025 · similarity 0.87)
- Harnessing Multiple Correlated Networks for Exact Community Recovery (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
