Core of communities in bipartite networks

@article{Bongiorno2017CoreOC,
  title={Core of communities in bipartite networks},
  author={Christian Bongiorno and Andr{\'a}s London and Salvatore Miccich{\`e} and Rosario N. Mantegna},
  journal={Physical review. E},
  year={2017},
  volume={96 2-1},
  pages={
          022321
        }
}
We use the information present in a bipartite network to detect cores of communities of each set of the bipartite system. Cores of communities are found by investigating statistically validated projected networks obtained using information present in the bipartite network. Cores of communities are highly informative and robust with respect to the presence of errors or missing entries in the bipartite network. We assess the statistical robustness of cores by investigating an artificial benchmark… 

Figures and Tables from this paper

Is it correct to project and detect? How weighting unipartite projections influences community detection

It is concluded that any interpretation of community detection algorithm performance on projected networks must be done with care as certain network configurations require strong community preference for the bipartite structure to be reflected in the unipartite communities.

Is it Correct to Project and Detect? Assessing Performance of Community Detection on Unipartite Projections of Bipartite Networks

This work applies a simple model to generate bipartite networks with prescribed community structure and test the performance of community detection using four different unipartite projection schemes, finding that a "hyperbolic" projection scheme mitigates performance issues to some extent.

On Unveiling the Community Structure of Temporal Networks

This paper proposes a general and flexible model for temporal networks, based on the activity-driven network paradigm, which is capable of modeling both the temporal evolution of the system and the presence of a hierarchical, overlapping, and heterogeneous community structure, and develops a community detection algorithm.

Meta-validation of bipartite network projections

A meta-validation approach is proposed that allows to identify model-specific significance thresholds for which the signal is strongest, and at the same time to obtain results independent of the way in which the null hypothesis is formulated.

Detecting network backbones against time variations in node properties

It is shown that neglecting time variations in node-specific properties may beget false positives in the inference of the network backbone, and the viability of the proposed approach to aid in the discovery of network backbones from time series is demonstrated.

Reconstructing irreducible links in temporal networks: which tool to choose depends on the network size

This work examines the performance of three approaches for the discovery of backbone networks, in the presence of heterogeneous, time-varying node properties, and proposes general guidelines for the use of these three approaches based on the available dataset.

Detecting mesoscale structures by surprise

This study presents a statistically validated method for mesoscale structures detection based upon the score function called ‘surprise’, and attaches to the paper a Python code implementing all variants of surprise discussed in the present manuscript.

Backbone reconstruction in temporal networks from epidemic data

This work proposes a statistically-principled algorithm to reconstruct the backbone of strong ties from data of a spreading process, consisting of the time series of individuals' states, and proposes the integration of this algorithm in a targeted immunization strategy that prioritizes influential nodes in the inferred backbone.

Bootstrap validation of links of a minimum spanning tree

Complex network models, graph mining and information extraction from real-world systems

The goal of this dissertation is to present the Author's work which focusing on the development and application of network models and graph mining tools for real-world problems.

References

SHOWING 1-10 OF 20 REFERENCES

Networks: An Introduction

This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.

What is network science?

The first few pages of the first issue of Network Science, the new journal created because network science is exploding, share their own vision of the emerging science of networks.

Journal of the Royal Statistical Society Notes on the Submission of Papers

Authors of material submitted to the Journal of the Royal Statistical Society are asked to disclose any financial or other interest that may be relevant and/or would prove an embarrassment if it were to emerge after publication and they had not declared it.

Quantitative Finance

Quantitative Finance: An Object-Oriented approach in C++ provides readers with a foundation in the key methods and models of quantitative finance and helps readers implement models in a trading or research environment.

JOURNAL OF CLINICAL MICROBIOLOGY

  • Geology
    Journal of Clinical Microbiology
  • 2011
Limit the abstract to 250 words or fewer and concisely summarize the basic content of the paper without presenting extensive experimental details. Avoid abbreviations and references, and do not

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES.

It is shown that the full set of hydromagnetic equations admit five more integrals, besides the energy integral, if dissipative processes are absent, which made it possible to formulate a variational principle for the force-free magnetic fields.

Journal Of The American Statistical Association V-28

Journal of Statistical Mechanics: theory and experiment

Physics Reports

  • Education