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.