Related papers: Fractality and Topology of Self-Avoiding Walks
We theoretically investigate the effects of surface acoustic waves (SAWs) on an electric-field-driven sliding motion of a one-dimensional charge density wave (CDW), which is initially pinned by impurities. By numerically analyzing an…
We calculate the connective constant for self-avoiding walks on the simple cubic lattice to unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that \mu = 4.684 039 931(27). Our method also provides…
We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
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…
We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…
This paper conceptualizes the Deep Weight Spaces (DWS) of neural architectures as hierarchical, fractal-like, coarse geometric structures observable at discrete integer scales through recursive dilation. We introduce a coarse group action…
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…
Clouds in observations are fractals: they show self-similarity across scales ranging from one to 1000 km. This includes individual storms and large-scale cloud structures typical of organised convection. It is not known whether global…
We study the scaling properties of long-range loop-erased random walks (LR-LERW), where the underlying random walker performs L\'evy-flight-like jumps with a power-law step-length distribution $P(\mathbf{r})\sim |\mathbf{r}|^{-(d+\sigma)}$.…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
Tip-driven growth processes underlie the development of many plants. To date, tip-driven growth processes have been modelled as an elongating path or series of segments without taking into account lateral expansion during elongation.…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…
A two-dimensional square-lattice model for the formation of secondary structures in proteins, the hydrogen-bonding model, is extended to include the effects of solvent quality. This is achieved by allowing configuration-dependent…
Topological properties of crystalline ice structures are studied by means of self-avoiding walks on their H-bond networks. The number of self-avoiding walks, C_n, for eight ice polymorphs has been obtained by direct enumeration up to walk…
We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…
We introduce the combinatorial optimization problem Time Disjoint Walks (TDW), which has applications in collision-free routing of discrete objects (e.g., autonomous vehicles) over a network. This problem takes as input a digraph $G$ with…
Internal diffusion-limited aggregation is a growth model based on random walk in Z^d. We study how the shape of the aggregate depends on the law of the underlying walk, focusing on a family of walks in Z^2 for which the limiting shape is a…
We consider random self-avoiding walks between two points on the boundary of a finite subdomain of Z^d (the probability of a self-avoiding trajectory gamma is proportional to mu^{-length(gamma)}). We show that the random trajectory becomes…