Ranking nodes according to their path-complexity

DOI10.1016/j.chaos.2014.12.021zbMath1352.60104arXiv1410.2638OpenAlexW1987393515MaRDI QIDQ728368

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

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) 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)

Cites Work

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

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