Related papers: Three-point correlations for quantum star graphs

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix…

We obtain a consistency relation for the observed three-point correlator of galaxies. It includes relativistic effects and it is valid in the squeezed limit. Furthermore, the consistency relation is non-perturbative and can be used at…

Given i.i.d. observations uniformly distributed on a closed manifold $\mathcal{M}\subseteq \mathbb{R}^p$, we study the spectral properties of the associated empirical graph Laplacian based on a Gaussian kernel. Our main results are…

We extend a recent theory of parametric correlations in the spectrum of random matrices to study the response to an external perturbation of eigenvalues near the soft edge of the support. We demonstrate by explicit non-perturbative…

We prove an approximation result showing how operators of the type $-\Delta -\gamma \delta (x-\Gamma)$ in $L^2(\mathbb{R}^2)$, where $\Gamma$ is a graph, can be modeled in the strong resolvent sense by point-interaction Hamiltonians with an…

We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…

The two-point correlation function for the zeros of Dirichlet L-functions at a height E on the critical line is calculated heuristically using a generalization of the Hardy-Littlewood conjecture for pairs of primes in arithmetic…

Extending the idea formulated in Makino {\it{et al}}[Phys.Rev.E {\bf{67}},066205], that is based on the Berry--Robnik approach [M.V. Berry and M. Robnik, J. Phys. A {\bf{17}}, 2413], we investigate the statistical properties of a two-point…

We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…

We investigate consistency relations for non-Gaussianity. We provide a model-independent dynamical proof for the consistency relation of 3-point correlation functions from the Hamiltonian and field redefinition. This relation can be applied…

We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…

Two and three point functions of composite operators are analysed with regard to (logarithmically) divergent contact terms. Using the renormalisation group of dimensional regularisation it is established that the divergences are governed by…

Trace formulas play a central role in the study of spectral geometry and in particular of quantum graphs. The basis of our work is the result by Kurasov which links the Euler characteristic $\chi$ of metric graphs to the spectrum of their…

In two-dimensional statistical physics, correlation functions of the O(N) and Potts models may be written as sums over configurations of non-intersecting loops. We define sums associated to a large class of combinatorial maps (also known as…

Let G be a simple graph on $n$ vertices and $e(G)$ edges. Consider $Q(G) = D + A$ as the signless Laplacian of $G$, where $A$ is the adjacency matrix and $D$ is the diagonal matrix of the vertices degree of $G$. Let $q_1(G)$ and $q_2(G)$ be…

Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously…

We consider a fermion gas on a star graph modeling a quantum wire junction and derive the entanglement entropy of one edge with respect to the rest of the junction. The gas is free in the bulk of the graph, the interaction being localized…