Related papers: Self-avoiding walks and connective constants in cl…
Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)\sim k^{-\gamma}$, where the degree exponent $\gamma$ describes the extent of…
The scaling behavior of self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by Monte Carlo simulations. We apply the pruned-enriched Rosenbluth chain-growth method (PERM). Our…
Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…
Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…
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…
Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number $\sigma_{n}$ of self-avoiding walks of length $n$ in $G$ from a given vertex. We prove a formula for the connective constant for free products of…
We study the statistical properties of the sampled networks by a random walker. We compare topological properties of the sampled networks such as degree distribution, degree-degree correlation, and clustering coefficient with those of the…
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…
A signed network represents how a set of nodes are connected by two logically contradictory types of links: positive and negative links. In a signed products network, two products can be complementary (purchased together) or substitutable…
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…
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 examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
Scale-free networks with moderate edge dependence experience a phase transition between ultrasmall and small world behaviour when the power law exponent passes the critical value of three. Moreover, there are laws of large numbers for the…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…