IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v444y2016icp360-372.html
   My bibliography  Save this article

Summarizing scale-free networks based on virtual and real links

Author

Listed:
  • Bei, Yijun
  • Lin, Zhen
  • Chen, Deren

Abstract

Techniques to summarize and cluster graphs are indispensable to understand the internal characteristics of large complex networks. However, existing methods that analyze graphs mainly focus on aggregating strong-interaction vertices into the same group without considering the node properties, particularly multi-valued attributes. This study aims to develop a unified framework based on the concept of a virtual graph by integrating attributes and structural similarities. We propose a summarizing graph based on virtual and real links (SGVR) approach to aggregate similar nodes in a scale-free graph into k non-overlapping groups based on user-selected attributes considering both virtual links (attributes) and real links (graph structures). An effective data structure called HB-Graph is adopted to adjust the subgroups and optimize the grouping results. Extensive experiments are carried out on actual and synthetic datasets. Results indicate that our proposed method is both effective and efficient.

Suggested Citation

  • Bei, Yijun & Lin, Zhen & Chen, Deren, 2016. "Summarizing scale-free networks based on virtual and real links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 360-372.
    • Handle: RePEc:eee:phsmap:v:444:y:2016:i:c:p:360-372
    DOI: 10.1016/j.physa.2015.08.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711500713X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2015.08.048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rikus Styger & Kenneth R. Uren & George van Schoor, 2023. "Graph Complexity Reduction of Exergy-Based FDI—A Tennessee Eastman Process Case Study," Energies, MDPI, vol. 16(16), pages 1-16, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:444:y:2016:i:c:p:360-372. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.