Related papers: Positive speed self-avoiding walks on graphs with …
We investigate the dynamics of a single tracer exploring a course of fixed obstacles in the vicinity of the percolation transition for particles confined to the infinite cluster. The mean-square displacement displays anomalous transport,…
The statistical basis for conventional full-waveform inversion (FWI) approaches is commonly associated with Gaussian statistics. However, errors are rarely Gaussian in non-linear problems like FWI. In this work, we investigate the…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
The critical behaviour of directed self-avoiding walks is studied on parabolic-like systems with a free boundary at x=\pm Ct^\alpha. Using a scaling argument, 1/C is shown to be a marginal variable when \alpha=\nu_\perp/\nu_\parallel=1/2,…
Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1,…
Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…
A positive path in the linear symplectic group $\Sp(2n)$ is a smooth path which is everywhere tangent to the positive cone. These paths are generated by negative definite (time-dependent) quadratic Hamiltonian functions on Euclidean space.…
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step,…
We construct travelling wave graphs of the form $z=-ct+\phi(x)$, $\phi: x \in \mathbb{R}^{N-1} \mapsto \phi(x)\in \mathbb{R}$, $N \geq 2$, solutions to the $N$-dimensional forced mean curvature motion $V_n=-c_0+\kappa$ ($c\geq c_0$) with…
In this paper, we investigate the properties of the Sliced Wasserstein Distance (SW) when employed as an objective functional. The SW metric has gained significant interest in the optimal transport and machine learning literature, due to…
On a connected finite graph, we propose an evolution of weights including Ollivier's Ricci flow as a special case. During the evolution process, on each edge, the speed of change of weight is exactly the difference between the Wasserstein…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…
We show that random walks on semisimple algebraic groups do not concentrate on proper algebraic subvarieties with uniform exponential rate of anti-concentration. This is achieved by proving a uniform spectral gap for quasi-regular…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
We consider the Weyl quantum walk in 3+1 dimensions, that is a discrete-time walk describing a particle with two internal degrees of freedom moving on a Cayley graph of the group $\mathbb Z^3$, that in an appropriate regime evolves…
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate F that is different from the rate f for steps across small-world…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…