Corpus ID: 203737286

A new method for quantifying network cyclic structure to improve community detection

@article{Moradijamei2019ANM,
  title={A new method for quantifying network cyclic structure to improve community detection},
  author={Behnaz Moradijamei and Heman Shakeri and Pietro Poggi-Corradini and Michael J. Higgins},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.01921}
}
  • Behnaz Moradijamei, Heman Shakeri, +1 author Michael J. Higgins
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • A distinguishing property of communities in networks is that cycles are more prevalent within communities than across communities. Thus, the detection of these communities may be aided through the incorporation of measures of the local "richness" of the cyclic structure. In this paper, we introduce renewal non-backtracking random walks (RNBRW) as a way of quantifying this structure. RNBRW gives a weight to each edge equal to the probability that a non-backtracking random walk completes a cycle… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    References

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

    Near linear time algorithm to detect community structures in large-scale networks.

    VIEW 2 EXCERPTS

    Finding and evaluating community structure in networks.

    VIEW 2 EXCERPTS

    Community structure in social and biological networks

    • Michelle Girvan, M. E. J. Newman
    • Physics, Computer Science, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 2002
    VIEW 2 EXCERPTS

    Resolution limit in community detection

    VIEW 1 EXCERPT

    Defining and identifying communities in networks.

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Finding community structure in very large networks.

    VIEW 3 EXCERPTS

    Computing Communities in Large Networks Using Random Walks

    VIEW 2 EXCERPTS

    Statistical mechanics of community detection.

    VIEW 2 EXCERPTS