State Clustering and Declustering of 3-Regular Graphs with Structural Rewriting

Kohji Tomita; Haruhisa Kurokawa

Bio-Inspired Models of Network, Information, and Computing Systems. 5th International ICST Conference, BIONETICS 2010, Boston, USA, December 1-3, 2010, Revised Selected Papers

Research Article

State Clustering and Declustering of 3-Regular Graphs with Structural Rewriting

Download

456 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-32615-8_45,
    author={Kohji Tomita and Haruhisa Kurokawa},
    title={State Clustering and Declustering of 3-Regular Graphs with Structural Rewriting},
    proceedings={Bio-Inspired Models of Network, Information, and Computing Systems. 5th International ICST Conference, BIONETICS 2010, Boston, USA, December 1-3, 2010, Revised Selected Papers},
    proceedings_a={BIONETICS},
    year={2012},
    month={10},
    keywords={cellular automata graph-rewriting graph automata adaptive network},
    doi={10.1007/978-3-642-32615-8_45}
}

Kohji Tomita
Haruhisa Kurokawa
Year: 2012
State Clustering and Declustering of 3-Regular Graphs with Structural Rewriting
BIONETICS
Springer
DOI: 10.1007/978-3-642-32615-8_45

Kohji Tomita¹^,*, Haruhisa Kurokawa¹^,*

1: National Institute of Advanced Industrial Science and Technology (AIST)

*Contact email: k.tomita@aist.go.jp, kurokawa-h@aist.go.jp

Abstract

We consider a variant of graph developing system and show various behavior with one type of graph-rewriting. This system is based on rewriting of 3-regular graphs with two possible states per node. We focus on a simple case of fixed number of nodes. The development processes include interaction among rather stable subgraphs. Some simple behaviors, such as clustering and declustering of states, are shown by simulation.

Keywords: cellular automata graph-rewriting graph automata adaptive network

Published: 2012-10-18

: http://dx.doi.org/10.1007/978-3-642-32615-8_45