The reviewed record of science sign in
Pith

arxiv: 1908.03875 · v2 · pith:SSX2BNSW · submitted 2019-08-11 · cs.SI · math.CO· physics.data-an· physics.soc-ph· stat.ML

Inference of Edge Correlations in Multilayer Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SSX2BNSWrecord.jsonopen to challenge →

classification cs.SI math.COphysics.data-anphysics.soc-phstat.ML
keywords multilayernetworksedgecorrelationsmodelsassumptioncommunitydifferent
0
0 comments X
read the original abstract

Many recent developments in network analysis have focused on multilayer networks, which one can use to encode time-dependent interactions, multiple types of interactions, and other complications that arise in complex systems. Like their monolayer counterparts, multilayer networks in applications often have mesoscale features, such as community structure. A prominent type of method for inferring such structures is the employment of multilayer stochastic block models (SBMs). A common (but {potentially} inadequate) assumption of these models is the sampling of edges in different layers independently, conditioned on the community labels of the nodes. In this paper, we relax this assumption of independence by incorporating edge correlations into an SBM-like model. We derive maximum-likelihood estimates of the key parameters of our model, and we propose a measure of layer correlation that reflects the similarity between connectivity patterns in different layers. Finally, we explain how to use correlated models for edge "prediction" (i.e., inference) in multilayer networks. By taking into account edge correlations, prediction accuracy improves both in synthetic networks and in a temporal network of shoppers who are connected to previously-purchased grocery products.

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.