The energy of random signed graph

DOI10.1016/J.LAA.2019.10.007zbMATH Open1426.05103arXiv1812.11865OpenAlexW2979813893WikidataQ114664013 ScholiaQ114664013MaRDI QIDQ2332467FDOQ2332467

Shuchao Li, Shujing Wang

Publication date: 4 November 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: A signed graph $Gamma(G)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $Gamma(G)$. The energy of a signed graph $Gamma(G)$ is the sum of the absolute values of the eigenvalues of the adjacency matrix $A(Gamma(G))$ of $Gamma(G)$. The random signed graph model $mathcal{G}_n(p,q)$ is defined as follows: Let $p,qge0$ be fixed, $0lep+qle1$. Given a set of $n$ vertices, between each pair of distinct vertices there is either a positive edge with probability $p$ or a negative edge with probability $q$, or else there is no edge with probability $1-(p+q)$. The edges between different pairs of vertices are chosen independently. In this paper, we obtain an exact estimate of energy for almost all signed graphs. Furthermore, we establish lower and upper bounds to the energy of random multipartite signed graphs.

Full work available at URL: https://arxiv.org/abs/1812.11865

zbMATH Keywords

energyempirical spectral distributionrandom multipartite signed graphrandom signed graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Positive matrices and their generalizations; cones of matrices (15B48) Signed and weighted graphs (05C22) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Energy
• Orthogonal polynomials and random matrices: a Riemann-Hilbert approach.
• Paths in graphs
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• Characteristic vectors of bordered matrices with infinite dimensions
• On the distribution of the roots of certain symmetric matrices
• The Laplacian energy of random graphs
• On products and line graphs of signed graphs, their eigenvalues and energy
• The energy of random graphs
• Spectral criterion for cycle balance in networks
• Balance in Random Signed Graphs

Cited In (2)

• Energy of Signed Spongy Hypercubes
• Ordering of bicyclic signed digraphs by energy

This page was built for publication: The energy of random signed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332467)