Related papers: Self-avoiding walks and polygons on hyperbolic gra…

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $\delta n$ where $\delta>0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymptotic expression for the cover time $C_G$ of $G$…

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…

We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…

Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…

We show the existence of a trace process at infinity for random walks on hyperbolic groups of conformal dimension < 2 and relate it to the existence of a reflecting random walk. To do so, we employ the theory of Dirichlet forms which…

We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the…

We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…

We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by…

Let $G$ be a quasi-transitive, locally finite, connected graph rooted at a vertex $o$, and let $c_n(o)$ be the number of self-avoiding walks of length $n$ on $G$ starting at $o$. We show that if $G$ has only thin ends, then the generating…

We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean…

The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…

We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…

In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…

We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…

In this note we show that percolation on non-amenable Cayley graphs of high girth has a phase of non-uniqueness, i.e., p_c < p_u. Furthermore, we show that percolation and self-avoiding walk on such graphs have mean-field critical…

Folklore has, that the universal scaling properties of linear polymers in disordered media are well described by the statistics of self-avoiding walks Folklore has, that the universal scaling properties of linear polymers in disordered…

We show that the asymptotic entropy of a random walk on a nonelementary hyperbolic group, with symmetric and bounded increments, is differentiable and we identify its derivative as a correlation. We also prove similar results for the rate…

Following similar analysis to that in Lacoin (PTRF 159, 777-808, 2014), we can show that the quenched critical point for self-avoiding walk on random conductors on the d-dimensional integer lattice is almost surely a constant, which does…

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…