Papers › Euler Number and Percolation Threshold on a Square Lattice with Diagonal Connection...
Euler Number and Percolation Threshold on a Square Lattice with Diagonal Connection Probability and Revisiting the Island-Mainland Transition
Sanchayan Dutta, Sugata Sen, Tajkera Khatun, Tapati Dutta, Sujata Tarafdar
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We report some novel properties of a square lattice filled with white sites, randomly occupied by black sites (with probability p). We consider connections up to second nearest neighbours, according to the following rule. Edge-sharing sites, i.e. nearest neighbours of similar type are always considered to belong to the same cluster. A pair of black corner-sharing sites, i.e. second nearest neighbours may form a 'cross-connection' with a pair of white corner-sharing sites. In this case assigning connected status to both pairs simultaneously, makes the system quasi-three dimensional, with intertwined black and white clusters. The two-dimensional character of the system is preserved by considering the black diagonal pair to be connected with a probability q, in which case the crossing white pair of sites are deemed disjoint. If the black pair is disjoint, the white pair is considered connected. In this scenario we investigate (i) the variation of the Euler number χ(p) [=N_B(p)-N_W(p)] versus p graph for varying q, (ii) variation of the site percolation threshold with q and (iii) size distribution of the black clusters for varying p, when q=0.5. Here N_B is the number of black clusters and N_W is the number of white clusters, at a certain probability p. We also discuss the earlier proposed 'Island-Mainland' transition (Khatun, T., Dutta, T. & Tarafdar, S. Eur. Phys. J. B (2017) 90: 213) and show mathematically that the proposed transition is not, in fact, a critical phase transition and does not survive finite size scaling. It is also explained mathematically why clusters of size 1 are always the most numerous.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections