Related papers: Drawing with Distance
Interacting urns with exponential reinforcement were introduced and studied in Launay (2011). As its parameter $\rho$ tends to $\iy$, this reinforcement mechanism converges to the "generalized" reinforcement, in which the probability of…
This note exposes the differential topology and geometry underlying some of the basic phenomena of optimal transportation. It surveys basic questions concerning Monge maps and Kantorovich measures: existence and regularity of the former,…
The Total Colouring Conjecture suggests that $\Delta+3$ colours ought to suffice in order to provide a proper total colouring of every graph $G$ with maximum degree $\Delta$. Thus far this has been confirmed up to an additive constant…
A subset of a metric space is a k-distance set if there are exactly k non-zero distances occuring between points. We conjecture that a k-distance set in a d-dimensional Banach space (or Minkowski space), contains at most (k+1)^d points,…
The quantale of distance distributions is of fundamental importance for understanding probabilistic metric spaces as enriched categories. Motivated by the categorical interpretation of partial metric spaces, we are led to investigate the…
We consider the generalization of the P\'olya urn scheme with possibly infinite many colors as introduced in \cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors, we prove almost sure convergence of the urn…
Sufficient conditions are developed for a class of generalized Polya urn schemes ensuring exchangeability. The extended class includes the Blackwell-MacQueen Polya urn and the urn schemes for the two-parameter Poisson-Dirichlet process and…
In the past various distance based colorings on planar graphs were introduced. We turn our focus to three of them, namely $2$-distance coloring, injective coloring, and exact square coloring. A $2$-distance coloring is a proper coloring of…
We consider the coloring of certain distance graphs on the Euclidean plane. Namely, we ask for the minimal number of colors needed to color all points of the plane in such a way that pairs of points at distance in the interval $[1,b]$ get…
We address the problem of which planar sets can be drawn with a pencil and eraser. The pencil draws any union of black open unit disks in the plane $\mathbb{R}^2$. The eraser produces any union of white open unit disks. You may switch tools…
For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…
There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for…
In this paper, the statistical properties of Newton s method algorithm output in a specific case have been studied. The relative frequency density of this sample converges to a well-defined function, prompting us to explore its…
It is well known that in a small P\'olya urn, i.e., an urn where second largest real part of an eigenvalue is at most half the largest eigenvalue, the distribution of the numbers of balls of different colours in the urn is asymptotically…
We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
Distances between quantum states are reviewed within the framework of the tomographic-probability representation. Tomographic approach is based on observed probabilities and is straightforward for data processing. Different states are…
In this paper, we study the metric distortion of deterministic social choice rules that choose a winning candidate from a set of candidates based on voter preferences. Voters and candidates are located in an underlying metric space. A voter…
A flat membrane with given shape is displayed; two points in the membrane are randomly selected; the probability that the separation between the points have a specified value is sought. A simple method to evaluate the probability density is…
We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-called General Model the answer to a query shows if all the…