Weighted projected networks: mapping hypergraphs to networks

Abstract

Many natural, technological, and social systems incorporate multiway interactions, yet are characterized and measured on the basis of weighted pairwise interactions. In this article, I propose a family of models in which pairwise interactions originate from multiway interactions, by starting from ensembles of hypergraphs and applying projections that generate ensembles of weighted projected networks. I calculate analytically the statistical properties of weighted projected networks, and suggest ways these could be used beyond theoretical studies. Weighted projected networks typically exhibit weight disorder along links even for very simple generating hypergraph ensembles. Also, as the size of a hypergraph changes, a signature of multiway interaction emerges on the link weights of weighted projected networks that distinguishes them from fundamentally weighted pairwise networks. This signature could be used to search for hidden multiway interactions in weighted network data. I find the percolation threshold and size of the largest component for hypergraphs of arbitrary uniform rank, translate the results into projected networks, and show that the transition is second order. This general approach to network formation has the potential to shed new light on our understanding of weighted networks.

4 figures. 3 tables. 28 pages. Expanded discussion about application

References in corpus (9)

• Community detection in graphs
• Structure and tie strengths in mobile communication networks
• Prediction and predictability of global epidemics: the role of the airline transportation network
• Random graphs with clustering
• Random hypergraphs and their applications
• Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs
• Modeling temporal networks using random itineraries
• Percolation transition in correlated hypergraphs
• Percolation transition and distribution of connected components in generalized random network ensembles

Cited by in corpus (3)

• The nature of hypergraph $k$-core percolation problems
• The distribution of the number of node neighbors in random hypergraphs
• Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs