相关论文: Scaling Concepts in Graph Thoery: Self-Avoiding Wa…

We study the self-avoiding walk on complex fractal networks called the (u,v)-flower by mapping it to the N-vector model in a generating function formalism. First, we analytically calculate the critical exponent {\nu} and the connective…

We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…

We show that fractality in complex networks arises from the geometric self-similarity of their built-in hierarchical community-like structure, which is mathematically described by the scale-invariant equation for the masses of the boxes…

There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…

The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…

Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…

In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…

We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…

This is a pedagogical review of the subject of linear polymers on deterministic finitely ramified fractals. For these, one can determine the critical properties exactly by real-space renormalization group technique. We show how this is used…

Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…

We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…

Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

The scaling behavior of linear polymers in disordered media, modelled by self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by numerical simulations. We apply the pruned-enriched…

We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…

We calculate the fractal dimension $d_{\rm f}$ of critical curves in the $O(n)$ symmetric $(\vec \phi^2)^2$-theory in $d=4-\varepsilon$ dimensions at 6-loop order. This gives the fractal dimension of loop-erased random walks at $n=-2$,…

The self-avoiding walk on the square site-diluted correlated percolation lattice is considered. The Ising model is employed to realize the spatial correlations of the metric space. As a well-accepted result, the (generalized) Flory's mean…

We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…

We study asymptotic properties of diffusion and other transport processes (including self-avoiding walks and electrical conduction) on large randomly branched polymers using renormalized dynamical field theory. We focus on the swollen phase…

Self-similarity is a property of fractal structures, a concept introduced by Mandelbrot and one of the fundamental mathematical results of the 20th century. The importance of fractal geometry stems from the fact that these structures were…