Related papers: Jante's law process
This work deals with a class of one-dimensional measure-valued kinetic equations, which constitute extensions of the Kac caricature. It is known that if the initial datum belongs to the domain of normal attraction of an \alpha-stable law,…
The relativistic Faddeev equation for three-nucleon scattering is formulated in momentum space and directly solved in terms of momentum vectors without employing a partial wave decomposition. The equation is solved through Pad\'e summation,…
The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. In this paper, first we state and prove a…
We define a family of asymmetric processes for particles on a one-dimensional lattice, depending on a continuous parameter $\lambda \in [0,1] $, interpolating between the completely asymmetric processes [1] (for $\lambda =1$) and the n=1…
A linear Boltzmann equation is interpreted as the forward equation for the probability density of a Markov process (K(t), Y(t)), where K(t) is a autonomous reversible jump process, with waiting times between two jumps with finite…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
Odlyzko has computed a data set listing more than $10^9$ successive Riemann zeros, starting at a zero number beyond $10^{23}$. The data set relates to random matrix theory since, according to the Montgomery-Odlyzko law, the statistical…
We prove that the solution of the Kac analogue of Boltzmann's equation can be viewed as a probability distribution of a sum of a random number of random variables. This fact allows us to study convergence to equilibrium by means of a few…
We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.
We develop a theory of insertion and deletion tolerance for point processes. A process is insertion-tolerant if adding a suitably chosen random point results in a point process that is absolutely continuous in law with respect to the…
The asymmetric exclusion process on a ring in one-dimension is considered with a single defect particle. The steady state has previously been solved by a matrix product method. Here we use the Bethe ansatz to solve exactly for the long time…
We start by formulating geometrically the Newton's law for a classical free particle in terms of Riemannian geometry, as pattern for subsequent developments. In fact, we use this scheme for further generalisation devoted to a constrained…
This paper introduces a new type of covering process that covers the set of natural numbers using renewal processes as objects. Inspired by the behavior of prime numbers, the model in each step finds the smallest vacant point, $k$, and…
We consider a system composed of a fixed number of particles with total energy smaller or equal to some prescribed value. The particles are non-interacting, indistinguishable and distributed over fixed number of energy levels. The energy…
The de Finetti representation theorem for continuous variable quantum system is first developed to approximate an N-partite continuous variable quantum state with a convex combination of independent and identical subsystems, which requires…
In a previous work [8], it was shown that the joint law of a diffusion process and the running supremum of its first component is absolutely continuous, and that its density satisfies a non standard weak partial differential equation (PDE).…
For each $n$ let $Y^n_t$ be a continuous time symmetric Markov chain with state space $n^{-1} \Z^d$. A condition in terms of the conductances is given for the convergence of the $Y^n_t$ to a symmetric Markov process $Y_t$ on $\R^d$. We have…
A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…
Suppose that red and blue points form independent homogeneous Poisson processes of equal intensity in $R^d$. For a positive (respectively, negative) parameter $\gamma$ we consider red-blue matchings that locally minimize (respectively,…
The sine process is a rigid point process on the real line, which means that for almost all configurations $X$, the number of points in an interval $I = [-R,R]$ is determined by the points of $X$ outside of $I$. In addition, the points in…