pith. sign in

arxiv: 1303.4986 · v1 · pith:GH3DVIZTnew · submitted 2013-03-20 · 💻 cs.SI · physics.soc-ph

Combinatorial Analysis of Multiple Networks

classification 💻 cs.SI physics.soc-ph
keywords analysisdatanetworksnetworkreferencetoolsavailabilitycomplex
0
0 comments X
read the original abstract

The study of complex networks has been historically based on simple graph data models representing relationships between individuals. However, often reality cannot be accurately captured by a flat graph model. This has led to the development of multi-layer networks. These models have the potential of becoming the reference tools in network data analysis, but require the parallel development of specific analysis methods explicitly exploiting the information hidden in-between the layers and the availability of a critical mass of reference data to experiment with the tools and investigate the real-world organization of these complex systems. In this work we introduce a real-world layered network combining different kinds of online and offline relationships, and present an innovative methodology and related analysis tools suggesting the existence of hidden motifs traversing and correlating different representation layers. We also introduce a notion of betweenness centrality for multiple networks. While some preliminary experimental evidence is reported, our hypotheses are still largely unverified, and in our opinion this calls for the availability of new analysis methods but also new reference multi-layer social network data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Evaluating Encodings for Bivariate Edges in Adjacency Matrices

    cs.HC 2026-04 unverdicted novelty 6.0

    Embedded bar charts and area-overlaid marks outperform bivariate color and angle-based marks for reading distributions of edge values in adjacency matrices.

  2. Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure

    cs.SI 2024-09 unverdicted novelty 6.0

    Defines multilayer STC and STC+ problems with 2- and 6-approximation algorithms for consistent tie-strength labeling in multilayer networks.