Related papers: Average pace and horizontal chords
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in…
We consider a random walk in a fixed Z environment composed of two point types: (q,1-q) and (p,1-p) for 1/2<q<p. We study the expected hitting time at N for a given number k of p-drifts in the interval [1,N-1], and find that this time is…
In 1944, Santal\'o asked about the average number of normals through a point of a given convex body. Since then, numerous results appeared in the literature about this problem. The aim of this paper is to give a concise summary of these…
We establish the first complexity analysis for Krawczyk-based certified homotopy tracking. It consists of explicit a priori stepsize bounds ensuring the success of the Krawczyk test, and an iteration count bound proportional to the weighted…
A theorem of L. Caffarelli implies the existence of a map pushing forward a source Gaussian measure to a target measure which is more log-concave than the source one, which contracts Euclidean distance (in fact, Caffarelli showed that the…
Consider the time T_oz when the random walk on a weighted graph started at the vertex o first hits the vertex set z. We present lower bounds for T_oz in terms of the volume of z and the graph distance between o and z. The bounds are for…
This paper establishes calculus upon two physical facts: (1) any average velocity is always between two instantaneous velocities, and (2) the motion of an object is determined once its velocity has been determined. It directly defines…
The answer to this question is no. In fact, in addition to the solution first obtained by Christiaan Huygens in 1658, given by the cycloid, we show that there is an infinite number of tautochrone curves. With this goal, we start by briefly…
Consider the p-system describing the subsonic flow of a fluid in a pipe with section a = a(x). We prove that the resulting Cauchy problem generates a Lipschitz semigroup, provided the total variation of the initial datum and the oscillation…
First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…
In this article on mathematics and music, we explain how one can "listen to motives" as rhythmic interpreters. In the simplest instance which is the one we shall consider, the motive is simply the $H^1$ of the reduction modulo a prime $p$…
In this paper we show a general Strichartz estimate for certain perturbed wave equation, and here we can drop the nontrapping hypothesis and handle trapping obstacles with some loss of derivatives for data in the local energy decay…
The problem of maximizing the $L^p$ norms of chords connecting points on a closed curve separated by arclength $u$ arises in electrostatic and quantum--mechanical problems. It is known that among all closed curves of fixed length, the…
In this paper we establish uniform oscillation estimates on $L^p(X)$ with $p\in(1,\infty)$ for the polynomial ergodic averages. This result contributes to a certain problem about uniform oscillation bounds for ergodic averages formulated by…
On the space of rhythms of arbitrary length with a fixed number of onsets, a self map $F$ is constructed. It is shown that for any rhythm $\mathbf{r}$ of the space there exists a nonnegative integer $k$ such that $F^k(\mathbf{r})$ falls…
It has been argued by Shepard that there is a robust psychological law that relates the distance between a pair of items in psychological space and the probability that they will be confused with each other. Specifically, the probability of…
We consider a general $p$-norm objective for experimental design problems that captures some well-studied objectives (D/A/E-design) as special cases. We prove that a randomized local search approach provides a unified algorithm to solve…
A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…
We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}^2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p^{5/4}$, we prove that $A$…