Ranking nodes according to their path-complexity
arXiv:1410.2638 · doi:10.1016/j.chaos.2014.12.021
Abstract
Thermalization is one of the most important phenomena in statistical physics. Often, the transition probabilities between different states in the phase space is or can be approximated by constants. In this case, the system can be described by Markovian transition kernels, and when the phase space is discrete, by Markov chains. In this paper, we introduce a macroscopic entropy on the states of paths of length and, studying the recursion relation, obtain a fixed point entropy. This analysis leads to a centrality approach to Markov chains entropy.
arXiv comment9 pages, two columns, 3 Figures; accepted in Chaos, Solitons and Fractals
References in corpus (8)
- Entropy measures for complex networks: Toward an information theory of complex topologies
- The entropy of network ensembles
- The entropy of randomized network ensembles
- Entropy Rate of Diffusion Processes on Complex Networks
- On dynamic network entropy in cancer
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Finding instabilities in the community structure of complex networks
- Homogeneous complex networks