Counting triangles in real-world graph streams: Dealing with repeated edges and time windows

@article{Jha2015CountingTI,
  title={Counting triangles in real-world graph streams: Dealing with repeated edges and time windows},
  author={M. Jha and Ali Pinar and Seshadhri Comandur},
  journal={2015 49th Asilomar Conference on Signals, Systems and Computers},
  year={2015},
  pages={1507-1514}
}
  • M. Jha, Ali Pinar, Seshadhri Comandur
  • Published 2015
  • Computer Science, Mathematics
  • 2015 49th Asilomar Conference on Signals, Systems and Computers
  • Graphs in the real-world are often temporal and can be represented as a "stream" of edges. Estimating the number of triangles in a graph observed as a stream of edges is a fundamental problem in data mining. Our goal is to design a single pass space-efficient streaming algorithm for estimating triangle counts. While there are numerous algorithms for this problem, they all (implicitly or explicitly) assume that the stream does not contain duplicate edges. However, real graph streams are rife… CONTINUE READING
    9 Citations
    Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage
    • 18
    • Highly Influenced
    • PDF
    FURL: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams
    • 7
    • PDF
    How to Count Triangles, without Seeing the Whole Graph
    • 1
    • PDF
    REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
    • 6
    • PDF
    Counting Triangles in Massive Graphs with MapReduce
    • 62
    • PDF
    Graphlet based network analysis
    Temporal Network Sampling
    • 2
    • PDF

    References

    SHOWING 1-10 OF 43 REFERENCES
    Counting triangles in data streams
    • 235
    • Highly Influential
    • PDF
    Counting Arbitrary Subgraphs in Data Streams
    • 65
    • PDF
    Space efficient mining of multigraph streams
    • 132
    • PDF
    Efficient semi-streaming algorithms for local triangle counting in massive graphs
    • 258
    • PDF
    DOULION: counting triangles in massive graphs with a coin
    • 282
    • PDF
    Parallel triangle counting in massive streaming graphs
    • 45
    • Highly Influential
    • PDF
    PATRIC: a parallel algorithm for counting triangles in massive networks
    • 99
    • PDF
    Fast Triangle Counting through Wedge Sampling
    • 28
    Counting triangles and the curse of the last reducer
    • 377
    • PDF
    Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs
    • 50
    • PDF