Finding lasting dense subgraphs

Graphs form a natural model for relationships and interactions between entities, for example, between people in social and cooperation networks, servers in computer networks, or tags and words in documents and tweets. But, which of these relationships or interactions are the most lasting ones? In this paper, we study the following problem: given a set of graph snapshots, which may correspond to the state of an evolving graph at different time instances, identify the set of nodes that are the most densely connected in all snapshots. We call this problem the Best Friends Forever ($$\text {BFF}$$BFF) problem. We provide definitions for density over multiple graph snapshots, that capture different semantics of connectedness over time, and we study the corresponding variants of the $$\text {BFF}$$BFF problem. We then look at the On–Off$$\text {BFF}$$BFF ($$\textsc {O}^{\textsc {2}}\text {BFF}$$O2BFF) problem that relaxes the requirement of nodes being connected in all snapshots, and asks for the densest set of nodes in at least k of a given set of graph snapshots. We show that this problem is NP-complete for all definitions of density, and we propose a set of efficient algorithms. Finally, we present experiments with synthetic and real datasets that show both the efficiency of our algorithms and the usefulness of the $$\text {BFF}$$BFF and the $$\textsc {O}^{\textsc {2}}\text {BFF}$$O2BFF problems.

[1]  Shuai Ma,et al.  Fast Computation of Dense Temporal Subgraphs , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[2]  Alessandro Vespignani,et al.  Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.

[3]  Ananthram Swami,et al.  Discovery of “comet” communities in temporal and labeled graphs Com$$^2$$2  , 2015, Knowledge and Information Systems.

[4]  Charalampos E. Tsourakakis,et al.  Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees , 2013, KDD.

[5]  Aristides Gionis,et al.  Discovering Dynamic Communities in Interaction Networks , 2014, ECML/PKDD.

[6]  Evaggelia Pitoura,et al.  Top-k Durable Graph Pattern Queries on Temporal Graphs , 2019, IEEE Trans. Knowl. Data Eng..

[7]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[8]  Silvio Lattanzi,et al.  Efficient Densest Subgraph Computation in Evolving Graphs , 2015, WWW.

[9]  Reynold Cheng,et al.  On querying historical evolving graph sequences , 2011, Proc. VLDB Endow..

[10]  Evaggelia Pitoura,et al.  Topic Detection Using a Critical Term Graph on News-Related Tweets , 2015, EDBT/ICDT Workshops.

[11]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[12]  Evaggelia Pitoura,et al.  TimeReach: Historical Reachability Queries on Evolving Graphs , 2015, EDBT.

[13]  Julia Stoyanovich,et al.  Towards a Distributed Infrastructure for Evolving Graph Analytics , 2016, WWW.

[14]  Sergei Vassilvitskii,et al.  Densest Subgraph in Streaming and MapReduce , 2012, Proc. VLDB Endow..

[15]  Udayan Khurana,et al.  Efficient snapshot retrieval over historical graph data , 2012, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[16]  Charalampos E. Tsourakakis,et al.  Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams , 2015, STOC.

[17]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 2000, J. Algorithms.

[18]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[19]  Samir Khuller,et al.  On Finding Dense Subgraphs , 2009, ICALP.

[20]  Illya V. Hicks,et al.  Combinatorial algorithms for the maximum k-plex problem , 2012, J. Comb. Optim..

[21]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.

[22]  Evaggelia Pitoura,et al.  Historical Traversals in Native Graph Databases , 2017, ADBIS.

[23]  Myra Spiliopoulou,et al.  Evolution in Social Networks: A Survey , 2011, Social Network Data Analytics.

[24]  Ambuj K. Singh,et al.  Mining Heavy Subgraphs in Time-Evolving Networks , 2011, 2011 IEEE 11th International Conference on Data Mining.

[25]  Gilbert Laporte,et al.  An exact algorithm for the maximum k-club problem in an undirected graph , 1999, Eur. J. Oper. Res..

[26]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[27]  Niko Beerenwinkel,et al.  Finding Dense Subgraphs in Relational Graphs , 2015, ECML/PKDD.

[28]  Jean-François Boulicaut,et al.  Discovering descriptive rules in relational dynamic graphs , 2013, Intell. Data Anal..

[29]  Aristides Gionis,et al.  The community-search problem and how to plan a successful cocktail party , 2010, KDD.

[30]  Evaggelia Pitoura,et al.  Best Friends Forever (BFF): Finding Lasting Dense Subgraphs , 2016, ArXiv.

[31]  Aristides Gionis,et al.  Finding Dynamic Dense Subgraphs , 2017, ACM Trans. Knowl. Discov. Data.

[32]  Jean-François Boulicaut,et al.  Multidimensional Association Rules in Boolean Tensors , 2011, SDM.

[33]  Jean-François Boulicaut,et al.  Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations , 2008, SDM.

[34]  Evaggelia Pitoura,et al.  Durable graph pattern queries on historical graphs , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).