Related papers: Interacting partially directed self-avoiding walk:…

It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $\kappa = 8/3.$ We consider SAWs in…

We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a…

Feature interactions can contribute to a large proportion of variation in many prediction models. In the era of big data, the coexistence of high dimensionality in both responses and covariates poses unprecedented challenges in identifying…

We consider self-avoiding walk, percolation and the Ising model with long and finite range. By means of the lace expansion we prove mean-field behavior for these models if $d>2(\alpha\wedge2)$ for self-avoiding walk and the Ising model, and…

Doubly-intractable posterior distributions arise in many applications of statistics concerned with discrete and dependent data, including physics, spatial statistics, machine learning, the social sciences, and other fields. A specific…

We investigate semi-stiff interacting self-avoiding walks on the square lattice with random impurities. The walks are simulated using the flatPERM algorithm and the inhomogeneity is realised as a random fraction of the lattice that is…

Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from 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…

This article proposes a new way of deriving mean-field exponents for the weakly self-avoiding walk model in dimensions $d>4$. Among other results, we obtain up-to-constant estimates for the full-space and half-space two-point functions in…

We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

We study the shrinking Pearson random walk in two dimensions and greater, in which the direction of the Nth is random and its length equals lambda^{N-1}, with lambda<1. As lambda increases past a critical value lambda_c, the endpoint…

Inverse probability weighting (IPW) is widely used in many areas when data are subject to unrepresentativeness, missingness, or selection bias. An inevitable challenge with the use of IPW is that the IPW estimator can be remarkably unstable…

We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…

The lace expansion is a powerful tool for analysing the critical behaviour of self-avoiding walks and percolation. It gives rise to a recursion relation which we abstract and study using an adaptation of the inductive method introduced by…

Axis-driven random walks were introduced by P. Andreoletti and P. Debs [AD23] to provide a rough description of the behaviour of a particle trapped in a localized force field. In contrast to their work, we examine the scenario where a…

In this paper we study the discrete approximation to Brownian motion with varying dimension (BMVD in abbreviation) introduced in [4] by continuous time random walks on square lattices. The state space of BMVD contains a $2$-dimensional…

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

We obtain sharp upper and lower bounds for the moderate deviations of the volume of the range of a random walk in dimension five and larger. Our results encompass two regimes: a Gaussian regime for small deviations, and a stretched…

We consider a model of loop-erased random walks on the finite pre-Sierpinski gasket which permits rigorous analysis. We prove the existence of the scaling limit and show that the path of the limiting process is almost surely self-avoiding,…