English
Related papers

Related papers: From Laplacian-to-Adjacency Matrix for Continuous …

200 papers

Given a graph $G$, the Laplacian matrix of $G$, $L(G)$ is the difference of the adjacency matrix $A(G)$ and $\text{Deg}(G)$, where $\text{Deg}(G)$ is the diagonal matrix of vertex degrees. The distance Laplacian matrix $D^L({G})$ is the…

Combinatorics · Mathematics 2026-02-20 Subarsha Banerjee , Soumya Ganguly

We study the operator theory associated with such infinite graphs $G$ as occur in electrical networks, in fractals, in statistical mechanics, and even in internet search engines. Our emphasis is on the determination of spectral data for a…

Mathematical Physics · Physics 2009-11-13 Palle E. T. Jorgensen

We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…

Mathematical Physics · Physics 2018-05-07 Ivan Contreras , Michael Toriyama , Chengzheng Yu

For $n\in [-2,2]$ the $O(n)$ model on a random lattice has critical points to which a scaling behaviour characteristic of 2D gravity interacting with conformal matter fields with $c\in [-\infty,1]$ can be associated. Previously we have…

High Energy Physics - Theory · Physics 2009-10-28 B. Eynard , C. Kristjansen

We report on our recent study of equilibrium thermodynamic observables in SU(N) gauge theories with N=3, 4, 5, 6 and 8 colors at temperatures T in the range from 0.8 T_c to 3.4 T_c (where T_c denotes the critical deconfinement temperature).…

High Energy Physics - Lattice · Physics 2010-11-05 Marco Panero

Consider two graphs $G$ and $H$. Let $H^k[G]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k[G]$ and $H^k$ when…

Combinatorics · Mathematics 2026-02-17 Nair Abreu , Domingos M. Cardoso , Paula Carvalho , Cybele T. M. Vinagre

Let $G$ be a simple undirected graph, $\theta(G)$ be the circuit rank of $G$, $\eta_M(G)$ and $m_M(G,\lambda)$ be the nullity and the multiplicity of eigenvalue $\lambda$ of a graph matrix $M(G)$, respectively. In the case $M(G)$ is the…

Combinatorics · Mathematics 2022-12-23 Ahmet Batal

Let $k$ be a positive integer and let $G$ be a simple graph of order $n$ with minimum degree $\delta$. A graph $G$ is said to have property $P(k, d)$ if it contains $k$ edge-disjoint spanning trees and an additional forest $F$ with edge…

Combinatorics · Mathematics 2026-01-14 Yongbin Gao , Ligong Wang

Let $G=\left( V\left( G\right) ,E\left( G\right) \right) $ be an $\left( n,m\right) $-graph and $X$ a nonempty proper subset of $V\left( G\right) $. Let $X^{c}=V\left( G\right) \backslash X$.\ The edge density of $X$ in $G$ is given by…

Spectral Theory · Mathematics 2018-06-01 Enide Andrade , Maria Aguieiras A. de Freitas , María Robbiano , Jonnathan Rodríguez

This paper extends the definitions of effective resistance and effective conductance to characterize the overall relation (positive coupling or antagonism) between any two disjoint sets of nodes in a signed graph. It generalizes the…

Optimization and Control · Mathematics 2019-07-19 Yue Song , David J. Hill , Tao Liu

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the…

Combinatorics · Mathematics 2024-09-12 Xinghui Zhao , Lihua You

Toeplitz matrices for the study of the fractional Laplacian on a bounded interval. In this work we get a deep link between (--$\Delta$) $\alpha$ ]0,1[ the fractional Laplacian on the interval ]0, 1[ and T N ($\Phi$ $\alpha$) the Toeplitz…

Classical Analysis and ODEs · Mathematics 2021-03-11 Philippe Rambour , Abdellatif Seghier

Graphs are a prevalent tool in data science, as they model the inherent structure of the data. They have been used successfully in unsupervised and semi-supervised learning. Typically they are constructed either by connecting nearest…

Machine Learning · Statistics 2019-05-02 Vassilis Kalofolias , Nathanaël Perraudin

The power graph $\mathscr{P}(G)$ of a group $G$ is an undirected graph with all the elements of $G$ as vertices and where any two vertices $u$ and $v$ are adjacent if and only if $u=v^m $ or $v=u^m$, $ m \in$ $\mathbb{Z}$. For a simple…

Combinatorics · Mathematics 2023-07-19 Komal Kumari , Pratima Panigrahi

The paper describes an explicit combinatorial formula for a harmonic vector for the Laplacian of a directed graph with arbitrary edge weights. This result was motivated by questions from mathematical economics, and the formula plays a…

Combinatorics · Mathematics 2013-09-17 Siddhartha Sahi

In this work, we study the spectrum of the regularized normalized Laplacian for random geometric graphs (RGGs) in both the connectivity and thermodynamic regimes. We prove that the limiting eigenvalue distribution (LED) of the normalized…

Spectral Theory · Mathematics 2019-10-22 Mounia Hamidouche , Laura Cottatellucci , Konstantin Avrachenkov

We study gradient field models on an integer lattice with non-convex interactions. These models emerge in distinct branches of physics and mathematics under various names. In particular, as zero-mass lattice (Euclidean) quantum field…

Mathematical Physics · Physics 2024-06-06 Stefan Adams , Simon Buchholz , Roman Kotecký , Stefan Müller

In this paper we investigate the spectrum of $OSp(n|2m)$ quantum spin chains with free boundary conditions. We compute the surface free energy of these models which, similar to other properties in the thermodynamic limit including the…

High Energy Physics - Theory · Physics 2022-05-04 Holger Frahm , Márcio J. Martins

We discuss recently introduced numerical linked-cluster (NLC) algorithms that allow one to obtain temperature-dependent properties of quantum lattice models, in the thermodynamic limit, from exact diagonalization of finite clusters. We…

Statistical Mechanics · Physics 2007-06-25 Marcos Rigol , Tyler Bryant , Rajiv R. P. Singh

We analyze eigenvalues fluctuations of the Laplacian of various networks under the random matrix theory framework. Analyses of random networks, scale-free networks and small-world networks show that nearest neighbor spacing distribution of…

Statistical Mechanics · Physics 2009-11-11 Sarika Jalan , Jayendra N. Bandyopadhyay