Retrieving Top Weighted Triangles in Graphs

10/01/2019
by   Raunak Kumar, et al.
0

Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and a number of methods have been developed for scaling subgraph counting to large graphs. Many real-world networks carry a natural notion of strength of connection between nodes, which are often modeled by a weighted graph, but existing scalable graph algorithms for pattern mining are designed for unweighted graphs. Here, we develop a suite of deterministic and random sampling algorithms that enable the fast discovery of the 3-cliques (triangles) with the largest weight in a graph, where weight is measured by a generalized mean of a triangle's edges. For example, one of our proposed algorithms can find the top-1000 weighted triangles of a weighted graph with billions of edges in thirty seconds on a commodity server, which is orders of magnitude faster than existing "fast" enumeration schemes. Our methods thus open the door towards scalable pattern mining in weighted graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2018

A sampling framework for counting temporal motifs

Pattern counting in graphs is fundamental to network science tasks, and ...
research
09/14/2018

Graph Pattern Mining and Learning through User-defined Relations (Extended Version)

In this work we propose R-GPM, a parallel computing framework for graph ...
research
11/22/2022

Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams

A great variety of complex systems, from user interactions in communicat...
research
12/18/2019

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queri...
research
12/31/2017

Butterfly Counting in Bipartite Networks

Graph motifs are used to analyze networks from diverse domains. We consi...
research
03/22/2021

Continuous mean distance of a weighted graph

We study the concept of the continuous mean distance of a weighted graph...
research
02/06/2022

Memory Efficient Tries for Sequential Pattern Mining

The rapid and continuous growth of data has increased the need for scala...

Please sign up or login with your details

Forgot password? Click here to reset