Skip to main content
Cornell University
Learn about arXiv becoming an independent nonprofit.
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > cs > arXiv:2510.10499

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Computer Science > Social and Information Networks

arXiv:2510.10499 (cs)
[Submitted on 12 Oct 2025]

Title:Preserving Core Structures of Social Networks via Information Guided Multi-Step Graph Pruning

Authors:Yutong Hu, Bingxin Zhou, Jing Wang, Weishu Zhao, Liang Hong
View a PDF of the paper titled Preserving Core Structures of Social Networks via Information Guided Multi-Step Graph Pruning, by Yutong Hu and 4 other authors
View PDF HTML (experimental)
Abstract:Social networks often contain dense and overlapping connections that obscure their essential interaction patterns, making analysis and interpretation challenging. Identifying the structural backbone of such networks is crucial for understanding community organization, information flow, and functional relationships. This study introduces a multi-step network pruning framework that leverages principles from information theory to balance structural complexity and task-relevant information. The framework iteratively evaluates and removes edges from the graph based on their contribution to task-relevant mutual information, producing a trajectory of network simplification that preserves most of the inherent semantics. Motivated by gradient boosting, we propose IGPrune, which enables efficient, differentiable optimization to progressively uncover semantically meaningful connections. Extensive experiments on social and biological networks show that IGPrune retains critical structural and functional patterns. Beyond quantitative performance, the pruned networks reveal interpretable backbones, highlighting the method's potential to support scientific discovery and actionable insights in real-world networks.
Subjects: Social and Information Networks (cs.SI); Information Theory (cs.IT)
Cite as: arXiv:2510.10499 [cs.SI]
  (or arXiv:2510.10499v1 [cs.SI] for this version)
  https://doi.org/10.48550/arXiv.2510.10499
arXiv-issued DOI via DataCite

Submission history

From: Yutong Hu [view email]
[v1] Sun, 12 Oct 2025 08:38:36 UTC (6,644 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Preserving Core Structures of Social Networks via Information Guided Multi-Step Graph Pruning, by Yutong Hu and 4 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

cs.SI
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
cs.IT
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • Click here to contact arXiv Contact
  • Click here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status