What Is the Complexity of a Network? The Heat Flow-Thermodynamic Depth Approach
In this paper we establish a formal link between network complexity in terms of Birkhoff-von Neumann decompositions and heat flow complexity (in terms of quantifying the heat flowing through the network at a given inverse temperature). We propose and proof characterization theorems and also two fluctuation laws for sets of networks. Such laws emerge from studying the implicacions of the Fluctuation Theorem in heat-flow characterization. Furthermore, we also define heat flow complexity in terms of thermodynamic depth, which results in a novel approach for characterizing networks and quantify their complexity In our experiments we characterize several protein-protein interaction (PPI) networks and then highlight their evolutive differences, in order to test the consistence of the proposed complexity measure in terms of the second law of thermodynamics.
KeywordsInverse Temperature Permutation Matrice Bregman Divergence Spectral Graph Theory Depth Complexity
- Escolano, F., Hancock, E.R., Lozano, M.A.: Birkhoff Polytopes, Heat kernels and Graph complexity. In: Proc. of ICPR, pp. 1–5 (2008)Google Scholar
- Escolano, F., Giorgi, D., Hancock, E.R., Lozano, M.A., Falcidieno, B.: Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering. In: Proc. of GbRPR, pp. 253–262 (2009)Google Scholar
- Tsang, I.W., Kocsor, A., Kwok, J.T.: Simple Core Vector Machines with Enclosing Balls. In: Proc. of ICLM, pp. 911–918 (2007)Google Scholar
- Cayton, L.: Fast Nearest Neighbor Retrival with Bregman Divergences. In: Proc. of ICLM, pp. 112–119 (2008)Google Scholar