Results 31 to 40 of about 121,348 (314)
Chromatic number and signless Laplacian spectral radius of graphs [PDF]
Transactions on Combinatorics, 2022 For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj +1 more source
Random matrix analysis of network Laplacians [PDF]
Physica A: Statistical Mechanics and its Applications, 2008 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 the Laplacian of these networks follow Gaussian orthogonal ensemble statistics of random matrix theory ...
Jalan, S., Bandyopadhyay, J.
openaire +3 more sources
Sparse Graph Learning Under Laplacian-Related Constraints
IEEE Access, 2021 We consider the problem of learning a sparse undirected graph underlying a given set of multivariate data. We focus on graph Laplacian-related constraints on the sparse precision matrix that encodes conditional dependence between the random variables ...
Jitendra K. Tugnait
doaj +1 more source
The normalized distance Laplacian
Special Matrices, 2021 The distance matrix đ(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj +1 more source
Incremental eigenpair computation for graph Laplacian matrices: theory and applications [PDF]
, 2017 The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications, the number of clusters or communities (say,
Al Hasan, Mohammad +2 more
core +3 more sources
Simplicial matrix-tree theorems [PDF]
, 2008 We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai.
Duval, Art M. +2 more
core +5 more sources
Diffusion dynamics on multiplex networks [PDF]
, 2012 We study the time scales associated to diffusion processes that take place on multiplex networks, i.e. on a set of networks linked through interconnected layers.
A. Arenas +8 more
core +3 more sources
International Journal of Robust and Nonlinear Control, EarlyView., 2023 Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as selfâinterest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source
More on Spectral Analysis of Signed Networks
Complexity, 2018 Spectral graph theory plays a key role in analyzing the structure of social (signed) networks. In this paper we continue to study some properties of (normalized) Laplacian matrix of signed networks. Sufficient and necessary conditions for the singularity
Guihai Yu, Hui Qu
doaj +1 more source
On graphs with a few distinct reciprocal distance Laplacian eigenvalues
AIMS Mathematics, 2023 For a $ \nu $-vertex connected graph $ \Gamma $, we consider the reciprocal distance Laplacian matrix defined as $ RD^L(\Gamma) = RT(\Gamma)-RD(\Gamma) $, i.e., $ RD^L(\Gamma) $ is the difference between the diagonal matrix of the reciprocal distance ...
Milica AnÄeliÄ +2 more
doaj +1 more source