Related papers: From Laplacian-to-Adjacency Matrix for Continuous …
Network synchronization is an emerging phenomenon in complex networks. The spectrum of Laplacian matrix will be immensely helpful for getting the network dynamics information. Especially, network synchronizability is characterized by the…
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…
A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
The free energy per lattice site of a quantum spin chain in the thermodynamic limit is determined by a single `dominant' Eigenvalue of an associated quantum transfer matrix in the infinite Trotter number limit. For integrable quantum spin…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We investigate the thermodynamic properties and the lattice stability of two-dimensional crystalline membranes, such as graphene and related compounds, in the low temperature quantum regime $T\rightarrow0$. A key role is played by the…
Graph embeddings, a class of dimensionality reduction techniques designed for relational data, have proven useful in exploring and modeling network structure. Most dimensionality reduction methods allow out-of-sample extensions, by which an…
We study the L\'evy spin glass model, a fully connected model on $N$ vertices with heavy-tailed interactions governed by a power law distribution of order $0<\alpha<2.$ Our investigation is divided into three cases $0<\alpha<1$, $\alpha=1$,…
Motivated by classic tree algorithms, in 1995 we designed a bottom-up $O(n)$ algorithm to compute the determinant of a tree's adjacency matrix $A$. In 2010 an $O(n)$ algorithm was found for constructing a diagonal matrix congruent to $A +…
We study the $O(n)$ model on graphs quasi-isometric to the hyperbolic plane, with free boundary conditions. We observe that the pair correlations decay exponentially with distance, for all temperatures, if and only if $n>1$.
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are…
For a simple and connected graph, several lower and upper bounds of graph invariants expressed in terms of the eigenvalues of the normalized Laplacian matrix have been proposed in literature. In this paper, through a unified approach based…
We consider the equilibrium dynamics of Ising spin models with multi-spin interactions on sparse random graphs (Bethe lattices). Such models undergo a mean field glass transition upon increasing the graph connectivity or lowering the…
We solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for…
Let $m_G(I)$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$, and let $\gamma(G)$ denote its domination number. We extend the recent result $m_G[0,1) \leq \gamma(G)$, and show that isolate-free graphs also…