Corpus ID: 12908542

Irreducible network backbones: unbiased graph filtering via maximum entropy

@article{Gemmetto2017IrreducibleNB,
  title={Irreducible network backbones: unbiased graph filtering via maximum entropy},
  author={Valerio Gemmetto and Alessio Cardillo and Diego Garlaschelli},
  journal={ArXiv},
  year={2017},
  volume={abs/1706.00230}
}
Networks provide an informative, yet non-redundant description of complex systems only if links represent truly dyadic relationships that cannot be directly traced back to node-specific properties such as size, importance, or coordinates in some embedding space. In any real-world network, some links may be reducible, and others irreducible, to such local properties. This dichotomy persists despite the steady increase in data availability and resolution, which actually determines an even… Expand
Extracting the signed backbone of intrinsically dense weighted networks
TLDR
The first methods for extracting signed network backbones from intrinsically dense unsigned weighted networks are provided using a null model based on statistical techniques and the proposed significance filter and vigor filter allow inferring edge signs. Expand
A Pólya urn approach to information filtering in complex networks
TLDR
A filtering methodology inspired by the Pólya urn is proposed, a combinatorial model driven by a self-reinforcement mechanism, which relies on a family of null hypotheses that can be calibrated to assess which links are statistically significant with respect to a given network’s own heterogeneity. Expand
The structured backbone of temporal social ties
TLDR
This work develops a method for filtering temporal network data, by defining an adequate temporal null model that allows us to identify pairs of nodes having more interactions than expected given their activities: the significant ties. Expand
The Backbone Network of Dynamic Functional Connectivity : 2
Temporal networks have become increasingly pervasive in many real-world applications, including the 8 functional connectivity analysis of spatially separated regions of the brain. A major challengeExpand
Detecting informative higher-order interactions in statistically validated hypergraphs
TLDR
This work proposes an analytic approach to filter hypergraphs by identifying those hyperlinks that are over-expressed with respect to a random null hypothesis, and represent the most relevant higher-order connections. Expand
The Backbone Network of Dynamic Functional Connectivity
TLDR
This work proposes a data-driven procedure to reveal the irreducible ties in dynamic functional connectivity of resting state fRMI data with continuous weights that includes a null model that estimates the latent characteristics of the distributions of temporal links through optimization, followed by a statistical test to filter the links whose formation can be reduced to the activities and local properties of their interacting nodes. Expand
From Relational Data to Graphs: Inferring Significant Links Using Generalized Hypergeometric Ensembles
TLDR
A new statistical modeling framework is proposed that builds on generalized hypergeometric ensembles, a class of generative stochastic models that give rise to analytically tractable probability spaces of directed, multi-edge graphs that can be used to assess the significance of links in noisy relational data. Expand
A primer on statistically validated networks
TLDR
This contribution discusses how statistically validated networks can be used to pre-process large sets of data and detect cores of communities that are forming the most close-knit and stable subsets of clusters of nodes present in a complex system. Expand
Consensus Community Detection in Multilayer Networks using Parameter-free Graph Pruning
TLDR
Experimental evidence on real-world networks confirms the beneficial effect of using model-based filtering methods and also shows the superiority of the proposed method on state-of-the-art multilayer community detection. Expand
Improving the Performance of an Integer Linear Programming Community Detection Algorithm Through Clique Filtering
TLDR
A novel network size reduction technique based on a clique filtering approach to reduce the network size and speed up the community detection process, and preserve the modularity of the original partition in the context of the exact model is proposed. Expand
...
1
2
...

References

SHOWING 1-10 OF 53 REFERENCES
Estimating topological properties of weighted networks from limited information
TLDR
This work develops a reconstruction method, based on statistical mechanics concepts, that makes use of the empirical link density in a highly nontrivial way and represents a valuable tool for gaining insights on privacy-protected or partially accessible systems. Expand
Analytical maximum-likelihood method to detect patterns in real networks
TLDR
The method reveals that the null behavior of various correlation properties is different from what previously believed, and highly sensitive to the particular network considered, and shows that important structural properties are currently based on incorrect expressions and provides the exact quantities that should replace them. Expand
Enhanced reconstruction of weighted networks from strengths and degrees
TLDR
This work introduces an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples, and shows that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Expand
Unwinding the "hairball" graph: a pruning algorithm for weighted complex networks
TLDR
This work introduces a simple and intuitive null model related to the configuration model of network generation and derive two significance filters from it, and applies these filters to the network of air traffic volume between US airports and recovers a geographically faithful representation of the graph. Expand
Network reconstruction via density sampling
TLDR
The core technique for reconstructing both the topology and the link weights of the unknown network in detail is introduced and achieves a remarkable accuracy and is very robust with respect to the sampled subsets, thus representing a reliable practical tool whenever the available topological information is restricted to small portions of nodes. Expand
Network Backboning with Noisy Data
  • M. Coscia, F. Neffke
  • Computer Science, Physics
  • 2017 IEEE 33rd International Conference on Data Engineering (ICDE)
  • 2017
TLDR
This work describes a new approach to extract network backbones by using a more realistic null model for the edge weight creation process than prior work, and simultaneously considers the propensity of nodes to send and receive connections, whereas previous approaches only considered nodes as emitters of edges. Expand
Unbiased sampling of network ensembles
TLDR
A 'Maximize and Sample' ('Max & Sam' for short) method to correctly sample ensembles of networks where the constraints are 'soft', i.e. realized as ensemble averages, which is based on exact maximum-entropy distributions and is therefore unbiased by construction, even for strongly heterogeneous networks. Expand
Maximum likelihood: extracting unbiased information from complex networks.
TLDR
This work shows that the maximum likelihood (ML) principle indicates a unique, statistically rigorous parameter choice, associated with a well-defined topological feature, and builds a class of safely unbiased models to overcome this problem. Expand
Information filtering in complex weighted networks
TLDR
A weight-filtering technique based on a global null model [Global Statistical Significance (GloSS) filter], keeping both the weight distribution and the full topological structure of the network. Expand
Structure-preserving sparsification methods for social networks
TLDR
The first systematic conceptual and experimental comparison of edge sparsification methods on a diverse set of network properties is contributed and it is shown that they can be understood as methods for rating edges by importance and then filtering globally or locally by these scores. Expand
...
1
2
3
4
5
...