Measuring complexity through average symmetry

DOI10.1088/1751-8113/48/27/275101zbMATH Open1337.82002arXiv1503.07218OpenAlexW2963519419MaRDI QIDQ5264415FDOQ5264415

Roberto C. Alamino

Publication date: 27 July 2015

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different) complexity to either deterministic or random homogeneous densities and higher complexity to the intermediate cases. This new measure is easily computable, breaks the coarse graining paradigm and can be straightforwardly generalised, including to continuous cases and general networks. By applying this measure to a series of objects, it is shown that it can be consistently used for both small scale structures with exact symmetry breaking and large scale patterns, for which, differently from similar measures, it consistently discriminates between repetitive patterns, random configurations and self-similar structures.

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

Recommendations

• Binary sequences. III: Complexity versus homogeneity and symmetry
• MEASURING COMPLEXITY: A RELATIVE ASPECT OF PATTERN RECOGNITION
• Measuring static complexity
• Mean mutual information and symmetry breaking for finite random fields
• A NEW TWO-DIMENSIONAL COMPLEXITY MEASURE

zbMATH Keywords

entropycomplexityaverage symmetry

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Foundations of equilibrium statistical mechanics (82B03)

This page was built for publication: Measuring complexity through average symmetry

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