Generic network sparsification via hybrid edge sampling

DOI10.1016/J.JFRANKLIN.2024.107404MaRDI QIDQ7031526zbMATH OpenFDO

Authors Zhen Su, J. Kurths, Henning Meyerhenke

Publication date 6 February 2025

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JFRANKLIN.2024.107404

zbMATH Keywords

edge samplinggraph sparsificationhybrid samplingtriads

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Informational aspects of data analysis and big data (94A16)

Cites work

• Arboricity and Subgraph Listing Algorithms
• Better approximation of betweenness centrality
• Edge sampling and graph parameter estimation via vertex neighborhood accesses
• Edge sampling using local network information
• Generic network sparsification via degree- and subgraph-based edge sampling
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• Networks
• On the limiting behavior of parameter-dependent network centrality measures
• Potential games
• Triangle listing algorithms: back from the diversion
• Uncertain Graph Processing through Representative Instances
• Untangling the hairballs of multi-centered, small-world online social media networks

This page was built for publication: Generic network sparsification via hybrid edge sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031526)