Related papers: Likelihood Geometry of Determinantal Point Process…
Determinantal Point Processes (DPPs) have attracted significant interest from the machine-learning community due to their ability to elegantly and tractably model the delicate balance between quality and diversity of sets. DPPs are commonly…
Understanding how subsets of items are chosen from offered sets is critical to assortment planning, wireless network planning, and many other applications. There are two seemingly unrelated subset choice models that capture dependencies…
Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…
One of the major goals of cosmological observations is to test theories of structure formation. The most straightforward way to carry out such tests is to compute the likelihood function L, the probability of getting the data given the…
Dirichlet processes (DP) are widely applied in Bayesian nonparametric modeling. However, in their basic form they do not directly integrate dependency information among data arising from space and time. In this paper, we propose location…
Discrete probabilistic programs (DPPs) provide a highly expressive formalism for compactly defining arbitrary finite probabilistic models. This expressivity comes at a price: DPP inference is PSPACE-hard. In this work, we show that DPP…
This paper establishes the theoretical foundation for statistical applications of an intriguing new type of spatial point processes called critical point processes. These point processes, residing in Euclidean space, consist of the critical…
In this paper, we study the expected value of the pair correlation statistics of randomized point configurations on the sphere, with the emphasis on point configurations generated by determinantal point processes. We study the cases of the…
We consider determinantal point processes on a compact complex manifold X in the limit of many particles. The correlation kernels of the processes are the Bergman kernels associated to a a high power of a given Hermitian holomorphic line…
We study the local statistics of orthogonal polynomial ensembles near a hard edge, subject to a multiplicative deformation of the measure. Probabilistically, this deformation corresponds to a position-dependent conditional thinning of the…
A fundamental process for any given chaotic flow is the deterministic point process (DPP) generated by any chaotic trajectory of the flow repeatedly crossing a canonical surface-of-section (herein referred to as a sigma-type DPP). This…
The analogy between determinantal point processes (DPPs) and free fermionic calculi is well-known. We point out that, from the perspective of free fermionic algebras, Pfaffian point processes (PfPPs) naturally emerge, and show that a…
An algebraic approach to the maximum likelihood estimation problem is to solve a very structured parameterized polynomial system called likelihood equations that have finitely many complex (real or non-real) solutions. The only solutions…
We study a class of rotation invariant determinantal ensembles in the complex plane; examples include the eigenvalues of Gaussian random matrices and the roots of certain families of random polynomials. The main result is a criteria for a…
This paper concerns the use of a particular class of determinantal point processes (DPP), a class of repulsive spatial point processes, for Monte Carlo integration. Let $d\ge 1$, $I\subseteq \overline d=\{1,\dots,d\}$ with $\iota=|I|$.…
We introduce new smoothing estimators for complex signals on graphs, based on a recently studied Determinantal Point Process (DPP). These estimators are built from subsets of edges and nodes drawn according to this DPP, making up trees and…
Dependent Dirichlet processes (DDP) have been widely applied to model data from distributions over collections of measures which are correlated in some way. On the other hand, in recent years, increasing research efforts in machine learning…
We survey recent results on determinantal processes, random growth, random tilings and their relation to random matrix theory.
We consider the problem of estimating the density $\Pi$ of a determinantal process $N$ from the observation of $n$ independent copies of it. We use an aggregation procedure based on robust testing to build our estimator. We establish…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…