Percolation thresholds of randomly rotating patchy particles on Archimedean lattices

We study the percolation of randomly rotating patchy particles on 11 Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and number are monodisperse. When there are more than one patches on the surface of a particle, they are symmetrically decorated. As the proportion χ of the particle surface covered by the patches increases, the clusters connected by the patches grow and the system percolates at the threshold χ_{c}. We combine Monte Carlo simulations and the critical polynomial method to give precise estimates of χ_{c} for disks with one to six patches and spheres with one to two patches on the 11 lattices. For one-patch particles, we find that the order of χ_{c} values for particles on different lattices is the same as that of threshold values p_{c} for site percolation on these lattices, which implies that χ_{c} for one-patch particles mainly depends on the geometry of lattices. For particles with more patches, symmetry becomes very important in determining χ_{c}. With the estimates of χ_{c} for disks with one to six patches, using analyses related to symmetry, we are able to give precise values of χ_{c} for disks with an arbitrary number of patches on all 11 lattices. The following rules are found for patchy disks on each of these lattices: (1) as the number of patches n increases, values of χ_{c} repeat in a periodic way, with the period n_{0} determined by the symmetry of the lattice; (2) when mod(n,n_{0})=0, the minimum threshold value χ_{min} appears, and the model is equivalent to site percolation with χ_{min}=p_{c}; and (3) disks with mod(n,n_{0})=m and n_{0}-m (m