相关论文: Free probability, path developments and signature …

We consider various asymptotic scaling limits $N\to\infty$ for the $2N$ complex eigenvalues of non-Hermitian random matrices in the symmetry class of the symplectic Ginibre ensemble. These are known to be integrable, forming Pfaffian point…

We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these…

We study unitary random matrix ensembles in the critical regime where a new cut arises away from the original spectrum. We perform a double scaling limit where the size of the matrices tends to infinity, but in such a way that only a…

The unitary group with the Haar probability measure is called Circular Unitary Ensemble. All the eigenvalues lie on the unit circle in the complex plane and they can be regarded as a determinantal point process on $\mathbb{S}^1$. It is also…

We address the question of how the celebrated universality of local correlations for the real eigenvalues of Hermitian random matrices of size NxN can be extended to complex eigenvalues in the case of random matrices without symmetry.…

Simulation models of complex dynamics in the natural and social sciences commonly lack a tractable likelihood function, rendering traditional likelihood-based statistical inference impossible. Recent advances in machine learning have…

We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in…

The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…

Tensor algebras give rise to one of the most powerful measures of similarity for sequences of arbitrary length called the signature kernel accompanied with attractive theoretical guarantees from stochastic analysis. Previous algorithms to…

We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals of the signature of…

The signature kernel is a recent state-of-the-art tool for analyzing high-dimensional sequential data, valued for its theoretical guarantees and strong empirical performance. In this paper, we present a novel method for efficiently…

The paper studies scaling limits of random skew plane partitions confined to a box when the inner shapes converge uniformly to a piecewise linear function V of arbitrary slopes in [-1,1]. It is shown that the correlation kernels in the bulk…

We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, locally treelike,…

We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…

A meandric system of size $n$ is the set of loops formed from two arc diagrams (non-crossing perfect matchings) on $\{1,\dots,2n\}$, one drawn above the real line and the other below the real line. A uniform random meandric system can be…

We consider line ensembles of non-intersecting random walks constrained by a hard wall, each tilted by the area underneath it with geometrically growing pre-factors $\mathfrak{b}^i$ where $\mathfrak{b}>1$. This is a model for the level…

We investigate the spectral properties of the product of $M$ complex non-Hermitian random matrices that are obtained by removing $L$ rows and columns of larger unitary random matrices uniformly distributed on the group ${\rm U}(N+L)$. Such…

A combination of direct and inverse Fourier transforms on the unitary group $U(N)$ identifies normalized characters with probability measures on $N$-tuples of integers. We develop the $N\to\infty$ version of this correspondence by matching…

We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…

A random geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_1,\ldots,x_n$ independently and uniformly from the $d$-dimensional unit sphere, then connecting each pair $(i,j)$ with probability $K(\langle…