相关论文: Distribution of boundary points of expansion and a…

We study nearest neighbor random walks on fixed environments of $\mathbb{Z}$ composed of two point types : $(1/2,1/2)$ and $(p,1-p)$ for $p>1/2$. We show that for every environment with density of $p$ drifts bounded by $\lambda$ we have…

We consider an Erdos-Renyi random graph consisting of N vertices connected by randomly and independently drawing an edge between every pair of them with probability c/N so that at N->infinity one obtains a graph of finite mean degree c. In…

We study records generated by Brownian particles in one dimension. Specifically, we investigate an ordinary random walk and define the record as the maximal position of the walk. We compare the record of an individual random walk with the…

We consider one-dimensional discrete-time random walks (RWs) of $n$ steps, starting from $x_0=0$, with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the important case of L\'evy flights. We study the statistics…

We investigate a moving boundary problem for a Brownian particle on the semi-infinite line in which the boundary moves by a distance proportional to the time between successive collisions of the particle and the boundary. Phenomenologically…

We prove that the lonely runner conjecture holds for nine runners. Our proof is based on a couple of improvements of the method we used to prove the conjecture for eight runners.

A variety of boundary value problems in linear transport theory are expressed as a diffusion equation of the two-way, or forward-backward, type. In such problems boundary data are specified only on part of the boundary, which introduces…

We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the…

In this paper we consider the uniformity testing problem for high-dimensional discrete distributions (multinomials) under sparse alternatives. More precisely, we derive sharp detection thresholds for testing, based on $n$ samples, whether a…

We introduce a system of Brownian particles, each absorbed upon hitting an associated moving boundary. The boundaries are determined by the conditional probabilities of the particles being absorbed before some final time horizon, given the…

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

In the setting of a metric space equipped with a doubling measure and supporting a Poincar\'e inequality, and based on results by Bj\"orn and Shanmugalingam (2007), we show that functions of bounded variation can be extended from any…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

We study the parabolic obstacle problem $$\lap u-u_t=f\chi_{\{u>0\}}, \quad u\geq 0,\quad f\in L^p \quad \mbox{with}\quad f(0)=1$$ and obtain two monotonicity formulae, one that applies for general free boundary points and one for singular…

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

In this paper we consider the Brownian motion with jump boundary and present a new proof of a recent result of Li, Leung and Rakesh concerning the exact convergence rate in the one-dimensional case. Our methods are different and mainly…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

Let G be a group. We say that G has spread r if for any set of distinct elements {x1,..., xr}\subset G there exists an element y\in G with the property that <xi, y>=G for every 0<i<r+1. Few bounds on the spread of finite simple groups are…