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 > cs > arXiv:2509.13230

Help | Advanced Search

Computer Science > Social and Information Networks

arXiv:2509.13230 (cs)
[Submitted on 16 Sep 2025 (v1) , last revised 18 Sep 2025 (this version, v3)]

Title: Fast Unbiased Sampling of Networks with Given Expected Degrees and Strengths

Title: 快速无偏网络采样具有给定期望度和强度

Authors:Xuanchi Li, Xin Wang, Sadamori Kojaku
Abstract: The configuration model is a cornerstone of statistical assessment of network structure. While the Chung-Lu model is among the most widely used configuration models, it systematically oversamples edges between large-degree nodes, leading to inaccurate statistical conclusions. Although the maximum entropy principle offers unbiased configuration models, its high computational cost has hindered widespread adoption, making the Chung-Lu model an inaccurate yet persistently practical choice. Here, we propose fast and efficient sampling algorithms for the max-entropy-based models by adapting the Miller-Hagberg algorithm. Evaluation on 103 empirical networks demonstrates 10-1000 times speedup, making theoretically rigorous configuration models practical and contributing to a more accurate understanding of network structure.
Abstract: 配置模型是统计评估网络结构的基石。 尽管 Chung-Lu 模型是最常用的配置模型之一,但它会系统性地过度采样大度数节点之间的边,导致统计结论不准确。 虽然最大熵原理提供了无偏的配置模型,但其高昂的计算成本阻碍了广泛应用,使得 Chung-Lu 模型成为一个不准确但持续实用的选择。 在这里,我们通过适应 Miller-Hagberg 算法,提出了基于最大熵的模型的快速高效采样算法。 在 103 个经验网络上的评估表明,速度提高了 10 到 1000 倍,使理论严谨的配置模型变得实用,并有助于更准确地理解网络结构。
Subjects: Social and Information Networks (cs.SI) ; Physics and Society (physics.soc-ph)
Cite as: arXiv:2509.13230 [cs.SI]
  (or arXiv:2509.13230v3 [cs.SI] for this version)
  https://doi.org/10.48550/arXiv.2509.13230
arXiv-issued DOI via DataCite

Submission history

From: Xuanchi Li [view email]
[v1] Tue, 16 Sep 2025 16:38:23 UTC (1,040 KB)
[v2] Wed, 17 Sep 2025 01:10:25 UTC (1,041 KB)
[v3] Thu, 18 Sep 2025 13:57:51 UTC (1,041 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.SI
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
physics
physics.soc-ph

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号