Large Very Dense Subgraphs in a Stream of Edges

@article{Mathieu2020LargeVD,
  title={Large Very Dense Subgraphs in a Stream of Edges},
  author={C. Mathieu and M. Rougemont},
  journal={Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference},
  year={2020}
}
  • C. Mathieu, M. Rougemont
  • Published 2020
  • Geology, Computer Science, Mathematics
  • Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference
  • We study the detection and the reconstruction of a large very dense subgraph in a social graph with n nodes and m edges given as a stream of edges, when the graph follows a power law degree distribution, in the regime when $m=O(n. łog n)$. A subgraph is very dense if its edge density is comparable to a clique. We uniformly sample the edges with a Reservoir of size $k=O(\sqrtn.łog n)$. The detection algorithm of a large very dense subgraph checks whether the Reservoir has a giant component. We… CONTINUE READING

    References

    SHOWING 1-3 OF 3 REFERENCES
    The Size of the Giant Component of a Random Graph with a Given Degree Sequence
    • 713
    • Highly Influential
    • PDF
    Densest Subgraph in Streaming and MapReduce
    • 172
    • Highly Influential
    • PDF
    Networks: An Introduction
    • 8,393
    • Highly Influential