Clique counts for network similarity
Social and Information Networks
2024-01-09 v1
Abstract
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
Keywords
Cite
@article{arxiv.2401.03536,
title = {Clique counts for network similarity},
author = {Anthony Bonato and Zhiyuan Zhang},
journal= {arXiv preprint arXiv:2401.03536},
year = {2024}
}