Related papers: Lines in Every Direction with No ee-Random Points
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
Uncertain dynamic obstacles, such as pedestrians or vehicles, pose a major challenge for optimal robot navigation with safety guarantees. Previous work on motion planning has followed two main strategies to provide a safe bound on an…
Maximization of the path information entropy is a clear prescription for constructing models in non-equilibrium statistical mechanics. Here it is shown that, following this prescription under the assumption of arbitrary instantaneous…
We consider TASEP in continuous time with non-random initial conditions and arbitrary fixed density of particles rho. We show GOE Tracy-Widom universality of the one-point fluctuations of the associated height function. The result phrased…
We consider a large community of individuals who mix strongly and meet in pairs to bet on a coin toss. We investigate the asset distribution of the players involved in this zero-sum repeated game. Our main result is that the asset…
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating that "a real is c.e. and random iff it is the halting…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
Exponential of exponential of almost every line in the complex plane is dense in the plane. On the other hand, for lines through any point, for a set of angles of Hausdorff dimension one, exponential of exponential of a line with angle from…
We study the optimization landscape of the log-likelihood function and the convergence of the Expectation-Maximization (EM) algorithm in latent Gaussian tree models, i.e. tree-structured Gaussian graphical models whose leaf nodes are…
Let $\{X_n\}_{n=0}^{\infty}$ be a stationary real-valued time series with unknown distribution. Our goal is to estimate the conditional expectation of $X_{n+1}$ based on the observations $X_i$, $0\le i\le n$ in a strongly consistent way.…
We show that any asymptotically locally Euclidean (ALE) metric which is obstruction-flat or extended obstruction-flat must be ALE of a certain optimal order. Moreover, our proof applies to very general elliptic systems and in any dimension…
A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chv\'atal conjectured in 2008 that a similar result can be achieved in the broader context of finite metric spaces. This conjecture…
Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into…
In a recent paper of Akhunzhanov and Shatskov the two-dimensional Dirichlet spectrum with respect to Euclidean norm was defined. We consider an analogous definition for arbitrary norms on $\mathbb{R}^2$ and prove that, for each such norm,…
We consider the evolution of a connected set in Euclidean space carried by a periodic incompressible stochastic flow. While for almost every realization of the random flow at time t most of the particles are at a distance of order sqrt{t}…
This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of $N$ observations drawn from it. The central finding is that the $N$ sorted sample points partition the real line…
We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
In optimal stopping problems, a Markov structure guarantees Markovian optimal stopping times (first exit times). Surprisingly, there is no analogous result for Markovian stopping games once randomization is required. This paper addresses…