Search Results for author:
Found 5 papers, 2 papers with code
An Improved Algorithm for Coarse-Graining Cellular Automata
Here we introduce a new, more efficient algorithm for finding coarse-grainings between any two given CA that allows us to systematically explore all elementary CA with supercell sizes up to $N=7$, and to explore individual examples of even larger supercell size.
Cellular Automata and Lattice Gases Statistical Mechanics Data Structures and Algorithms Pattern Formation and Solitons 37B15, 68Q80, 68W05 F.2.2; G.4
Comparing Information-Theoretic Measures of Complexity in Boltzmann Machines
In the past three decades, many theoretical measures of complexity have been proposed to help understand complex systems.
Dynamics of beneficial epidemics
Third, in the context of dynamic social networks, we find that preferences for increased global infection accelerate spread and produce superexponential fixation, but preferences for local assortativity halt epidemics by disconnecting the infected from the susceptible.
Physics and Society Multiagent Systems Social and Information Networks Adaptation and Self-Organizing Systems Populations and Evolution
Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition
The onion spectrum is exactly as easy to compute as the k-cores: It is based on the stages at which each vertex gets removed from a graph in the standard algorithm for computing the k-cores.
Physics and Society Disordered Systems and Neural Networks Discrete Mathematics Social and Information Networks Combinatorics
Optimal high-level descriptions of dynamical systems
These include SSC as a measure of the complexity of a dynamical system, and as a way to quantify information flow between the scales of a system.
