2026-09-19T09:14:56Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1448752022-08-30T03:44:50Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Bresler, Guy
Polyanskiy, Yury
Guo, Chenghao
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-08-29T16:17:51Z
2022-08-29T16:17:51Z
2022-05
2022-06-21T19:25:58.408Z
https://hdl.handle.net/1721.1/144875
0000-0002-4440-3229
Given a matrix A and vector b with polynomial entries in d real variables δ=(δ₁,…,δ subscript d) we consider the following notion of feasibility: the pair (A,b) is locally feasible if there exists an open neighborhood U of 0 such that for every δ∈U there exists x satisfying A(δ)x≥b(δ) entry-wise. For d=1 we construct a polynomial time algorithm for deciding local feasibility. For d≥2 we show local feasibility is NP-hard.
As an application (which was the primary motivation for this work) we give a computer-assisted proof of ergodicity of the following elementary 1D cellular automaton: given the current state ηₜ∈{0,1}ℤ the next state ηₜ₊₁(n) at each vertex n∈ superscript ℤ is obtained by ηₜ₊₁(n)=NAND(BSCδ(ηₜ(n−1)),BSCδ(ηt(n))). Here the binary symmetric channel BSCδ takes a bit as input and flips it with probability δ (and leaves it unchanged with probability 1−δ). It is shown that there exists 𝛿₀ > 0 such that for all 0 < 𝛿 < 𝛿₀ the distribution of 𝜂ₜ converges to a unique stationary measure irrespective of the initial condition 𝜂₀.
We also consider the problem of broadcasting information on the 2D-grid of noisy binary-symmetric channels BSCδ, where each node may apply an arbitrary processing function to its input bits. We prove that there exists δ′₀>0 such that for all noise levels 0<δ<δ′₀ it is impossible to broadcast information for any processing function, as conjectured in Makur, Mossel, Polyanskiy (ISIT 2021).
S.M.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata
Thesis
application/pdf
Master
Master of Science in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="558dff26-8221-449f-9ee3-ee44e09f3bdb">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2022-05</PublicationDate>
<Authors>
<Author>
<DisplayName>Guo, Chenghao</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Given a matrix A and vector b with polynomial entries in d real variables δ=(δ₁,…,δ subscript d) we consider the following notion of feasibility: the pair (A,b) is locally feasible if there exists an open neighborhood U of 0 such that for every δ∈U there exists x satisfying A(δ)x≥b(δ) entry-wise. For d=1 we construct a polynomial time algorithm for deciding local feasibility. For d≥2 we show local feasibility is NP-hard.
As an application (which was the primary motivation for this work) we give a computer-assisted proof of ergodicity of the following elementary 1D cellular automaton: given the current state ηₜ∈{0,1}ℤ the next state ηₜ₊₁(n) at each vertex n∈ superscript ℤ is obtained by ηₜ₊₁(n)=NAND(BSCδ(ηₜ(n−1)),BSCδ(ηt(n))). Here the binary symmetric channel BSCδ takes a bit as input and flips it with probability δ (and leaves it unchanged with probability 1−δ). It is shown that there exists 𝛿₀ > 0 such that for all 0 < 𝛿 < 𝛿₀ the distribution of 𝜂ₜ converges to a unique stationary measure irrespective of the initial condition 𝜂₀.
We also consider the problem of broadcasting information on the 2D-grid of noisy binary-symmetric channels BSCδ, where each node may apply an arbitrary processing function to its input bits. We prove that there exists δ′₀>0 such that for all noise levels 0<δ<δ′₀ it is impossible to broadcast information for any processing function, as conjectured in Makur, Mossel, Polyanskiy (ISIT 2021).</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>