Related papers: Self-Avoiding Walk on Fractal Complex Networks: Ex…

We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…

We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…

We investigate both analytically and numerically the ensemble of minimum-weight loops and paths in the negative-weight percolation model on random graphs with fixed connectivity and bimodal weight distribution. This allows us to study the…

Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, assigning to every vertex an integer, called height. Bridges…

We say that a graph $G=(V,E)$ on $n$ vertices is a $\beta$-expander for some constant $\beta>0$ if every $U\subseteq V$ of cardinality $|U|\leq \frac{n}{2}$ satisfies $|N_G(U)|\geq \beta|U|$ where $N_G(U)$ denotes the neighborhood of $U$.…

We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…

We study directed, weighted graphs $G=(V,E)$ and consider the (not necessarily symmetric) averaging operator $$ (\mathcal{L}u)(i) = -\sum_{j \sim_{} i}{p_{ij} (u(j) - u(i))},$$ where $p_{ij}$ are normalized edge weights. Given a vertex $i…

We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property…

This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…

The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…

We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…

We consider self-avoiding walks (SAWs) 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…

Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…

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…

Diffusion is modeled on the recently proposed Hanoi networks by studying the mean- square displacement of random walks with time, <r^2>~t^{2/d_w}. It is found that diffusion - the quintessential mode of transport throughout Nature -…

Results of a numerically exact transfer matrix calculation for the model of Interacting Self-Avoiding Trails are presented. The results lead to the conclusion that, at the collapse transition, Self-Avoiding Trails are in the same…

We develop a systematic analytic approach to the problem of branching and annihilating random walks, equivalent to the diffusion-limited reaction processes 2A->0 and A->(m+1)A, where m>=1. Starting from the master equation, a…

We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…

L\'evy-type walks with correlated jumps, induced by the topology of the medium, are studied on a class of one-dimensional deterministic graphs built from generalized Cantor and Smith-Volterra-Cantor sets. The particle performs a standard…

Polymer's network is treated as an anisotropic fractal with fractional dimensionality D = 1 + \epsilon close to one. Percolation model on such a fractal is studied. Using the real space renormalization group approach of Migdal and Kadanoff…