Scribd Logo
Upload

Welcome to Scribd!

  • SM2

    Uploaded by

    bollarapu phanindra
    9 views17 pages
    The document provides results from analyzing a network using different algorithms and metrics. It finds there are 268 weakly connected components and 688 strongly connected components. Community detection using statistical inference finds 712 communities with a description length of 84898.172. Modularity optimization finds 278 communities with a modularity of 0.427. Other metrics reported include average clustering coefficient of 0.172 and results of eigenvector centrality analysis.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides results from analyzing a network using different algorithms and metrics. It finds there are 268 weakly connected components and 688 strongly connected components. Community detection using statistical inference finds 712 communities with a description length of 84898.172. Modularity optimization finds 278 communities with a modularity of 0.427. Other metrics reported include average clustering coefficient of 0.172 and results of eigenvector centrality analysis.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views17 pages

    SM2

    Uploaded by

    bollarapu phanindra
    The document provides results from analyzing a network using different algorithms and metrics. It finds there are 268 weakly connected components and 688 strongly connected components. Community detection using statistical inference finds 712 communities with a description length of 84898.172. Modularity optimization finds 278 communities with a modularity of 0.427. Other metrics reported include average clustering coefficient of 0.172 and results of eigenvector centrality analysis.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 17

    2) Visualisation of the Network

    

    

    

    

    

    Connected Components Report

    Parameters:
    Network Interpretation: directed

    Results:
    Number of Weakly Connected Components: 268
    Number of Strongly Connected Components: 688

    Algorithm:
    Robert Tarjan, Depth-First Search and Linear Graph Algorithms, in SIAM Journal on
    Computing 1 (2): 146–160 (1972)
    Statistical Inference Report

    Results:
    Description Length: 84898.172
    Number of Communities: 712

    Algorithm:
    Statistical inference of assortative community structures
    Lizhi Zhang, Tiago P. Peixoto
    Phys. Rev. Research 2 043271 (2020)
    https://dx.doi.org/10.1103/PhysRevResearch.2.043271

    Bayesian stochastic blockmodeling


    Tiago P. Peixoto
    Chapter in “Advances in Network Clustering and Blockmodeling,†edited by
    P. Doreian, V. Batagelj, A. Ferligoj (Wiley, 2019)
    https://dx.doi.org/10.1002/9781119483298.ch11
    Modularity Report
    Parameters:
    Randomize: On
    Use edge weights: On
    Resolution: 1.0

    Results:
    Modularity: 0.427
    Modularity with resolution: 0.427
    Number of Communities: 278
    Clustering Coef cient Metric Report

    Parameters:
    Network Interpretation: directed

    Results:
    Average Clustering Coef cient: 0.172
    The Average Clustering Coef cient is the mean value of individual coef cients.

    Algorithm:
    Simple and slow brute force.
    fi
    fi
    fi
    fi
    Eigenvector Centrality Report

    Parameters:
    Network Interpretation: directed
    Number of iterations: 100
    Sum change: 0.055072321441176665
    Results:

    

    

    7) Partition
    

    8)Manipulation:
    9)Preview the Graph

    You might also like