Related papers: On the support of the Grover walk on higher-dimens…
This paper investigates the motion of falling leaves through modeling using papers and the corresponding data collected from more than four thousands experiments. Two series of experiments were designed in order to study the relationship…
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…
In this paper we give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, $g$, and irregular ones with girth 8, where $a$ is the size, $b$ is the number of degree-one…
Let $\mathbb{T}$ denote a rooted $b$-ary tree and let $\{S_v\}_{v\in \mathbb{T}}$ denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
For systems of one-component interacting oscillators on the d-dimensional lattice, d>1, whose potential energy besides a large nearest-neighbour (n-n) ferromagnetic translation-invariant quadratic term contains small non-nearest-neighbour…
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…
Although wheeled robots have been predominant for planetary exploration, their geometry limits their capabilities when traveling over steep slopes, through rocky terrains, and in microgravity. Legged robots equipped with grippers are a…
We describe a highly efficient numerical scheme for finding two-sided bounds for the eigenvalues of the fractional Laplace operator (-Delta)^{alpha/2} in the unit ball D in R^d, with a Dirichlet condition in the complement of D. The…
In this paper a geometric field theory of dislocation dynamics and finite plasticity in single crystals is formulated. Starting from the multiplicative decomposition of the deformation gradient into elastic and plastic parts, we use…
We show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on $n$ vertices is $(1+o(1))\tfrac{54}{n^3}$. This minimum is achieved asymptotically by a double kite graph. Consequently, this leads to sharp…
For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove…
We consider the minimization of non-convex quadratic forms regularized by a cubic term, which exhibit multiple saddle points and poor local minima. Nonetheless, we prove that, under mild assumptions, gradient descent approximates the…
It is pointed out that the three established adiabatic invariants are separating invariants in the sense of Liouville. It is widely claimed that no more than three adiabatic invariants can exist for the motion of a point charge. However,…
Monte Carlo results for the low-lying glueball spectrum using an improved, anisotropic action are presented. Ten simulations at lattice spacings ranging from 0.2 to 0.4 fm and two different anisotropies have been performed in order…
In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…
Gravitational instantons ''Lambda-instantons'' are defined here for any given value Lambda of the cosmological constant. A multiple of the Euler characteristic appears as an upper bound for the de Sitter action and as a lower bound for a…
We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…
We study the winding angles of random and self-avoiding walks on square and cubic lattices with number of steps $N$ ranging up to $10^7$. We show that the mean square winding angle $\langle\theta^2\rangle$ of random walks converges to the…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…