Network Entropy based on Cluster Expansion on Motifs for Undirected Graphs

by   Ruize Gao, et al.

The structure of the network can be described by motifs, which are subgraphs that often repeat themselves. In order to understand the structure of network motifs, it is of great importance to study subgraphs from the perspective of statistical mechanics. In this paper, we use clustering extensions in statistical physics to solve the problem of using motifs as network primitives. By projecting the network motifs to clusters in the gas model, we develop the partition function of the network, which enables us to calculate global thermodynamic quantities, such as energy, entropy, and vice versa. Then, we give the analytic expressions of the number of specific types of motifs and calculate their correlated entropy. We conduct algebraic experiments on datasets, both synthetic and in real life, and evaluate the qualitative and quantitative characterization of motif entropy derived from the partition function. Our findings show that the motif entropy of networks in real life, for instance, financial and stock market networks, is of high correlation to the change of network structure. Hence, our findings are consistent with recent studies about the similar topic that network motifs can be represented as basic elements of well-defined information processing functions.


page 1

page 2

page 3

page 4


The case for shifting the Renyi Entropy

We introduce a variant of the Rényi entropy definition that aligns it wi...

Labeled Subgraph Entropy Kernel

In recent years, kernel methods are widespread in tasks of similarity me...

Atomic subgraphs and the statistical mechanics of networks

We develop random graph models where graphs are generated by connecting ...

Moser-Tardos resampling algorithm, entropy compression method and the subset gas

We establish a connection between the entropy compression method and the...

Motif and Hypergraph Correlation Clustering

Motivated by applications in social and biological network analysis, we ...

Fuzzy clustering algorithms with distance metric learning and entropy regularization

The clustering methods have been used in a variety of fields such as ima...

Hierarchical entropy and domain interaction to understand the structure in an image

In this study, we devise a model that introduces two hierarchies into in...

Please sign up or login with your details

Forgot password? Click here to reset