How frequently is a system of 2-linear Boolean equations solvable?
The electronic journal of combinatorics, Tome 17 (2010)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
We consider a random system of equations $x_i+x_j=b_{(i,j)} ({\rm mod }2)$, $(x_u\in \{0,1\},\, b_{(u,v)}=b_{(v,u)}\in\{0,1\})$, with the pairs $(i,j)$ from $E$, a symmetric subset of $[n]\times [n]$. $E$ is chosen uniformly at random among all such subsets of a given cardinality $m$; alternatively $(i,j)\in E$ with a given probability $p$, independently of all other pairs. Also, given $E$, ${\rm Pr}\{b_{e}=0\}={\rm Pr}\{b_e=1\}$ for each $e\in E$, independently of all other $b_{e\prime}$. It is well known that, as $m$ passes through $n/2$ ($p$ passes through $1/n$, resp.), the underlying random graph $G(n,\#{\rm edges}=m)$, ($G(n,{\rm Pr}({\rm edge})=p)$, resp.) undergoes a rapid transition, from essentially a forest of many small trees to a graph with one large, multicyclic, component in a sea of small tree components. We should expect then that the solvability probability decreases precipitously in the vicinity of $m\sim n/2$ ($p\sim 1/n$), and indeed this probability is of order $(1-2m/n)^{1/4}$, for $m < n/2$ ($(1-pn)^{1/4}$, for $p < 1/n$, resp.). We show that in a near-critical phase $m=(n/2)(1+\lambda n^{-1/3})$ ($p=(1+\lambda n^{-1/3})/n$, resp.), $\lambda=o(n^{1/12})$, the system is solvable with probability asymptotic to $c(\lambda)n^{-1/12}$, for some explicit function $c(\lambda)>0$. Mike Molloy noticed that the Boolean system with $b_e\equiv 1$ is solvable iff the underlying graph is $2$-colorable, and asked whether this connection might be used to determine an order of probability of $2$-colorability in the near-critical case. We answer Molloy's question affirmatively and show that, for $\lambda=o(n^{1/12})$, the probability of $2$-colorability is ${}\lesssim 2^{-1/4}e^{1/8}c(\lambda)n^{-1/12}$, and asymptotic to $2^{-1/4}e^{1/8}c(\lambda)n^{-1/12}$ at a critical phase $\lambda=O(1)$, and for $\lambda\to -\infty$.
DOI : 10.37236/364
Classification : 05C80, 05C30, 34E05, 60C05
Boris Pittel; Ji-A Yeum. How frequently is a system of 2-linear Boolean equations solvable?. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/364
@article{10_37236_364,
     author = {Boris Pittel and Ji-A Yeum},
     title = {How frequently is a system of 2-linear {Boolean} equations solvable?},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/364},
     zbl = {1193.05147},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/364/}
}
TY  - JOUR
AU  - Boris Pittel
AU  - Ji-A Yeum
TI  - How frequently is a system of 2-linear Boolean equations solvable?
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/364/
DO  - 10.37236/364
ID  - 10_37236_364
ER  - 
%0 Journal Article
%A Boris Pittel
%A Ji-A Yeum
%T How frequently is a system of 2-linear Boolean equations solvable?
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/364/
%R 10.37236/364
%F 10_37236_364

Cité par Sources :