{"paper":{"title":"Jamming and percolation of parallel squares in single-cluster growth model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"I.A. Kriuchevskyi, L.A. Bulavin, N.I. Lebovka, Yu.Yu. Tarasevich","submitted_at":"2014-10-16T04:54:08Z","abstract_excerpt":"This work studies the jamming and percolation of parallel squares in a single-cluster growth model. The Leath-Alexandrowicz method was used to grow a cluster from an active seed site. The sites of a square lattice were occupied by addition of the equal size $k \\times k$ squares (E-problem) or a mixture of $k \\times k$ and $m \\times m$ ($m \\leqslant k$) squares (M-problem). The larger $k \\times k$ squares were assumed to be active (conductive) and the smaller $m \\times m$ squares were assumed to be blocked (non-conductive). For equal size $k \\times k$ squares (E-problem) the value of $p_j = 0.6"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4292","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}