Abstract
A signed network [Formula: see text] with the underlying graph [Formula: see text], used as a mathematical model for analyzing social networks, has each edge in [Formula: see text] with a weight [Formula: see text] or [Formula: see text] assigned by the signature function [Formula: see text]. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
