Chenhao Ma
Laks V.S. Lakshmanan
Abstract
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is fundamental to a wide range of applications, such as fraud detection, community mining, and graph compression. However, existing DDS solutions suffer from efficiency and scalability problems: on a threethousand- edge graph, it takes three days for one of the best exact algorithms to complete. In this paper, we develop an efficient and scalable DDS solution. We introduce the notion of [x, y]-core, which is a dense subgraph for G, and show that the densest subgraph can be accurately located through the [x, y]-core with theoretical guarantees. Based on the [x, y]-core, we develop both exact and approximation algorithms. We have performed an extensive evaluation of our approaches on eight real large datasets. The results show that our proposed solutions are up to six orders of magnitude faster than the state-of-the-art.
- R. Albert, H. Jeong, and A.-L. Barab´asi. Internet: Diameter of the world-wide web. nature, 401(6749):130, 1999.Google Scholar
- B. Bahmani, R. Kumar, and S. Vassilvitskii. Densest subgraph in streaming and mapreduce. PVLDB, 5(5):454--465, 2012. Google ScholarDigital Library
- V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. 2003.Google Scholar
- A. Capocci, V. D. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Caldarelli. Preferential attachment in the growth of social networks: The internet encyclopedia wikipedia. Physical Review E, 74(3):036116, 2006.Google ScholarCross Ref
- M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX, pages 84--95. Springer, 2000. Google ScholarDigital Library
- M. Danisch, T.-H. H. Chan, and M. Sozio. Large scale density-friendly graph decomposition via convex programming. In WWW, pages 233--242, 2017. Google ScholarDigital Library
- Y. Fang, K. Yu, R. Cheng, L. V. Lakshmanan, and X. Lin. Efficient algorithms for densest subgraph discovery. PVLDB, 12(11):1719 -- 1732, 2019. Google ScholarDigital Library
- A. Gionis and C. E. Tsourakakis. Dense subgraph discovery: Kdd 2015 tutorial. In KDD, pages 2313--2314, 2015. Google ScholarDigital Library
- A. V. Goldberg. Finding a maximum density subgraph. University of California Berkeley, CA, 1984. Google ScholarDigital Library
- G. Heineman, G. Pollice, and S. Selkow. Network flow algorithms. algorithms in a nutshell, 2008. Google ScholarDigital Library
- B. Hooi, H. A. Song, A. Beutel, N. Shah, K. Shin, and C. Faloutsos. Fraudar: Bounding graph fraud in the face of camouflage. In KDD, pages 895--904, 2016. Google ScholarDigital Library
- A. Java, X. Song, T. Finin, and B. Tseng. Why we twitter: understanding microblogging usage and communities. In WebKDD, pages 56--65, 2007. Google ScholarDigital Library
- R. Kannan and V. Vinay. Analyzing the structure of large graphs. University of Bonn, 1999.Google Scholar
- S. Khuller and B. Saha. On finding dense subgraphs. In ICALP, pages 597--608. Springer, 2009. Google ScholarDigital Library
- J. M. Kleinberg. Authoritative sources in a hyperlinked environment. JACM, 46(5):604--632, 1999. Google ScholarDigital Library
- J. Kunegis. KONECT -- The Koblenz Network Collection. In WWW, pages 1343--1350, 2013. Google ScholarDigital Library
- C. Ma, R. Cheng, L. V. Lakshmanan, T. Grubenmann, Y. Fang, and X. Li. Linc: a motif counting algorithm for uncertain graphs. PVLDB, 13(2):155--168, 2019. Google ScholarDigital Library
- C. Ma, Y. Fang, R. Cheng, L. V. Lakshmanan, W. Zhang, and X. Lin. Efficient algorithms for densest subgraph discovery on large directed graphs. In SIGMOD, pages 1051--1066, 2020. Google ScholarDigital Library
- J. B. Orlin. Max flows in o (nm) time, or better. In STOC, pages 765--774, 2013. Google ScholarDigital Library
- B. A. Prakash, A. Sridharan, M. Seshadri, S. Machiraju, and C. Faloutsos. Eigenspokes: Surprising patterns and scalable community chipping in large graphs. In PAKDD, pages 435--448, 2010. Google ScholarDigital Library
- S. Sawlani and J. Wang. Near-optimal fully dynamic densest subgraph. In STOC, pages 181--193, 2020. Google ScholarDigital Library
- S. B. Seidman. Network structure and minimum degree. Social networks, 5(3):269--287, 1983.Google ScholarCross Ref
- N. Tatti and A. Gionis. Density-friendly graph decomposition. In WWW, pages 1089--1099, 2015. Google ScholarDigital Library
Index Terms
- Efficient Directed Densest Subgraph Discovery
Recommendations
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of DataGiven a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is fundamental to a wide range of applications, such as fraud ...
On Directed Densest Subgraph Discovery
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is fundamental to a wide range of applications, such as fraud ...
Sandwiching a densest subgraph by consecutive cores
In this paper, we show that in the random graph Gn,c/n, with high probability, there exists an integer kï such that a subgraph of Gn,c/n, whose vertex set differs from a densest subgraph of Gn,c/n by Olog2n vertices, is sandwiched by the kï and the kï +...
Comments