Ranking nodes according to their path-complexity

DOI10.1016/J.CHAOS.2014.12.021MaRDI QIDQ728368zbMATH OpenOpenAlexFDO

Authors Francesco Caravelli

Publication date 20 December 2016

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.2638

zbMATH Keywords

Markov chains entropyMarkovian transition kernels

Mathematics Subject Classification ID

Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Simulation of dynamical systems (37M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

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 $k$ and, studying the recursion relation, obtain a fixed point entropy. This analysis leads to a centrality approach to Markov chains entropy.

Recommendations

• The entropy of Markov trajectories
• Maximum entropy estimation of transition probabilities of reversible Markov chains
• Entropy: the Markov ordering approach
• Maximum entropy for countable Markov chains
• scientific article; zbMATH DE number 888812

Cites work

• The entropy of Markov trajectories
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states

This page was built for publication: Ranking nodes according to their path-complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q728368)