Related papers: The fixed irreducible bridge ensemble for self-avo…
We consider self-avoiding walks terminally attached to an impenetrable surface at which they can adsorb. We call the vertices farthest away from this plane the top vertices and we consider applying a force at the plane containing the top…
The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…
We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…
We study three-dimensional self-avoiding walks in presence of a one-dimensional excluded region. We show the appearance of a universal sub-leading exponent which is independent of the particular shape and symmetries of the excluded region.…
In this paper, we provide a framework of estimates for describing 2D scaling limits by Schramm's SLE curves. In particular, we show that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a…
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. In earlier work of Grimmett and Li, a locality theorem was proved for connective…
We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…
Wall turbulence is a ubiquitous phenomenon in nature and engineering application, yet predicting such turbulence is difficult due to its complexity. High-Reynolds-number turbulence, which includes most practical flows, is particularly…
Kemeny's constant of a simple connected graph $G$ is the expected length of a random walk from $i$ to any given vertex $j \neq i$. We provide a simple method for computing Kemeny's constant for 1-separable via effective resistance methods…
This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on…
We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
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 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 paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…
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…
Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…
The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square…
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 enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…