Analysis of large sparse graphs using regular decomposition of graph distance matrices

Hannu Reittu, Lasse Leskelä, Marco Fiorucci, Tomi Räty

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    1 Citation (Scopus)
    27 Downloads (Pure)

    Abstract

    Statistical analysis of large and sparse graphs is a challenging problem in data science due to the high dimensionality and nonlinearity of the problem. This paper presents a fast and scalable algorithm for partitioning such graphs into disjoint groups based on observed graph distances from a set of reference nodes. The resulting partition provides a low-dimensional approximation of the full distance matrix which helps to reveal global structural properties of the graph using only small samples of the distance matrix. The presented algorithm is inspired by the information-theoretic minimum description principle. We investigate the performance of this algorithm for selected real data sets and for synthetic graph data sets generated using stochastic block models and power-law random graphs, together with analytical considerations for sparse stochastic block models with bounded average degrees.
    Original languageEnglish
    Title of host publication2018 IEEE International Conference on Big Data (Big Data)
    PublisherIEEE Institute of Electrical and Electronic Engineers
    Pages3784-3792
    ISBN (Electronic)978-1-5386-5035-6
    ISBN (Print)978-1-5386-5036-3, 978-1-5386-5034-9
    DOIs
    Publication statusPublished - 22 Jan 2019
    MoE publication typeA4 Article in a conference publication
    EventAdvances in High Dimensional Big Data: Workshop in conjunction with the 2018 IEEE International Conference on Big Data (IEEE Big Data 2018) - Seattle, United States
    Duration: 10 Dec 201813 Dec 2018

    Workshop

    WorkshopAdvances in High Dimensional Big Data
    CountryUnited States
    CitySeattle
    Period10/12/1813/12/18

    Keywords

    • graph theory
    • statistical analysis
    • Big Data
    • peer-to-peer computing
    • partitioning
    • approximation algorithms
    • stochastic processes

    Fingerprint Dive into the research topics of 'Analysis of large sparse graphs using regular decomposition of graph distance matrices'. Together they form a unique fingerprint.

  • Cite this

    Reittu, H., Leskelä, L., Fiorucci, M., & Räty, T. (2019). Analysis of large sparse graphs using regular decomposition of graph distance matrices. In 2018 IEEE International Conference on Big Data (Big Data) (pp. 3784-3792). [8622118] IEEE Institute of Electrical and Electronic Engineers. https://doi.org/10.1109/BigData.2018.8622118