Dynamical distance: coarse grains, pattern recognition, and network analysis
DOI10.1016/J.BULSCI.2005.02.006zbMATH Open1093.82013OpenAlexW2083762187MaRDI QIDQ2572083FDOQ2572083
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
Recommendations
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic network models in operations research (90B15) Classical dynamic and nonequilibrium statistical mechanics (general) (82C05)
Cites Work
- Community structure in social and biological networks
- What symbolic dynamics do we get with a misplaced partition? On the validity of threshold crossings analysis of chaotic time-series
- Theory of nonequilibrium first-order phase transitions for stochastic dynamics
- Finite coarse-graining and Chapman-Kolmogorov equation in conservative dynamical systems
- Master equation based formulation of nonequilibrium statistical mechanics
Cited In (5)
- Cellular automata on graphs: topological properties of ER graphs evolved towards low-entropy dynamics
- Complex networks: from graph theory to biology
- Contextual emergence in the description of properties
- Local and global statistical dynamical properties of chaotic Markov analytic maps and repellers: a coarse grained and spectral perspective
- Clusters from higher order correlations
This page was built for publication: Dynamical distance: coarse grains, pattern recognition, and network analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572083)