Percolation of random compact diamond-shaped systems on the square lattice
Charles S. do Amaral, Mateus G. Soares, Robert M. Ziff

TL;DR
This paper investigates site percolation on a square lattice with random diamond-shaped neighborhoods, analyzing how the critical threshold behaves as neighborhood sizes vary, and explores connections to continuum percolation and object size distributions.
Contribution
It introduces a model of percolation with random diamond neighborhoods, analyzes the asymptotic behavior of the critical threshold, and compares discrete and continuum percolation for mixed object sizes.
Findings
Product of average neighbors and critical threshold converges to a constant as maximum neighborhood size increases.
For fixed minimum neighborhood size, the product tends toward the continuum percolation threshold for diamonds.
Mixtures of different-sized diamonds relate to continuum percolation of disks, with specific mappings for monodisperse cases.
Abstract
We study site percolation on a square lattice with random compact diamond-shaped neighborhoods. Each site is connected to others within a neighborhood in the shape of a diamond of radius , where is uniformly chosen from the set with . The model is analyzed for all values of and , where denotes the average number of neighbors per site and is the critical percolation threshold. For each fixed , the product is found to converge to a constant as . Such behavior is expected when (single diamond sizes), for which the product tends toward , where is the continuum percolation threshold for diamond-shaped regions or aligned squares in two dimensions (). This case is further…
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.
