Related papers: Determinantal point processes conditioned on rando…
We study determinantal random point processes on a compact complex manifold X associated to an Hermitian metric on a line bundle over X and a probability measure on X. Physically, this setup describes a free fermion gas on X subject to a…
We consider the residual empirical process in random design regression with long memory errors. We establish its limiting behaviour, showing that its rates of convergence are different from the rates of convergence for to the empirical…
In many contexts such as queuing theory, spatial statistics, geostatistics and meteorology, data are observed at irregular spatial positions. One model of this situation involves considering the observation points as generated by a Poisson…
Deterministic processes form an important building block of several classes of processes. We provide a method to classify deterministic Hunt processes. Within this framework we characterize different subclasses (e.g. Feller) and construct…
We study determinantal point processes (DPP) through the lens of algebraic statistics. We count the critical points of the log-likelihood function, and we compute them for small models, thereby disproving a conjecture of Brunel, Moitra,…
The main result of this paper, Theorem 1.5, establishes a conjecture of Lyons and Peres: for a determinantal point process governed by a reproducing kernel, the system of kernels sampled at the particles of a random configuration is…
This paper is concerned with the study of a family of fixed point iterations combining relaxation with different inertial (acceleration) principles. We provide a systematic, unified and insightful analysis of the hypotheses that ensure…
Piecewise deterministic Markov processes (PDMPs) are a class of stochastic processes with applications in several fields of applied mathematics spanning from mathematical modeling of physical phenomena to computational methods. A PDMP is…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
We derive an elementary formula for Janossy densities for determinantal point processes with a finite rank projection-type kernel. In particular, for beta=2 polynomial ensembles of random matrices we show that the Janossy densities on an…
In this paper we study a family of nonlinear (conditional) expectations that can be understood as a stochastic process with uncertain parameters. We develop a general framework which can be seen as a version of the martingale problem method…
The Ginibre point process is one of the main examples of deter- minantal point processes on the complex plane. It forms a recurring model in stochastic matrix theory as well as in pratical applications. However, this model has mostly been…
In this work we study the method of Bregman projections for deterministic and stochastic convex feasibility problems with three types of control sequences for the selection of sets during the algorithmic procedure: greedy, random, and…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
Set prediction is about learning to predict a collection of unordered variables with unknown interrelations. Training such models with set losses imposes the structure of a metric space over sets. We focus on stochastic and underdefined…
For each configuration of rational points on the affine line, we define an operation on the group of unstable A1 motivic homotopy classes of endomorphisms of the projective line. We also derive an algebraic formula for the image of such an…
Many real-world systems can be usefully represented as sets of interacting components. Examples include computational systems, such as query processors and compilers, natural systems, such as cells and ecosystems, and social systems, such…
We use the abstract method of (local) martingale problems in order to give criteria for convergence of stochastic processes. Extending previous notions, the formulation we use is neither restricted to Markov processes (or semimartingales),…
Data collection and labeling is one of the main challenges in employing machine learning algorithms in a variety of real-world applications with limited data. While active learning methods attempt to tackle this issue by labeling only the…
The goal of this paper is to quantitatively describe some statistical properties of higher-dimensional determinantal point processes with a primary focus on the nearest-neighbor distribution functions. Toward this end, we express these…