Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.06889

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2503.06889 (math)
[Submitted on 10 Mar 2025 ]

Title: BASIC: Bipartite Assisted Spectral-clustering for Identifying Communities in Large-scale Networks

Title: 基于二分图辅助谱聚类的大规模网络社区识别方法

Authors:Tianchen Gao, Jingyuan Liu, Rui Pan, Ao Sun
Abstract: Community detection, which focuses on recovering the group structure within networks, is a crucial and fundamental task in network analysis. However, the detection process can be quite challenging and unstable when community signals are weak. Motivated by a newly collected large-scale academic network dataset from the Web of Science, which includes multi-layer network information, we propose a Bipartite Assisted Spectral-clustering approach for Identifying Communities (BASIC), which incorporates the bipartite network information into the community structure learning of the primary network. The accuracy and stability enhancement of BASIC is validated theoretically on the basis of the degree-corrected stochastic block model framework, as well as numerically through extensive simulation studies. We rigorously study the convergence rate of BASIC even under weak signal scenarios and prove that BASIC yields a tighter upper error bound than that based on the primary network information alone. We utilize the proposed BASIC method to analyze the newly collected large-scale academic network dataset from statistical papers. During the author collaboration network structure learning, we incorporate the bipartite network information from author-paper, author-institution, and author-region relationships. From both statistical and interpretative perspectives, these bipartite networks greatly aid in identifying communities within the primary collaboration network.
Abstract: 社区检测,即专注于恢复网络内部的组结构,在网络分析中是一项关键且基础的任务。然而,当社区信号较弱时,检测过程可能会非常具有挑战性且不稳定。 受到从Web of Science新收集的大规模学术网络数据集(包括多层网络信息)的启发,我们提出了一个双部图辅助谱聚类方法来识别社区(BASIC),该方法将主网络的双部网络信息纳入到社区结构的学习中。 基于度校正随机块模型框架,理论验证了BASIC在准确性和稳定性上的提升,同时通过广泛的模拟研究进行了数值验证。 我们严格研究了即使在弱信号情况下BASIC的收敛速度,并证明BASIC比仅基于主网络信息的方法提供了更紧的误差上界。 我们利用所提出的BASIC方法分析了来自统计学论文的新收集的大规模学术网络数据集。 在作者合作网络结构学习过程中,我们结合了作者-论文、作者-机构和作者-地区关系中的双部网络信息。 从统计和解释的角度来看,这些双部网络极大地有助于识别主协作网络中的社区。
Subjects: Statistics Theory (math.ST)
Cite as: arXiv:2503.06889 [math.ST]
  (or arXiv:2503.06889v1 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2503.06889
arXiv-issued DOI via DataCite

Submission history

From: Tianchen Gao [view email]
[v1] Mon, 10 Mar 2025 03:35:20 UTC (847 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
stat
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math
math.ST
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

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?)
Papers with Code (What is Papers with Code?)
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?)
IArxiv Recommender (What is IArxiv?)
  • 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
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号