Related papers: From Laplacian-to-Adjacency Matrix for Continuous …
We study the high-temperature regime of a mean-field spin glass model whose couplings matrix is orthogonally invariant in law. The magnetization of this model is conjectured to satisfy a system of TAP equations, originally derived by Parisi…
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful…
A family of spin-lattice models are derived as convergent finite dimensional approximations to the rest frame kinetic energy of a barotropic fluid coupled to a massive rotating sphere. In not fixing the angular momentum of the fluid…
Laplacian regularized stratified models (LRSM) are models that utilize the explicit or implicit network structure of the sub-problems as defined by the categorical features called strata (e.g., age, region, time, forecast horizon, etc.),…
We develop a new framework to prove the mixing or relaxation time for the Glauber dynamics on spin systems with unbounded degree. It works for general spin systems including both $2$-spin and multi-spin systems. As applications for this…
M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…
For a graph with $n$ vertices and $m$ edges, having Laplacian spectrum $\mu_1, \mu_2, \cdots,\mu_n$ and signless Laplacian spectrum $\mu^+_1,\mu^+_2, \cdots,\mu^+_n$, the Laplacian energy and signless Laplacian energy of $G$ are…
Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigen-vectors of the graph Laplacian. Graph laplacians are used to find low dimensional structures in high…
Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised…
Let $G$ be a connected graph of order $n$ with domination number $\gamma(G)$. Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eigenvalue $\lambda$ of $G$ with multiplicity…
Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$, and furthermore, they proposed a conjecture that for every graph $G$, $\En(G)$ is not more than $\EnL(G)$. Unfortunately,…
Graph Laplacian learning, also known as network topology inference, is a problem of great interest to multiple communities. In Gaussian graphical models (GM), graph learning amounts to endowing covariance selection with the Laplacian…
The analytic expressions for the free energy and entropy of the Casimir-Polder interaction between a polarizable and magnetizable atom and a graphene sheet are found in the limiting case of low temperature. In so doing, the response of…
In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state…
The Laplacian energy of a digraph $G$ is defined as $\sum_{i=1}^n \lambda_i^2$, where $\lambda_i$ are the eigenvalues of the Laplacian matrix of $G$. A (di)graph $G$ is said to be $H$-free if it does not contain a copy of the fixed…
The phase diagram of the O(n) model, in particular the special case $n=0$, is studied by means of transfer-matrix calculations on the loop representation of the O(n) model. The model is defined on the square lattice; the loops are allowed…
Nonlinear spectral graph theory is an extension of the traditional (linear) spectral graph theory and studies relationships between spectral properties of nonlinear operators defined on a graph and topological properties of the graph…
We study topology in Quantum Chromodynamics at high temperatures by means of lattice calculations. Simulations are performed with $N_f=2+1+1$ Wilson twisted mass fermions at maximal twist with physical quark masses, and temperatures…