Related papers: The correlation constant of a field
Candidates for random network media include, e.g., systems consisting of long, flexible macromolecules cross-linked (i.e., permanently bonded) together at random to form the network. Owing to the random architecture, the characteristics of…
Correlation analysis is a fundamental step in uncovering meaningful insights from complex datasets. In this paper, we study the problem of detecting correlations between two random graphs following the Gaussian Wigner model with unlabeled…
This article discusses and explains the Hamiltonian formulation for a class of simple gauge invariant mechanical systems consisting of point masses and idealized rods. The study of these models may be helpful to advanced undergraduate or…
We consider the hypothesis testing problem of deciding whether an observed high-dimensional vector has independent normal components or, alternatively, if it has a small subset of correlated components. The correlated components may have a…
Correlation matrices are standardized covariance matrices. They form an affine space of symmetric matrices defined by setting the diagonal entries to one. We study the geometry of maximum likelihood estimation for this model and linear…
Discovering a correlation from one variable to another variable is of fundamental scientific and practical interest. While existing correlation measures are suitable for discovering average correlation, they fail to discover hidden or…
Let $G$ be a connected graph with vertex set $V(G)$, and denote by $d_G(u,v)$ the distance from $u$ to $v$ in $G$, for any $u,v \in V(G)$. The average distance of an $n$-vertex connected graph $G$, denoted by $\mu(G)$, is defined to be the…
On trees of fixed order, we show a direct relation between Kemeny's constant and Wiener index, and provide a new formula of Kemeny's constant from the relation with a combinatorial interpretation. Moreover, the relation simplifies proofs of…
We present a reasoning that the string coupling constant should be 1 from the assumption that the area spectrum derived from loop quantum gravity must be equal to the area spectrum calculated from "stringy differential geometry." To this…
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
We consider the problem of detecting the dimensionality of entanglement with the use of correlations between measurements in randomized directions. First, exploiting the recently derived covariance matrix criterion for the entanglement…
In this paper the author studies the problem of the homogenization of a diffusion perturbed by a periodic reflection invariant vector field. The vector field is assumed to have fixed direction but varying amplitude. The existence of a…
Alon and Wormald showed that any graph with minimum degree d contains a spanning star forest in which every connected component is of size at least \Omega((d/\log d)^{1/3}). They asked if any connected graph with minimum degree at least d…
The paper is concerned with the stability of the set of trajectories of a vector field, in the presence of impulsive perturbations. Patchy vector fields are discontinuous, piecewise smooth vector fields that were introduced in AB to study…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
We associate an Albert form to any pair of cyclic algebras of prime degree $p$ over a field $F$ with $\operatorname{char}(F)=p$ which coincides with the classical Albert form when $p=2$. We prove that if every Albert form is isotropic then…
A stable set in a graph G is a set of mutually non-adjacent vertices, alpha(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable sets. In this paper we demonstrate that in a tree T, of order…