Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 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

Estimates of threshold and strength of percolation clusters on square lattices with (1,d)-neighborhood (1311.6748v2)

Published 26 Nov 2013 in cond-mat.stat-mech

Abstract: In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold $p_c$ and the strength of percolation clusters $P_\infty$ for a square lattice with $(1, d)$-neighborhood depends not only on the lattice dimension, but also on the Minkowski exponent $d$. To estimate the strength of percolation clusters $P_\infty$ proposed a new method of averaging the relative frequencies of the target subset of lattice sites. The implementation of this method is based on the SPSL package, released under GNU GPL-3 using the free programming language R.

Summary

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