Related papers: Generalized unistochastic matrices
The confusion matrix is a standard tool for evaluating classifiers by providing insights into class-level errors. In heterogeneous settings, its values are shaped by two main factors: class similarity -- how easily the model confuses two…
In the first of this series of two articles, we studied some geometrical aspects of the Birkhoff polytope, the compact convex set of all $n \times n$ doubly stochastic matrices, namely the Chebyshev center, and the Chebyshev radius of the…
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…
The paper contains two main parts: in the first part, we analyze the general case of $p\geq 2$ matrices coupled in a chain subject to Cauchy interaction. Similarly to the Itzykson-Zuber interaction model, the eigenvalues of the Cauchy chain…
We introduce the notions of $d$-orthostochastic, $d$-unistochastic, and $d$-qustochastic matrices. These are the particular cases of $F^d$-bistochastic matrices where $F$ is real or complex numbers or quaternions. The concept is motivated…
We prove the edge and bulk universality of random Hermitian matrices with equi-spaced external source. One feature of our method is that we use neither a Christoffel-Darboux type formula, nor a double-contour formula, which are standard…
Jean-Louis Loday has defined generalised bialgebras and proved structure theorems in this setting which can be seen as general forms of the Poincar\'e-Birkhoff-Witt and the Cartier-Milnor-Moore theorems. It was observed by the present…
We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of…
We give a systematic description of a canonical renormalisation procedure of stochastic PDEs containing nonlinearities involving generalised functions. This theory is based on the construction of a new class of regularity structures which…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
We generalise well-known integrals of Ingham-Siegel and Fisher-Hartwig type over the unitary group $U(N)$ with respect to Haar measure, for finite $N$ and including fixed external matrices. When depending only on the eigenvalues of the…
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
In this paper we propose a method to construct probability measures on the space of convex bodies with a given pushforward distribution. Concretely we show that there is a measure on the metric space of centrally symmetric convex bodies,…
Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…
Random matrix theory successfully models many systems, from the energy levels of heavy nuclei to zeros of $L$-functions. While most ensembles studied have continuous spectral distribution, Burkhardt et al introduced the ensemble of…
We consider matrix-valued processes described as solutions to stochastic differential equations of very general form. We study the family of the empirical measure-valued processes constructed from the corresponding eigenvalues. We show that…
Birkhoff's theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.…
Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
In this paper, we study the connected blocks polytope, which, apart from its own merits, can be seen as the generalization of certain connectivity based or Eulerian subgraph polytopes. We provide a complete facet description of this…