Related papers: Three-point correlations for quantum star graphs
In this article, we illustrate and draw connections between the geometry of zero sets of eigenfunctions, graph theory and the vanishing order of eigenfunctions. We identify the nodal set of an eigenfunction of the Laplacian (with smooth…
The existence of noncompatible observables in quantum theory makes a direct operational interpretation of two-point correlation functions problematic. Here we challenge such a view by explicitly constructing a measuring scheme that,…
In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…
The two-point correlation function of the stress-energy tensor for the $\Phi_{1,3}$ massive deformation of the non-unitary model ${\cal M}_{3,5}$ is computed. We compare the ultraviolet CFT perturbative expansion of this correlation…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
We discuss approximations of the vertex coupling on a star-shaped quantum graph of $n$ edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
Energy Correlators measure the energy deposited in multiple detectors as a function of the angles between the detectors. In this paper, we analytically compute the three particle correlator in the collinear limit in QCD for quark and gluon…
The three-point current correlation function in Euclidean spacetime for a strongly coupled system with non-Abelian global symmetry, $\langle J^a_i(x)J^b_j(y)J^c_k(z)\rangle$, is calculated from the weakly coupled AdS dual. The contribution…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
In our previous work \cite{Feng:2013pba}, we have shown a curvaton model where the curvaton has a nonminimal derivative coupling to gravity. Such a coupling could bring us scale-invariance of the perturbations for wide range constant values…
In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…
We present the holographic predictions for cosmological 3-point correlators, involving both scalar and tensor modes, for a universe which started in a non-geometric holographic phase. Holographic formulae relate the cosmological 3-point…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at different points of the graph. This paper is a continuation of our…
We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete…
We investigate the two-points correlation function for several boundary-driven interacting particle systems. Our goal is to show that the time evolution of that correlation function is solution to a partial differential equation that can be…
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…