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

We study asymptotics of traces of (noncommutative) monomials formed by images of certain elements of the universal enveloping algebra of the infinite-dimensional unitary group in its Plancherel representations. We prove that they converge…

We consider the probability of two large gaps (intervals without eigenvalues) in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We determine the multiplicative constant in the asymptotics. We also provide the…

We develop a framework for function classes generated by parametric ridge kernels: one-dimensional kernels composed with affine projections and averaged over a parameter measure. The induced kernels are positive definite, and the resulting…

Random numbers are indispensable for a variety of applications ranging from testing physics foundation to information encryption. In particular, nonlocality tests provide a strong evidence to our current understanding of nature -- quantum…

In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…

In this paper we study the scale-space classification of signals via the maximal set of kernels. We use a geometric approach which arises naturally when we consider parameter variations in scale-space. We derive the Fourier transform…

We derive and analyze a generic, recursive algorithm for estimating all splits in a finite cluster tree as well as the corresponding clusters. We further investigate statistical properties of this generic clustering algorithm when it…

Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of graph kernels. We…

We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…

A very simple Gaussian model is used to illustrate a new fitting result: a linear growth of the resolution with the number N of detecting layers. This rule is well beyond the well-known rule proportional to $\sqrt{N}$ for the resolution of…

We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification…

We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\delta}(U)$ to approximate a unitary $U$ up to an error of $\delta$ in operator norm distance. More precisely we show two bounds…

The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…

While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome this limitation, we…

We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…

We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the…

The real time evolution of a scalar field in 0+1 dimensions is investigated on a complex time contour. The path integral formulation of the system has a sign problem, which is circumvented using the Complex Langevin equation. Measurement of…

In many applications of machine learning, a large number of variables are considered. Motivated by machine learning of interacting particle systems, we consider the situation when the number of input variables goes to infinity. First, we…

We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between…

In this paper, we provide a framework of estimates for describing 2D scaling limits by Schramm's SLE curves. In particular, we show that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a…