arXiv Open Access 2024

Clique counts for network similarity

Anthony Bonato Zhiyuan Zhang

Lihat Sumber

Abstrak

Counts of small subgraphs, or graphlet counts, are widely applicable to measure graph similarity. Computing graphlet counts can be computationally expensive and may pose obstacles in network analysis. We study the role of cliques in graphlet counts as a method for graph similarity in social networks. Higher-order clustering coefficients and the Pivoter algorithm for exact clique counts are employed

Topik & Kata Kunci

cs.SI

Penulis (2)

Anthony Bonato

Zhiyuan Zhang

Format Sitasi

APA MLA BibTeX

Bonato, A., Zhang, Z. (2024). Clique counts for network similarity. https://arxiv.org/abs/2401.03536

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓