EJP Reading Tools

Density classification on infinite lattices and trees

Dublin Core		PKP Metadata Items	Metadata for this Document
1.	Title	Title of document	Density classification on infinite lattices and trees
2.	Creator	Author's name, affiliation, country	Ana Bušić; INRIA & ÉNS; France
2.	Creator	Author's name, affiliation, country	Nazim Fatès; Inria & Nancy Université; France
2.	Creator	Author's name, affiliation, country	Jean Mairesse; Université Paris Diderot - Paris 7; France
2.	Creator	Author's name, affiliation, country	Irène Marcovici; Université Paris Diderot - Paris 7; France
3.	Subject	Discipline(s)
3.	Subject	Keyword(s)	Cellular automata, interacting particle systems, density classification.
3.	Subject	Subject classification	Primary: 60K35; 68Q80. Secondary: 37B15; 60J05.
4.	Description	Abstract	Consider an infinite graph with nodes initially labeled by independent Bernoullirandom variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic)cellular automaton or a finite-range interacting particle system that evolves on this graph and decides whether p is smaller or larger than 1/2. Precisely, the trajectories should converge to the uniform configuration with only 0's if p<1/2, and only 1's if p>1/2.  We present solutions to the problem on the regular grids of dimension d, for any d>1, and on the regular infinite trees. For the bi-infinite line, we propose some candidates that weback up with numerical simulations.
5.	Publisher	Organizing agency, location
6.	Contributor	Sponsor(s)	ANR project MAGNUM (ANR-2010-BLAN-0204)
7.	Date	(YYYY-MM-DD)	2013-04-24
8.	Type	Status & genre	Peer-reviewed Article
8.	Type	Type
9.	Format	File format	PDF
10.	Identifier	Uniform Resource Identifier	http://ejp.ejpecp.org/article/view/2325
10.	Identifier	Digital Object Identifier	10.1214/EJP.v18-2325
11.	Source	Journal/conference title; vol., no. (year)	Electronic Journal of Probability; Vol 18
12.	Language	English=en	en
14.	Coverage	Geo-spatial location, chronological period, research sample (gender, age, etc.)
15.	Rights	Copyright and permissions	The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available. Summary of the Creative Commons Attribution License You are free to copy, distribute, display, and perform the work to make derivative works to make commercial use of the work under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.