Results 281 to 290 of about 55,848 (311)

Percolation on subsets of the square lattice [PDF]

Journal of Applied Probability, 1980
We adapt arguments from a paper of Seymour and Welsh concerning percolation probabilities on the infinite square lattice L to show that for certain regions R in L, if there is a positive probability of having an infinite open path in L starting at the origin then there is also a positive probability of having such a path within R.
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Polygonal polyominoes on the square lattice

Journal of Physics A: Mathematical and General, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksander L Owczarek, Iwan Jensen, Anthony J. Guttmann   +2 more
openaire   +2 more sources

On the area of square lattice polygons

Journal of Statistical Physics, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anthony J. Guttmann, Ian G. Enting
openaire   +2 more sources

On the number of lattice animals embeddable in the square lattice [PDF]

Journal of Physics A: Mathematical and General, 1982
Enumeration of lattice animals embeddable in a square lattice has been extended to 24 cell animals by Redelmeier (1981). It is shown that the number of animals per site an approximately 0.317(4.0626)nn-1 exp(-0.465 n-0.87) to a high degree of accuracy.
openaire   +2 more sources

Mixed percolation on the square lattice

Journal of Applied Probability, 1984
In a planar percolation model, faces of the underlying graph, as well as the sites and bonds, may be viewed as random elements. With this viewpoint, Whitney duality allows construction of a planar dual percolation model for each planar percolation model, which applies to mixed models with sites, bonds, and faces open or closed at random.
openaire   +3 more sources

The trail problem on the square lattice

Journal of Physics A: Mathematical and General, 1976
The trail problem on the square lattice is studied by the method of exact enumeration and its relation to the self-avoiding walk problem is pointed out. The number of N-stepped trails and their mean-square sizes are enumerated on a computer up to N=17.
openaire   +3 more sources

Gauge vortices on a square lattice

Zeitschrift für Physik B Condensed Matter, 1995
The effective interaction between gauge vortices on a square lattice is revealed to be attractive at short distance and oscillate between repulsion and attraction at long distance. It is analyzed that the strong attraction at short distance makes the gauge vortices cluster at a given flux concentration; while the oscillatory nature in the interaction ...
C. D. Gong, Mei-rong Li
openaire   +2 more sources

Generalized Lattice Square Designs

Journal of the American Statistical Association, 1966
Abstract In connection with extending the analysis of variance to r replicates of a lattice square design for use in high speed computer programming, a relatively simple computational and analytical procedure has been set forth. The sums of squares, the expectation of the resulting mean squares in the analysis of variance, estimators for intrablock ...
Walter T. Federer, B. L. Raktoe
openaire   +2 more sources

The Square-Cell Lattice

2002
The classical continuum model of the material used above can be considered only as the slowly-varying approximation of a discrete or structured material. This accuracy is sufficient for the analysis of regular processes in which waves corresponding to the microstructural scales can be neglected. However, macro-processes exist, and they are not a rarity
openaire   +2 more sources

Lattice oxygen redox chemistry in solid-state electrocatalysts for water oxidation

Energy and Environmental Science, 2021
Ning Zhang, Yang Chai
exaly