Related papers: Jante's law process

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…

The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two…

In this article we study a system of $N$ particles, each of them being defined by the couple of a position (in $\mathbb{R}^d$) and a so-called orientation which is an element of a compact Riemannian manifold. This orientation can be seen as…

An infinite sequence of 0's and 1's evolves by flipping each~1 to a~0 exponentially at rate one. When a~1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1's to the left of the origin, we show that…

A finite point process is characterized by the distribution of the number of points (the size) of the process. In some applications, for example, in the context of packet flows in modern communication networks, it is of interest to infer…

The randomized $k$-number partitioning problem is the task to distribute $N$ i.i.d. random variables into $k$ groups in such a way that the sums of the variables in each group are as similar as possible. The restricted $k$-partitioning…

Let $X=\{X_n: n\in\mathbb{N}\}$ be a linear process in which the coefficients are of the form $a_i=i^{-1}\ell(i)$ with $\ell$ being a slowly varying function at the infinity and the innovations are independent and identically distributed…

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…

We obtain a fast diffusion equation (FDE) as scaling limit of a sequence of zero-range process with symmetric unit rate. Fast diffusion effect comes from the fact that the diffusion coefficient goes to infinity as the density goes to zero.…

As has already been pointed out by Birkhoff and von Neumann, quantum logic can be formulated in terms of projective geometry. In three-dimensional Hilbert space, elementary logical propositions are associated with one-dimensional subspaces,…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type $1$ can enter any…

Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in…

Consider a finite renewal process in the sense that interrenewal times are positive i.i.d. variables and the total number of renewals is a random variable, independent of interrenewal times. A finite point process can be obtained by…

We consider the $n$ body problem defined on surfaces of constant positive curvature. For the 5 and 7 body problem in a collinear symmetric configuration we obtain initial positions which lead to relative equilibria. We give explicitly the…

We investigate a degree-biased cutting process on random recursive trees, where each vertex is deleted with probability proportional to its degree. We establish the splitting property and derive the explicit distribution of the number of…

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…