TY - CONF
T1 - On the spectra of general random mixed graphs
AU - Hu, Dan
AU - Broersma, Hajo
AU - Hou, Jiangyou
AU - Zhang, Shenggui
N1 - Publisher Copyright:
© 2019 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018 - Proceedings of the Workshop.
PY - 2019
Y1 - 2019
N2 - A mixed graph is a graph that can be obtained from a simple undirected graph by replacing some of the edges by arcs in precisely one of the two possible directions. The Hermitian adjacency matrix of a mixed graph G of order n is the n × n matrix H(G) = (hij), where hij = -hji = i (with i = v-1) if there exists an arc from vi to vj (but no arc from vj to vi), hij = hji = 1 if there exists an edge (and no arcs) between vi and vj, and hij = 0 otherwise (if vi and vj are neither joined by an edge nor by an arc). We study the spectra of the Hermitian adjacency matrix and the normalized Hermitian Laplacian matrix of general random mixed graphs, i.e., in which all arcs are chosen independently with different probabilities (and an edge is regarded as two oppositely oriented arcs joining the same pair of vertices). For our first main result, we derive a new probability inequality and apply it to obtain an upper bound on the eigenvalues of the Hermitian adjacency matrix. Our second main result shows that the eigenvalues of the normalized Hermitian Laplacian matrix can be approximated by the eigenvalues of a closely related weighted expectation matrix, with error bounds depending on the minimum expected degree of the underlying undirected graph.
AB - A mixed graph is a graph that can be obtained from a simple undirected graph by replacing some of the edges by arcs in precisely one of the two possible directions. The Hermitian adjacency matrix of a mixed graph G of order n is the n × n matrix H(G) = (hij), where hij = -hji = i (with i = v-1) if there exists an arc from vi to vj (but no arc from vj to vi), hij = hji = 1 if there exists an edge (and no arcs) between vi and vj, and hij = 0 otherwise (if vi and vj are neither joined by an edge nor by an arc). We study the spectra of the Hermitian adjacency matrix and the normalized Hermitian Laplacian matrix of general random mixed graphs, i.e., in which all arcs are chosen independently with different probabilities (and an edge is regarded as two oppositely oriented arcs joining the same pair of vertices). For our first main result, we derive a new probability inequality and apply it to obtain an upper bound on the eigenvalues of the Hermitian adjacency matrix. Our second main result shows that the eigenvalues of the normalized Hermitian Laplacian matrix can be approximated by the eigenvalues of a closely related weighted expectation matrix, with error bounds depending on the minimum expected degree of the underlying undirected graph.
KW - General random mixed graphs
KW - Random Hermitian adjacency matrix
KW - Random normalized Hermitian Laplacian matrix
KW - Spectra
UR - http://www.scopus.com/inward/record.url?scp=85075926382&partnerID=8YFLogxK
M3 - 论文
AN - SCOPUS:85075926382
SP - 132
EP - 135
T2 - 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018
Y2 - 18 June 2018 through 20 June 2018
ER -