Related papers: The correlation constant of a field
The $h$-vectors of homogeneous rings are one of the most important invariants that often reflect ring-theoretic properties. On the other hand, there are few examples of edge rings of graphs whose $h$-vectors are explicitly computed. In this…
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…
Distance correlation is a novel class of multivariate dependence measure, taking positive values between 0 and 1, and applicable to random vectors of arbitrary dimensions, not necessarily equal. It offers several advantages over the…
In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…
A set function can be extended to the unit cube in various ways; the correlation gap measures the ratio between two natural extensions. This quantity has been identified as the performance guarantee in a range of approximation algorithms…
We characterize positive definiteness for some family of matrices. As an application we derive explicit value of the quadratic embedding constants of the path graphs.
Under the hypotheses of smoothness in the coupling constant, locality, Lorentz covariance, and Poincare invariance of the deformations, combined with the preservation of the number of derivatives on each field, the consistent interactions…
The absence of self averaging in mesoscopic systems is a consequence of long-range intensity correlation. Microwave measurements suggest and diagrammatic calculations confirm that the correlation function of the normalized intensity with…
The relation between Pearson's correlation coefficient and Salton's cosine measure is revealed based on the different possible values of the division of the L1-norm and the L2-norm of a vector. These different values yield a sheaf of…
The quadratic embedding constant (QEC) of a graph $G$ is a new numeric invariant, which is defined in terms of the distance matrix and is denoted by $\mathrm{QEC}(G)$. By observing graph structure of the maximal cliques (clique graph), we…
We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Modeling how networks change under structural perturbations can yield foundational insights into network robustness, which is critical in many real-world applications. The largest connected component is a popular measure of network…
The gauge invariant two-point correlation function of the gauge field strength tensor is calculated in perturbation theory at the next-to-leading order. Besides a direct calculation in perturbative QCD we also present a derivation of the…
For each of the $8$ isotropy classes of elastic materials, we consider a homogeneous random field taking values in the fixed point set $\mathsf{V}$ of the corresponding class, that is isotropic with respect to the natural orthogonal…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
For gauge theory, the matrix element for any physical process is independent of the gauge used. Since this is a formal statement and examples are known where gauge invariance is violated, for any specific process this gauge invariance needs…
We investigate the relation between the invariant correlators of random matrix theory and correlators of the integrable one-dimensional systems. Starting from the relation between correlators for the coupling strengths $\lambda =1/ 2$, $1$,…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
Detecting the components common or correlated across multiple data sets is challenging due to a large number of possible correlation structures among the components. Even more challenging is to determine the precise structure of these…