Efficient Community Re-creation in Multilayer Networks Using Boolean Operations

Abhishek Santra, Sanjukta Bhowmick, Sharma Chakravarthy

Research output: Contribution to journalConference article

4 Citations (Scopus)

Abstract

Networks are useful mathematical representations of systems of interrelated entities. In cases where the entities can be related via different factors, the models can be extended to form networks of networks or multilayer networks. However, analyzing multilayer networks can get increasingly more expensive as the number of layers increase. We address the problem of efficiently finding communities in multilayer networks. Communities are groups of tightly connected entities that indicate that entities in the group are similar. Here we demonstrate that given certain easily verifiable structural conditions, which we term as self preserving communities, we can use fundamental Boolean operations to combine the communities obtained from each network layer to obtain the communities over the entire multilayer network. Our approach, when applied to real-world datasets such as traffic accidents, shows that we can reduce the time to find communities in multilayer networks by over 40%. Our proposed technique makes several important contributions to the nascent area of multilayer networks. We present an elegant and low-cost method to combine results from multiple layers, without recomputing the combined layers. Our method also makes it easier to add and process new information at individual layers. Together, our approach addresses both the variety aspect of big data by handling multiple data types as well as the volume aspect by enabling fast analysis of data from multiple networks.

Original languageEnglish (US)
Pages (from-to)58-67
Number of pages10
JournalProcedia Computer Science
Volume108
DOIs
StatePublished - Jan 1 2017
EventInternational Conference on Computational Science ICCS 2017 - Zurich, Switzerland
Duration: Jun 12 2017Jun 14 2017

Fingerprint

Multilayers
Highway accidents
Network layers
Costs

Keywords

  • Graph analysis
  • Lossless composability
  • Multilayer network

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Efficient Community Re-creation in Multilayer Networks Using Boolean Operations. / Santra, Abhishek; Bhowmick, Sanjukta; Chakravarthy, Sharma.

In: Procedia Computer Science, Vol. 108, 01.01.2017, p. 58-67.

Research output: Contribution to journalConference article

@article{07b13f2784964c059303ee3ba15c6e6c,
title = "Efficient Community Re-creation in Multilayer Networks Using Boolean Operations",
abstract = "Networks are useful mathematical representations of systems of interrelated entities. In cases where the entities can be related via different factors, the models can be extended to form networks of networks or multilayer networks. However, analyzing multilayer networks can get increasingly more expensive as the number of layers increase. We address the problem of efficiently finding communities in multilayer networks. Communities are groups of tightly connected entities that indicate that entities in the group are similar. Here we demonstrate that given certain easily verifiable structural conditions, which we term as self preserving communities, we can use fundamental Boolean operations to combine the communities obtained from each network layer to obtain the communities over the entire multilayer network. Our approach, when applied to real-world datasets such as traffic accidents, shows that we can reduce the time to find communities in multilayer networks by over 40{\%}. Our proposed technique makes several important contributions to the nascent area of multilayer networks. We present an elegant and low-cost method to combine results from multiple layers, without recomputing the combined layers. Our method also makes it easier to add and process new information at individual layers. Together, our approach addresses both the variety aspect of big data by handling multiple data types as well as the volume aspect by enabling fast analysis of data from multiple networks.",
keywords = "Graph analysis, Lossless composability, Multilayer network",
author = "Abhishek Santra and Sanjukta Bhowmick and Sharma Chakravarthy",
year = "2017",
month = "1",
day = "1",
doi = "10.1016/j.procs.2017.05.246",
language = "English (US)",
volume = "108",
pages = "58--67",
journal = "Procedia Computer Science",
issn = "1877-0509",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Efficient Community Re-creation in Multilayer Networks Using Boolean Operations

AU - Santra, Abhishek

AU - Bhowmick, Sanjukta

AU - Chakravarthy, Sharma

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Networks are useful mathematical representations of systems of interrelated entities. In cases where the entities can be related via different factors, the models can be extended to form networks of networks or multilayer networks. However, analyzing multilayer networks can get increasingly more expensive as the number of layers increase. We address the problem of efficiently finding communities in multilayer networks. Communities are groups of tightly connected entities that indicate that entities in the group are similar. Here we demonstrate that given certain easily verifiable structural conditions, which we term as self preserving communities, we can use fundamental Boolean operations to combine the communities obtained from each network layer to obtain the communities over the entire multilayer network. Our approach, when applied to real-world datasets such as traffic accidents, shows that we can reduce the time to find communities in multilayer networks by over 40%. Our proposed technique makes several important contributions to the nascent area of multilayer networks. We present an elegant and low-cost method to combine results from multiple layers, without recomputing the combined layers. Our method also makes it easier to add and process new information at individual layers. Together, our approach addresses both the variety aspect of big data by handling multiple data types as well as the volume aspect by enabling fast analysis of data from multiple networks.

AB - Networks are useful mathematical representations of systems of interrelated entities. In cases where the entities can be related via different factors, the models can be extended to form networks of networks or multilayer networks. However, analyzing multilayer networks can get increasingly more expensive as the number of layers increase. We address the problem of efficiently finding communities in multilayer networks. Communities are groups of tightly connected entities that indicate that entities in the group are similar. Here we demonstrate that given certain easily verifiable structural conditions, which we term as self preserving communities, we can use fundamental Boolean operations to combine the communities obtained from each network layer to obtain the communities over the entire multilayer network. Our approach, when applied to real-world datasets such as traffic accidents, shows that we can reduce the time to find communities in multilayer networks by over 40%. Our proposed technique makes several important contributions to the nascent area of multilayer networks. We present an elegant and low-cost method to combine results from multiple layers, without recomputing the combined layers. Our method also makes it easier to add and process new information at individual layers. Together, our approach addresses both the variety aspect of big data by handling multiple data types as well as the volume aspect by enabling fast analysis of data from multiple networks.

KW - Graph analysis

KW - Lossless composability

KW - Multilayer network

UR - http://www.scopus.com/inward/record.url?scp=85027300206&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027300206&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2017.05.246

DO - 10.1016/j.procs.2017.05.246

M3 - Conference article

AN - SCOPUS:85027300206

VL - 108

SP - 58

EP - 67

JO - Procedia Computer Science

JF - Procedia Computer Science

SN - 1877-0509

ER -