Related papers: The correlation constant of a field
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…
Distance correlation is a new measure of dependence between random vectors. Distance covariance and distance correlation are analogous to product-moment covariance and correlation, but unlike the classical definition of correlation,…
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…
Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize…
Understanding the correlation between two different scores for the same set of items is a common problem in information retrieval, and the most commonly used statistics that quantifies this correlation is Kendall's $\tau$. However, the…
We calculate the coupling constants between the light vector mesons and heavy mesons within the framework of the light-cone QCD sum rule in the leading order of heavy quark effective theory. The sum rules are very stable with the variations…
In lattice QCD spectrum calculations, it is desirable to obtain multiple excited state energies in each symmetry channel. Typically, one constructs several interpolating operators for the symmetry channel of interest, forms the `correlator…
We derive a new upper bound for the correlations in a heterogeneous one-dimensional Ising model with free boundary conditions. The new upper bound quantifies the simultaneous decay of correlations due to weakness of nearest-neighbor…
The existence or not of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree…
Modeling heterogeneous correlated time series requires the ability to learn hidden dynamic relationships between component time series with possibly varying periodicities and generative processes. To address this challenge, we formulate and…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian…
Association field models have attempted to explain human contour grouping performance, and to explain the mean frequency of long-range horizontal connections across cortical columns in V1. However, association fields only depend on the…
In this note we compute values of global linear Harbourne constants over arbitrary fields for up to ten lines. These invariants have appeared recently in the discussions around the Bounded Negativity Conjecture. They seem to be of…
Motivated by the importance ascribed to correlations in random matrices used to model phenomena in various scientific disciplines, we report how algebraic correlations between matrix elements affect the eigenvalue statistics and spectral…
Let $G=(V,E)$ be a simple and connected graph. A $h$-order invariant of $G$ based on the path sequence is defined from a set of real numbers ${f(x_{0},x_{1},\cdots,x_{h})}$ as $^{h}I_f(G)=\sum\limits_{v_{0}v_{1}v_{2}\cdots…
We consider an infrared truncated massless minimally coupled scalar field with a quartic self-interaction in the locally de Sitter background of an inflating universe. We compute the two-point correlation function of the scalar at one and…
The simplicity of a question such as wondering if correlations characterize or not a certain system collides with the experimental difficulty of accessing such information. Here we present a low demanding experimental approach which refers…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
Using a generating function approach, the correlation coefficients of four different graph-theoretical indices, namely the number of independent vertex subsets, the number of matchings, the number of subtrees and the Wiener index, are…
Given a set of points in the plane, we show that the $\theta$-graph with 5 cones is a geometric spanner with spanning ratio at most $\sqrt{50 + 22 \sqrt{5}} \approx 9.960$. This is the first constant upper bound on the spanning ratio of…