Percolation thresholds of randomly rotating patchy particles on Archimedean lattices
Quancheng Wang, Zhenfang He, Junfeng Wang, Hao Hu

TL;DR
This study investigates the percolation thresholds of randomly rotating patchy particles on 11 Archimedean lattices using simulations and critical polynomial methods, revealing geometric and symmetry-dependent rules for percolation behavior.
Contribution
It provides precise estimates of percolation thresholds for various patch configurations and uncovers symmetry-based rules governing these thresholds across different lattices.
Findings
Percolation thresholds depend on lattice geometry and patch symmetry.
Threshold values for one-patch particles align with site percolation thresholds.
Identified periodic and symmetry-based rules for thresholds with multiple patches.
Abstract
We study the percolation of randomly rotating patchy particles on 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 . We combine Monte Carlo simulations and the critical polynomial method to give precise estimates of for disks with one to six patches and spheres with one to two patches on the lattices. For one-patch particles, we find that the order of values for particles on different lattices is the same as that of threshold values for site percolation on same lattices,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
