Self-avoiding walks on random fractal environments

Self-avoiding random walks (SAWs) are studied on several hierarchical lattices in a randomly disordered environment. An analytical method to determine whether their fractal dimensionD _saw is affected by disorder is introduced. Using this method, it is found that for some lattices,D _saw is unaffected by weak disorder; while for othersD _saw changes even for infinitestimal disorder. A weak disorder exponent is defined and calculated analytically [ measures the dependence of the variance in the partition function (or in the effective fugacity per step)vL on the end-to-end distance of the SAW,L]. For lattices which are stable against weak disorder (<0) a phase transition exists at a critical valuev=v ^* which separates weak- and strong-disorder phases. The geometrical properties which contribute to the value of are discussed.     

Self-avoiding walks with geometrical constraints

We consider self-avoiding walks on aD-dimensional hypercubic lattice, confined to a slab geometry and confined to a half-space. We present a proof of the existence of a connective constant for the slab geometry and review some corresponding results for the half-space. We also discuss the way in which scaling arguments can be used to give stronger, but nonrigorous, results.Presented at the Symposium on Random Walks, Gaithersburg, MD, June 1982.     

Self-avoiding random walks on the hexagonal lattice

We use the algorithm recently introduce by A. Berretti and A. D. Sokal to compute numerically the critical exponents for the self-avoiding random walk on the hexagonal lattice. We find=1.3509±0.0057±0.0023v=0.7580±0.0049±0.0046=0.519±0.082±0.077 where the first error is the systematic one due to corrections to scaling and the second is the statistical error. For the effective coordination number we find=1.84779±0.00006±0.0017 The results support the Nienhuis conjecture=43/32 and provide a rough numerical check of the hyperscaling relationdv=2–. An additional analysis, taking the Nienhuis value of=(2+2^1/2)^1/2 for granted, gives=1.3459±0.0040±0.0008     

Different types of self-avoiding walks on deterministic fractals

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).     

Theory of self-avoiding walks on percolation fractals

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.     

Statistical mechanics of random paths on disordered lattices

The dependence of the universality class on the statistical weight of unrestricted random paths is explicitly shown both for deterministic and statistical fractals such as the incipient infinite percolation cluster. Equally weighted paths (ideal chain) and kinetically generated paths (random walks) belong, in general, to different universality classes. For deterministic fractals exact renormalization group techniques are used. Asymptotic behaviors for the end-to-end distance ranging from power to logarithmic (localization) laws are observed for the ideal chain. In all these cases, random walks in the presence of nonperfect traps are shown to be in the same universality class of the ideal chain. Logarithmic behavior is reflected insingular renormalization group recursions. For the disordered case, numerical transfer matrix techniques are exploited on percolation clusters in two and three dimensions. The two-point correlation function scales with critical exponents not obeying standard scaling relations. The distribution of the number of chains and the number of chains returning to the starting point are found to be well approximated by a log-normal distribution. The logmoment of the number of chains is found to have an essential type of singularity consistent with the log-normal distribution. A non-self-averaging behavior is argued to occur on the basis of the results.     

Different self-avoiding walks on percolation clusters: A small-cell real-space renormalization-group study

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.     

Self-avoiding walks and trees in spread-out lattices

LetG _R be the graph obtained by joining all sites ofZ ^d which are separated by a distance of at mostR. Let (G _R ) denote the connective constant for counting the self-avoiding walks in this graph. Let (G _R ) denote the coprresponding constant for counting the trees embedded inG _R . Then asR, (G _R ) is asymptotic to the coordination numberk _R ofG _R , while (G _R ) is asymptotic toek _R. However, ifd is 1 or 2, then (G _R )-k _R diverges to –.Dedicated to Oliver Penrose on this occasion of his 65th birthday.     

Critical behavior of self-avoiding walks on fractals

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.     

Two-dimensional oriented self-avoiding walks with parallel contacts

Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the shape of the partition function and show that this system features of first-order phase transition from a free phase to a tight-spiral phase at _s =log(), where -2.638 is the growth constant for SAWs. With Monte Carlo simulations we show that parallel contacts happen predominantly between a step close to the end of the OSAW and another step nearby; this appears to cause the expected number of parallel contacts to saturate at large lengths of the OSAW.     

Return probability for random walks on scale-free complex trees

The time course of random processes usually differs depending on the topology of complex networks which are a substrate for the process. However, as this Letter demonstrates, the first-return as well as the survival probabilities for random walks on the scale-free (SF) trees decay in time according to the same invariant power-law behavior. This means that both quantities are independent of the node power-law degree distributions which are distinguished by different scaling exponents. It is also shown here that the crucial property of the networks, affecting the dynamics of random walks, is their tree-like topology and not SF architecture. All analytical results quantifying these predictions have been verified through extensive computer simulations.     

Correlated random walks

We present a new approach to the calculation of first passage statistics for correlated random walks on one-dimensional discrete systems. The processes may be non-Markovian and also nonstationary. A number of examples are used to demonstrate the theory.     

Persistent random walks in a one-dimensional random environment

Central limit theorems are obtained for persistent random walks in a onedimensional random environment. They also imply the central limit theorem for the motion of a test particle in an infinite equilibrium system of point particles where the free motion of particles is combined with a random collision mechanism and the velocities can take on three possible values.Work supported by the Central Research Fund of the Hungarian Academy of Sciences (grant No. 476/82).     

Dynamical exponents for one-dimensional random-random directed walks

The dynamical exponents of the coordinate and of the mean square displacement are explicitly calculated in the case of a directed random walk on a one-dimensional random lattice. Moreover, it is shown that, in the dynamical phase where the coordinate increases slower thant, the latter is not a self-averaging quantity.     

A hierarchical model for random walks in random media

We show that the random walk generated by a hierarchical Laplacian in ^d has standard diffusive behavior. Moreover, we show that this behavior is stable under a class of random perturbations that resemble an off-diagonal disordered lattice Laplacian. The density of states and its asymptotic behavior around zero energy are computed: singularities appear in one and two dimensions.     

Directed random walks in random environments

We use holding time methods to study the asymptotic behavior of pure birth processes with random transition rates. Both the normal and slow approaches to infinity are studied. Fluctuations are shown to obey the central limit theorem for almost all sample-transition rates. Our results are stronger, and our proofs simpler, then those of recently published studies.     

Symmetric random walks in random environments

We consider a random walk on thed-dimensional lattice ^d where the transition probabilitiesp(x,y) are symmetric,p(x,y)=p(y,x), different from zero only ify–x belongs to a finite symmetric set including the origin and are random. We prove the convergence of the finite-dimensional probability distributions of normalized random paths to the finite-dimensional probability distributions of a Wiener process and find our an explicit expression for the diffusion matrix.     

The Renormalization Group and Optimization of Entropy

We illustrate the possible connection that exists between the extremal properties of entropy expressions and the renormalization group (RG) approach when applied to systems with scaling symmetry. We consider three examples: (1) Gaussian fixed-point criticality in a fluid or in the capillary-wave model of an interface; (2) Lévy-like random walks with self-similar cluster formation; and (3) long-ranged bond percolation. In all cases we find a decreasing entropy function that becomes minimum under an appropriate constraint at the fixed point. We use an equivalence between random-walk distributions and order-parameter pair correlations in a simple fluid or magnet to study how the dimensional anomaly at criticality relates to walks with long-tailed distributions.     

Anisotropic random walks and asymptotically one-dimensional diffusion onabc-gaskets

Asymptotically one-dimensional diffusion processes are studied on the class of fractals calledabc-gaskets. The class is a set of certain variants of the Sierpiński gasket containing infinitely many fractals without any nondegenerate fixed point of renoramalization maps. While the “standard” method of constructing diffusions on the Sierpiński gasket and on nested fractals relies on the existence of a nondegenerate fixed point and hence it is not applicable to allabc-gaskets, the asymptotically one-dimensional diffusion is constructed on anyabc-gasket by means of an unstable degenerate fixed point. To this end, the generating functions for numbers of steps of anisotropic random walks on theabc-gaskets are analyzed, along the line of the authors' previous studies. In addition, a general stategy of handling random walk sequences with more than one parameter for the construction of asymptotically one-dimensional diffusion is proposed.     

First passage time problems for one-dimensional random walks

This note contains a development of the theory of first passage times for one-dimensional lattice random walks with steps to nearest neighbor only. The starting point is a recursion relation for the densities of first passage times from the set of lattice points. When these densities are unrestricted, the formalism allows us to discuss first passage times of continuous time random walks. When they are negative exponential densities we show that the resulting equation is the adjoint of the master equation. This is the lattice analog of a correspondence well known for systems describable by a Fokker-Planck equation. Finally we discuss first passage problems for persistent random walks in which at each step the random walker continues in the same direction as the preceding step with probability a or reverses direction with probability 1–