Dynamical distance: coarse grains, pattern recognition, and network analysis

DOI10.1016/j.bulsci.2005.02.006zbMath1093.82013MaRDI QIDQ2572083

Bernard Gaveau, Lawrence S. Schulman

Publication date: 14 November 2005

Published in: Bulletin des Sciences Mathématiques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.bulsci.2005.02.006

zbMATH Keywords

Pattern recognition; Stochastic matrix; Network analysis; Coarse-grained

Mathematics Subject Classification ID

90B15: Stochastic network models in operations research

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

82C05: Classical dynamic and nonequilibrium statistical mechanics (general)

Related Items

Cellular automata on graphs: topological properties of ER graphs evolved towards low-entropy dynamics, Local and global statistical dynamical properties of chaotic Markov analytic maps and repellers: a coarse grained and spectral perspective, Complex networks: from graph theory to biology, Contextual emergence in the description of properties, Clusters from higher order correlations

Cites Work

• Finite coarse-graining and Chapman-Kolmogorov equation in conservative dynamical systems
• Community structure in social and biological networks
• Theory of nonequilibrium first-order phase transitions for stochastic dynamics
• Master equation based formulation of nonequilibrium statistical mechanics
• What symbolic dynamics do we get with a misplaced partition? On the validity of threshold crossings analysis of chaotic time-series