Logo eprints

Entropy-based methods for the statistical validation of bipartite networks

Straka, Mika Julian (2018) Entropy-based methods for the statistical validation of bipartite networks. Advisor: Caldarelli, Prof. Guido. Coadvisor: Saracco, Dott. Fabio . pp. 171. [IMT PhD Thesis]

Straka_phdthesis.pdf - Published Version

Download (17MB) | Preview


Bipartite networks provide an insightful representation of many complex systems, ranging from mutualistic species interactions in ecology to financial investment portfolios of banks. In order to unveil genuine properties of real-world structures, statistical comparisons with appropriately defined null models are necessary. Among other frameworks, entropy-based null models have proven to perform satisfactorily in providing benchmarks for testing evidence-based hypotheses, showing the desirable feature that the resulting graph probability distributions are generally unbiased and often analytically tractable. Moreover, applying these models to empirical data permits to reveal “second-order” phenomena by discounting selected topological properties. In this thesis, we present the bipartite exponential random graph formalism and develop a novel method for obtaining unbiased and statistically validated monopartite projections from bipartite networks, the so-called grand canonical projection algorithm. We apply our methods to the social MovieLens database and the International Trade Network, and show that nontrivial communities can be detected in the projections. In particular, in the trade network our approach succeeds in distinguishing between countries of different economic developments and detects a signal of specialization among the general tendency of export diversification. The formalism developed here is general and promises applications in other fields where bipartite structures are present.

Item Type: IMT PhD Thesis
Uncontrolled Keywords: complex networks, null models, exponential random graphs, bipartite networks, network projection, network validation, network filtering, entropy models
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
PhD Course: Complex networks
Identification Number: 10.6092/imtlucca/e-theses/253
NBN Number: urn:nbn:it:imtlucca-27279
Date Deposited: 12 Sep 2018 07:59
URI: http://e-theses.imtlucca.it/id/eprint/253

Actions (login required, only for staff repository)

View Item View Item