The energy of random signed graph
From MaRDI portal
Publication:2332467
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)
Abstract: A signed graph is a graph with a sign attached to each of its edges, where is the underlying graph of . The energy of a signed graph is the sum of the absolute values of the eigenvalues of the adjacency matrix of . The random signed graph model is defined as follows: Let be fixed, . Given a set of vertices, between each pair of distinct vertices there is either a positive edge with probability or a negative edge with probability , or else there is no edge with probability . 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 51346 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 1347881 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Balance in random signed graphs
- Characteristic vectors of bordered matrices with infinite dimensions
- Graph energy
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
- On products and line graphs of signed graphs, their eigenvalues and energy
- On the distribution of the roots of certain symmetric matrices
- Orthogonal polynomials and random matrices: a Riemann-Hilbert approach.
- Paths in graphs
- Spectral criterion for cycle balance in networks
- The Laplacian energy of random graphs
- The energy of random graphs
Cited in
(3)
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)