相关论文: End-to-end Distance from the Green's Function for …
One of the most animated themes of multidimensional persistence is the comparison between invariants. The matching distance between persistent Betti numbers functions (or rank invariants), is among the most studied metrics in this context,…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
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…
We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…
The present paper establishes equivalence between uniform rectifiability of the boundary of a domain and the property that the Green function for elliptic operators is well approximated by affine functions (distance to the hyperplanes). The…
The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…
We consider a family of random walks killed at the boundary of the Weyl chamber of the dual of $\rm{Sp}(4)$, which in addition satisfies the following property: for any $n\geq 3$, there is in this family a walk associated with a reflection…
We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force, concentrating on the case of the square lattice. Using series analysis methods we investigate the…
This paper investigates the asymptotic behavior of Green functions associated to partially homogeneous random walks in the quadrant $Z_+^2$. There are four possible distributions for the jumps of these processes, depending on the location…
We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…
We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…
It is shown that the Green's function on a finite lattice in arbitrary space dimension can be obtained from that of an infinite lattice by means of translation operator. Explicit examples are given for one- and two-dimensional lattices.
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…
We study the lattice random walk dynamics in a heterogeneous space of two media separated by an interface and having different diffusivity and bias. Depending on the position of the interface, there exist two exclusive ways to model the…
Complex models used to describe biological processes in epidemiology and ecology often have computationally intractable or expensive likelihoods. This poses significant challenges in terms of Bayesian inference but more significantly in the…
The recent realization of a "Levy glass" (a three-dimensional optical material with a Levy distribution of scattering lengths) has motivated us to analyze its one-dimensional analogue: A linear chain of barriers with independent spacings s…
We introduce a persistent random walk model with finite velocity and self-reinforcing directionality, which explains how exponentially distributed runs self-organize into truncated L\'evy walks observed in active intracellular transport by…
Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…
We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
The L\'evy hypothesis states that inverse square L\'evy walks are optimal search strategies because they maximise the encounter rate with sparse, randomly distributed, replenishable targets. It has served as a theoretical basis to interpret…