Related papers: The correlation constant of a field
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We derive a covariance formula for the number of excursion or level set components of a smooth stationary Gaussian field on $\mathbb{R}^d$ contained in compact domains. We also present two applications of this formula: (1) for fields whose…
We calculate the vector and axial-vector current correlators in the coordinate space and compare them with the experimental information obtained through the spectral functions of hadronic tau decays measured by ALEPH. Lattice data are…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
We consider the instabilities of field perturbations around a homogeneous background color-electric and/or -magnetic field in SU(2) pure gauge theory. We investigate a number of distinct cases of background magnetic and electric fields, and…
The Gaussian Correlation Conjecture states that for any two symmetric, convex sets in n-dimensional space and for any centered, Gaussian measure on that space, the measure of the intersection is greater than or equal to the product of the…
In this paper we study one-dimensional sections of the maps of WMAP ILC and of the NVSS survey on scale lengths of 0.75, 3, 4.5, and 6.75 degrees and analyze the correlation properties of the sections. On these maps we identify the domains…
Inhomogeneous quantum critical systems in one spatial dimension have been studied by using conformal field theory in static curved backgrounds. Two interesting examples are the free fermion gas in the harmonic trap and the inhomogeneous XX…
This paper is devoted to the 8-vertex model and its edge correlation function. In some particular (integrable) cases, we find a closed form of the edge correlation function and we deduce also its asymptotic. In addition, we quantify…
The magnitude of Pearson correlation between two scalar random variables can be visually judged from the two-dimensional scatter plot of an independent and identically distributed sample drawn from the joint distribution of the two…
We consider the time evolution of mixed state correlation measures in two-dimensional conformal field theories, such as logarithmic negativity, odd entropy, and reflected entropy, after quantum quenches of various kinds. These correlation…
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…
Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of…
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…
We show that the coupling constant of a quantum-induced composite field is scale invariant due to its compositeness condition. It is first demonstrated in next-to-leading order in 1/N in typical models, and then we argue that it holds…
For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…