Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Percolation in a distorted square lattice (1808.10665v1)

Published 31 Aug 2018 in cond-mat.stat-mech

Abstract: This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable parameter $\alpha$ to create a distorted empty lattice. In this model, two neighboring sites are considered to be connected to each other in order to belong to the same cluster, if both of them are occupied as per the criterion of usual percolation and the distance between them is less than or equal to a certain value, called connection threshold $d$. While spanning becomes difficult in distorted lattices as is manifested by the increment of the percolation threshold $p_c$ with $\alpha$, an increased connection threshold $d$ makes it easier for the system to percolate. The scaling behavior of the order parameter through relevant critical exponents and the fractal dimension $d_f$ of the percolating cluster at $p_c$ indicate that this new type of percolation may belong to the same universality class as ordinary percolation. This model can be very useful in various realistic applications since it is almost impossible to find a natural system that is perfectly ordered.

Summary

We haven't generated a summary for this paper yet.