Related papers: $W_{1,+}$-interpolation of probability measures on…
We develop the theory for the Bergman spaces of generalized $L_p$-solutions of the bicomplex-Vekua equation $\overline{\boldsymbol{\partial}}W=aW+b\overline{W}$ on bounded domains, where the coefficients $a$ and $b$ are bounded…
In their seminal 1990 paper, Wasserman and Kadane establish an upper bound for the Bayes' posterior probability of a measurable set $A$, when the prior lies in a class of probability measures $\mathcal{P}$ and the likelihood is precise.…
We study the problem of estimating a sequence of evolving probability distributions from historical data, where the underlying distribution changes over time in a nonstationary and nonparametric manner. To capture gradual changes, we…
This manuscript introduces a regression-type formulation for approximating the Perron-Frobenius Operator by relying on distributional snapshots of data. These snapshots may represent densities of particles. The Wasserstein metric is…
In this article, we represent the Wasserstein metric of order $p$, where $p\in [1,\infty)$, in terms of the comonotonicity copula, for the case of probability measures on $\R^d$, by revisiting existing results. In 1973, Vallender…
We study wave maps from the circle to a general compact Riemannian manifold. We prove that the global controllability of this geometric equation is characterized precisely by the homotopy class of the data. As a remarkable intermediate…
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…
Consider the class of zero-mean functions with fixed $L^{\infty}$ and $L^1$ norms and exactly $N\in \mathbb{N}$ nodal points. Which functions $f$ minimize $W_p(f_+,f_-)$, the Wasserstein distance between the measures whose densities are the…
In this short note we outline a simple probabilistic proof of the Gauss-Bonnet formula for compact Riemannian manifolds with boundary, which adapts to this setting an argument due to Hsu \cite{Hs1,Hs2} in the closed case. The new technical…
Resource-efficiently computing representations of probability distributions and the distances between them while only having access to the samples is a fundamental and useful problem across mathematical sciences. In this paper, we propose a…
A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this…
Wigner's marginal probability theory is revisited, and systematically applied to n-particle correlation measurements. A set of Bell inequalities whose corollaries are Hardy contradiction and its generalisation are derived with intuitive…
For $p\in (1,\infty)$ let $\mathscr{P}_p(\mathbb{R}^3)$ denote the metric space of all $p$-integrable Borel probability measures on $\mathbb{R}^3$, equipped with the Wasserstein $p$ metric $\mathsf{W}_p$. We prove that for every…
We prove a sharp upper bound for the number of high degree differences in bipartite graphs: let $ (U, V, E)$ be a bipartite graph with $U=\{u_1, u_2, \dots, u_n\}$ and $V=\{v_1, v_2, \dots, v_n\}$; for $n\ge k>\frac{n}{2}$ we show that…
This article studies a general divide-and-conquer algorithm for approximating continuous one-dimensional probability distributions with finite mean. The article presents a numerical study that compares pre-existing approximation schemes…
Graphs are playing a crucial role in different fields since they are powerful tools to unveil intrinsic relationships among signals. In many scenarios, an accurate graph structure representing signals is not available at all and that…
The optimal transportation problem defines a geometry of probability measures which leads to a definition for weighted averages (barycenters) of measures, finding application in the machine learning and computer vision communities as a…
For a finite graph $F$ and a value $p \in [0,1]$, let $I(F,p)$ denote the largest $y$ for which there is a sequence of graphs of edge density approaching $p$ so that the induced $F$-density of the sequence approaches $y$. We show that for…
Gradient normalization stabilizes deep-learning optimization, and spectral normalizations are especially natural for matrix-shaped parameter blocks; Muon is the motivating example. We study an idealized deterministic, continuous-time,…
Any discrete distribution with support on $\{0,\ldots, d\}$ can be constructed as the distribution of sums of Bernoulli variables. We prove that the class of $d$-dimensional Bernoulli variables $\boldsymbol{X}=(X_1,\ldots, X_d)$ whose sums…