Inhomogeneous percolation on ladder graphs (Q2181622)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inhomogeneous percolation on ladder graphs |
scientific article |
Statements
Inhomogeneous percolation on ladder graphs (English)
0 references
19 May 2020
0 references
Let \(G=(V,E)\) be a connected graph. Consider two new graphs \(\mathbb{G}=(\mathbb{V},\mathbb{E})\) and \(\overrightarrow{\mathbb{G}}=(\mathbb{V},\overrightarrow{\mathbb{E}})\), where \(\mathbb{V}=V\times \mathbb{Z}\), \[\mathbb{E}=\{\{ (u,n),(v,n)\}:\{u,v\}\in E,n\in\mathbb{Z}\}\cup \{\{(u,n),(u,n+1)\}:u\in V,n\in\mathbb{Z}\},\] \[\overrightarrow{\mathbb{E}}=\{\langle(u,n),(v,n+1)\rangle:\{u,v\}\in E, n\in\mathbb{Z}\}.\] Let us define percolation models for introduced graphs \(\mathbb{G}\) and \(\overrightarrow{\mathbb{G}}\). Fix finitely many vertices \(w_1,\ldots,w_L\in V\) and edges \(\{u_1.v_1\},\ldots\{u_K,v_K\}\in E\) and let \[\mathbb{E}^i=\{\{(u_i,n),(v_i,n)\}:n\in\mathbb{Z}\},i=1,\ldots,K\] \[\mathbb{E}^{K+j}=\{\{(w_j,n),(w_j,n+1)\}:n\in\mathbb{Z}\}, j=1,\ldots,L,\] \[\overrightarrow{\mathbb{E}}^i=\{\langle(u_i,n),(v_i,n+1)\rangle, \langle(v_i,n),(u_i,n+1)\rangle:n\in\mathbb{Z}\}.\] For graph \(\mathbb{G}\) suppose that edges from \(\mathbb{E}^i\) are open with the probability \(q_i\in (0;1)\) and edges from \(\mathbb{E}\setminus \bigcup_{i=1}^{K+L} \mathbb{E}^i\) are open with the probability \(p\in [0;1]\). Similarly, for \(\overrightarrow{\mathbb{G}}\) suppose that edges from \(\overrightarrow{\mathbb{E}}^i\) are open with the probability \(q_i\in (0;1)\) and edges from \(\overrightarrow{\mathbb{E}}\setminus \bigcup_{i=1}^K \overrightarrow{\mathbb{E}}^i\) are open with the probability \(p\in [0;1]\). Denote by \(p_c\) and \(\overrightarrow{p}_c\) corresponding critical probabilies. Then \(p_c\) and \(\overrightarrow{p}_c\) are continious functions of \((q_1,\ldots q_{K+L})\) and \((q_1,\ldots q_{K})\) respectively.
0 references
inhomogeneous percolation
0 references
oriented percolation
0 references
ladder graphs
0 references
critical parameter
0 references