Back to Search
Start Over
Detour distance Laplacian matrices for signed networks.
- Source :
- Discrete Mathematics, Algorithms & Applications; May2024, Vol. 16 Issue 4, p1-8, 8p
- Publication Year :
- 2024
-
Abstract
- A signed network Σ = (G , σ) with the underlying graph G = (V , E) , used as a mathematical model for analyzing social networks, has each edge in E with a weight 1 or − 1 assigned by the signature function σ. In this paper, we deal with two types of Detour Distance Laplacian (DDL) matrices for signed networks. We characterize balance in signed social networks using these matrices and we compute the DDL spectrum of certain unbalanced signed networks, as balanced signed networks behave like unsigned ones. [ABSTRACT FROM AUTHOR]
- Subjects :
- LAPLACIAN matrices
SOCIAL networks
MATHEMATICAL models
MATRICES (Mathematics)
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 16
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 176610543
- Full Text :
- https://doi.org/10.1142/S1793830923500428