相关论文: Hyperbolic self avoiding walk
We relate the expected hyperbolic length of the perimeter of the convex hull of the trajectory of Brownian motion in the hyperbolic plane to an expectation of a certain exponential functional of a one-dimensional real-valued Brownian…
We propose the metric notion of strong hyperbolicity as a way of obtaining hyperbolicity with sharp additional properties. Specifically, strongly hyperbolic spaces are Gromov hyperbolic spaces that are metrically well-behaved at infinity,…
Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…
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,…
Passive dynamic walking is a useful model for investigating the mechanical functions of the body that produce energy-efficient walking. The basin of attraction is very small and thin, and it has a fractal-like shape; this explains the…
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…
We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…
We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…
We present a probabilistic theory of random walks in turbid media with non-scattering regions. It is shown that important characteristics such as diffusion constants, average step lengths, crossing statistics and void spacings can be…
We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is…
We consider $d$ independent walkers in the same random environment in $\mathbb{Z}$. Our assumption on the law of the environment is such that a single walker is transient to the right but subballistic. We show that - no matter what $d$ is -…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…
It has been proved by Kempe that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun for a slightly different property, namely, the…
We consider random walks on a non-elementary hyperbolic group endowed with a word distance. To a probability measure on the group are associated two numerical quantities, the rate of escape and the entropy. On the set of admissible…
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…
Networks found in the real-world are numerous and varied. A common type of network is the heterogeneous network, where the nodes (and edges) can be of different types. Accordingly, there have been efforts at learning representations of…
We study the growth of hyperbolic type distances in starlike domains. We derive estimates for various hyperbolic type distances and consider the asymptotic sharpness of the estimates.
The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scaling with the HC dimension. Recent numerical analyses…