A General Framework for Estimating Graphlet Statistics via Random Walk

@article{Chen2016AGF,
  title={A General Framework for Estimating Graphlet Statistics via Random Walk},
  author={Xiaowei Chen and Yongkun Li and Pinghui Wang and John C. S. Lui},
  journal={ArXiv},
  year={2016},
  volume={abs/1603.07504}
}
  • Xiaowei Chen, Yongkun Li, +1 author John C. S. Lui
  • Published in Proc. VLDB Endow. 2016
  • Computer Science
  • ArXiv
  • Graphlets are induced subgraph patterns and have been frequently applied to characterize the local topology structures of graphs across various domains, e.g., online social networks (OSNs) and biological networks. Discovering and computing graphlet statistics are highly challenging. First, the massive size of real-world graphs makes the exact computation of graphlets extremely expensive. Secondly, the graph topology may not be readily available so one has to resort to web crawling using the… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 33 CITATIONS

    Motif Counting Beyond Five Nodes

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Counting Edges and Triangles in Online Social Networks via Random Walk

    VIEW 11 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    A General Framework for Estimating Graphlet Statistics via Random Walk

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS

    LINC: A Motif Counting Algorithm for Uncertain Graphs

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Mining Graphlet Counts in Online Social Networks

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 53 REFERENCES

    Efficient Graphlet Counting for Large Networks

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Efficiently Estimating Motif Statistics of Large Networks

    VIEW 10 EXCERPTS

    Minfer: A method of inferring motif statistics from sampled edges

    VIEW 5 EXCERPTS

    GUISE: Uniform Sampling of Graphlets for Large Graph Analysis

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL