首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
We consider self-avoiding walks on the backbone of percolation clusters in space dimensions d=2,3,4. Applying numerical simulations, we show that the whole multifractal spectrum of singularities emerges in exploring the peculiarities of the model. We obtain estimates for the set of critical exponents that govern scaling laws of higher moments of the distribution of percolation cluster sites visited by self-avoiding walks, in a good correspondence with an appropriately summed field-theoretical epsilon=6-d expansion [H.-K. Janssen and O. Stenull, Phys. Rev. E 75, 020801(R) (2007)10.1103/PhysRevE.75.020801].  相似文献   

2.
We calculate the average number of stepsN for edge-to-edge, normal, and indefinitely growing self-avoiding walks (SAWs) on two-dimensional critical percolation clusters, using the real-space renormalization-group approach, with small H cells. Our results are of the formN=AL D SAW+B, whereL is the end-to-end distance. Similarly to several deterministic fractals, the fractal dimensionsD SAW for these three different kinds of SAWs are found to be equal, and the differences between them appear in the amplitudesA and in the correction termsB. This behavior is atributed to the hierarchical nature of the critical percolation cluster.  相似文献   

3.
A phenomenological approach which takes into account the basic geometry and topology of percolation fractal structures and of self-avoiding walks (SAW) is used to derive a new expression for the Flory exponent describing the average radius of gyration of SAWs on fractals. We focus on the radius of gyration and discuss the importance of the intrinsic fractal dimensions of percolation clusters in determining the lower and upper critical dimensions of SAWs. The mean-field version of our new formula corresponds to the Aharony and Harris expression, who used the standard Flory approach for its derivation.On leave from Santipur College, Nadia 741404, India.  相似文献   

4.
5.
The statistics of directed self-avoiding walks (SAWs) on randomly bond diluted square lattices have been solved exactly and a computer simulation study of the statistics of ordinary SAWs on diluted square lattices has also been performed. The configurational averaging has been performed here over the logarithms of the distribution functions. We find that the critical behaviour remains unchanged below a certain dilution concentrationp *, dependent on the length of the chains considered (p *=0 forN), and a crossover to a higher order critical behaviour occurs beyond that point.  相似文献   

6.
The frequency dependence of the ac hopping conductivity in two and three dimensional lattices with random interruptions is calculated by Monte Carlo simulation of random walks on bond percolation clusters. At low frequencies the real and imaginary parts of the ac conductivity vanish linearly and quadratically with the frequency, respectively. The critical behaviour of the imaginary part of the ac conductivity below the percolation threshold is shown to depend on the long time limit of the mean square displacement of random walksR 2 , while the real part depends on the time constant of the system as well.R 2 is found to diverge with an exponentu=2- according to the conjecture of Stauffer.  相似文献   

7.
8.
We use the real-space renormalization group method to study the critical behavior of self-avoiding walks (SAWs) on both site percolation clusters at percolation threshold and site lattice animals in a square lattice. The correlation length exponents of SAWs are found to be on the percolation clusters atp c and SAW LA =0.804 on lattice animals. These results are compared with Kremer's suggestion of modified Flory formula where is the fractal dimension of the fractal object.  相似文献   

9.
The statistics of true-self-avoiding walk model on two dimensional critical percolation clusters and lattice animals are studied using real-space renormalization group method. The correlation length exponents 's are found to be TSAW pc 0.576 and TSAW LA 0.623 respectively for the critical percolation clusters and lattice animals.  相似文献   

10.
A. Malakis 《Physica A》1980,104(3):427-434
The complications encountered in direct renormalization approaches for the self-avoiding walk problem are discussed. Using a decimation transformation on the square lattice, sequences of approximants to the critical exponent ν and to the inverse connective constant Kc(1Kc = μ) are obtained.  相似文献   

11.
12.
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect, which gives finite values for its mean value 〈L 〉. For random networks, this mean attrition length 〈L 〉 scales as a power of the network size, and diverges in the thermodynamic limit (system size N ↦∞). For small-world networks, we find a behavior that interpolates between those corresponding to regular lattices and randon networks, for rewiring probability p ranging from 0 to 1. For p < 1, the mean self-intersection and attrition length of kinetically-grown walks are finite. For p = 1, 〈L 〉 grows with system size as N1/2, diverging in the thermodynamic limit. In this limit and close to p = 1, the mean attrition length diverges as (1-p)-4. Results of approximate probabilistic calculations agree well with those derived from numerical simulations.  相似文献   

13.
Using a new graph counting technique suitable for self-similar fractals, exact 18th-order series expansions for SAWs on some Sierpinski carpets are generated. From them, the critical fugacityx c and critical exponents SAW and SAW are obtained. The results show a linear dependence of the critical fugacity with the average number of bonds per site of the lattices studied. We find for some carpets with low lacunarity that SAW<0.75, thus violating the relation SAW(fractal) > SAW (d) for SAWs on the fractals which are embedded in ad-dimensional Euclidean space.  相似文献   

14.
Consider a fixed end pattern (a short self-avoiding walk) that can occur as the first few steps of an arbitrarily long self-avoiding walk on d. It is a difficult open problem to show that asN , the fraction ofN-step self-avoiding walks beginning with this pattern converges. It is shown that asN , this fraction is bounded away from zero, and that the ratio of the fractions forN andN+2 converges to one. Similar results are obtained when patterns are specified at both ends, and also when the endpoints are fixed.  相似文献   

15.
It is shown that the numberc n of self-avoiding walks of lengthn in d is an increasing function ofn.  相似文献   

16.
We prove that the self-avoiding walk has Ornstein-Zernike decay and some related properties for all noncritical temperatures at which the model is defined.National Science Foundation Postdoctoral Research Fellows. Work supported in part by the National Science Foundation under Grants No. PHY-82-03669 and MCS-81-20833  相似文献   

17.
Using a direct position-space renormalization-group approach we study percolation clusters in the limits , wheres is the number of occupied elements in a cluster. We do this by assigning a fugacityK per cluster element; asK approaches a critical valueK c , the conjugate variables . All exponents along the path (K–K c ) 0 are then related to a corresponding exponent along the paths . We calculate the exponent , which describes how the radius of ans-site cluster grows withs at the percolation threshold, in dimensionsd=2, 3. Ind=2 our numerical estimate of =0.52±0.02, obtained from extrapolation and from cell-to-cell transformation procedures, is in agreement with the best known estimates. We combine this result with previous PSRG calculations for the connectedness-length exponent , to make an indirect test of cluster-radius scaling by calculating the scaling function exponent using the relation =/. Our result for is in agreement with direct Monte-Carlo calculations of , and thus supports the cluster-radius scaling assumption. We also calculate ind=3 for both site and bond percolation, using a cell of linear sizeb=2 on the simple-cubic lattice. Although the result of such small-cell calculations are at best only approximate, they nevertheless are consistent with the most recent numerical estimates.Supported in part by grants from ARO and ONR  相似文献   

18.
A Flory approximant for the exponent describing the end-to-end distance of a self-avoiding walk (SAW) on fractals is derived. The approximant involves the fractal dimensionalities of the backbone and of the minimal path, and the exponent describing the resistance of the fractal. The approximant yields values which are very close to those available from exact and numerical calculations.  相似文献   

19.
20.
Normal and indefinitely-growing (IG) self-avoiding walks (SAWs) are exactly enumerated on several deterministic fractals (the Manderbrot-Given curve with and without dangling bonds, and the 3-simplex). On then th fractal generation, of linear sizeL, the average number of steps behaves asymptotically as N=AL D saw+B. In contrast to SAWs on regular lattices, on these factals IGSAWs and normal SAWs have the same fractal dimensionD saw. However, they have different amplitudes (A) and correction terms (B).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号