60/102 Null Boundary Cellular Automata based expander graphs - Archive ouverte HAL
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

60/102 Null Boundary Cellular Automata based expander graphs

Abstract

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et al. introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor Cellular Automata(CA). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null Boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is maximal. Moreover, the spectral gap is larger than that of Mukhopadhyay et al.

Domains

Discrete Mathematics [cs.DM] Dynamical Systems [math.DS] Cellular Automata and Lattice Gases [nlin.CG] Combinatorics [math.CO]
Fichier principal
Vignette du fichier
dmAL0102.pdf (338.02 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Coordination Episciences Iam  : Connect in order to contact the contributor

https://inria.hal.science/hal-01185496

Submitted on : Thursday, August 20, 2015-2:16:44 PM

Last modification on : Wednesday, April 17, 2024-1:22:31 PM

Long-term archiving on : Wednesday, April 26, 2017-10:03:26 AM

Download

Dates and versions

hal-01185496 , version 1 (20-08-2015)

Identifiers

Cite

Sung-Jin Cho, Un-Sook Choi, Han-Doo Kim, Yoon-Hee Hwang, Jin-Gyoung Kim. 60/102 Null Boundary Cellular Automata based expander graphs. Automata 2010 - 16th Intl. Workshop on CA and DCS, 2010, Nancy, France. pp.19-28, ⟨10.46298/dmtcs.2760⟩. ⟨hal-01185496⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS
91 View
780 Download

Altmetric

Share

More