Related papers: Self-Avoiding Walk on Fractal Complex Networks: Ex…
We present some exact results for branching and annihilating random walks. We compute the nonuniversal threshold value of the annihilation rate for having a phase transition in the simplest reaction-diffusion system belonging to the…
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…
For a set $S$ of vertices of a graph $G$, a vertex $u$ in $V(G)\setminus S$, and a vertex $v$ in $S$, let ${\rm dist}_{(G,S)}(u,v)$ be the distance of $u$ and $v$ in the graph $G-(S\setminus \{ v\})$. Dankelmann et al. (Domination with…
We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…
The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…
The harmonic measure (or diffusion field or electrostatic potential) near a percolation cluster in two dimensions is considered. Its moments, summed over the accessible external hull, exhibit a multifractal spectrum, which I calculate…
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 compute the exponent gamma for self-avoiding walks in three dimensions. We get gamma = 1.1575 +- 0.0006 in agreement with renormalization-group predictions. Earlier Monte Carlo and exact-enumeration determinations are now seen to be…
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $\bbZ^d$. More precisely, we count $Z_N$ the number of self-avoiding paths of length $N$ on the infinite cluster,…
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…
Slowly driven dissipative systems may evolve to a critical state where long periods of apparent equilibrium are punctuated by intermittent avalanches of activity. We present a self-organized critical model of punctuated equilibrium behavior…
Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in…
Fractals emerge everywhere in nature, exhibiting intricate geometric complexities through the self-organizing patterns that span across multiple scales. Here, we investigate beyond steady-states the interplay between this geometry and the…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
We study a random circuit model of constrained fracton dynamics, in which particles on a one-dimensional lattice undergo random local motion subject to both charge and dipole moment conservation. The configuration space of this system…
We give an overview of results on critical phenomena in 4 dimensions, obtained recently using a rigorous renormalisation group method. In particular, for the $n$-component $|\varphi|^4$ spin model in dimension 4, with small coupling…
We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \subseteq V$, it is asked if there exists a minimal vertex cover (resp.\ maximal independent set)…
In this paper we analyse random walk on a fractal structure, specifi- cally fractal curves, using the recently develped calculus for fractal curves. We consider only unbiased random walk on the fractal stucture and find out the…