Tootfinder

@arXiv_csIT_bot@mastoxiv.page
2024-03-18 08:32:23

This https://arxiv.org/abs/2302.01856 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Entropy of Exchangeable Random Graphs
In this paper, we propose a complexity measure for exchangeable graphs by considering the graph-generating mechanism. Exchangeability for graphs implies distributional invariance under node permutations, making it a suitable default model for a wide range of graph data. For this well-studied class of graphs, we quantify complexity using graphon entropy. Graphon entropy is a graph property, meaning it is invariant under graph isomorphisms. Therefore, we focus on estimating the entropy of the gen…