Related papers: Scaling Limits for the Gibbs States on Distance-Re…
This paper is concerned with Spearman's correlation matrices under large dimensional regime, in which the data dimension diverges to infinity proportionally with the sample size. We establish the central limit theorem for the linear…
This work improves the existing central limit theorems (CLTs) for geometric functionals of Gibbs processes in three aspects. First, we derive a CLT for weakly stabilizing functionals, thereby improving on the previously used assumption of…
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
We devise a geometric description of bounded systems at criticality in any dimension $d$. This is achieved by altering the flat metric with a space dependent scale factor $\gamma(x)$, $x$ belonging to a general bounded domain $\Omega$.…
This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…
We show that there are well separated families of quantum expanders with asymptotically the maximal cardinality allowed by a known upper bound. This has applications to the "growth" of certain operator spaces: It implies asymptotically…
A phenomenon of classical quantization is discussed. This is revealed in the class of pseudoclassical gauge systems with nonlinear nilpotent constraints containing some free parameters. Variation of parameters does not change local (gauge)…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
We show that the emergent relativistic symmetry of electrons in graphene near its quantum critical point (QCP) implies a crucial importance of the Coulomb interaction. We derive scaling laws, valid near the QCP, that dictate the nontrivial…
The limit behavior is studied for the distributions of normalized U- and V-statistics of an arbitrary order with canonical (degenerate) kernels, based on samples of increasing sizes from a stationary sequence of observations satisfying…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
The classic central limit theorem and $\alpha$-stable distributions play a key role in probability theory, and also in Boltzmann-Gibbs (BG) statistical mechanics. They both concern the paradigmatic case of probabilistic independence of the…
In a seminal paper [8] it was shown that Heisenberg-limited measurements could be achieved without using entangled states by coupling the quantum resources to a common environment that could be measured, at least, in part. The authors also…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
We discuss space-time chaos and scaling properties for classical non-Abelian gauge fields discretized on a spatial lattice. We emphasize that there is a ``no go'' for simulating the original continuum classical gauge fields over a long time…
General Central limit theorem deals with weak limits (in type) of sums of row-elements of array random variables. In some situations as in the invariance principle problem, the sums may include only parts of the row-elements. For strictly…
The empirical spectral distribution of Hermitian $K \times K$-block random matrices converges to a deterministic density on the real line with a potential atom at the origin as the dimension of the blocks tends to infinity. In this model…