2,720 research outputs found
The skew energy of random oriented graphs
Given a graph , let be an oriented graph of with the
orientation and skew-adjacency matrix . The skew energy
of the oriented graph , denoted by , is
defined as the sum of the absolute values of all the eigenvalues of
. In this paper, we study the skew energy of random oriented
graphs and formulate an exact estimate of the skew energy for almost all
oriented graphs by generalizing Wigner's semicircle law. Moreover, we consider
the skew energy of random regular oriented graphs , and get an
exact estimate of the skew energy for almost all regular oriented graphs.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1011.6646 by
other author
Remarks on the energy of regular graphs
The energy of a graph is the sum of the absolute values of the eigenvalues of
its adjacency matrix. This note is about the energy of regular graphs. It is
shown that graphs that are close to regular can be made regular with a
negligible change of the energy. Also a -regular graph can be extended to a
-regular graph of a slightly larger order with almost the same energy. As an
application, it is shown that for every sufficiently large there exists a
regular graph of order whose energy
satisfies
Several infinite families of graphs with maximal or submaximal energy are
given, and the energy of almost all regular graphs is determined.Comment: 12 pages. V2 corrects a typo. V3 corrects Theorem 1
The spectral analysis of random graph matrices
A random graph model is a set of graphs together with a probability distribution on that set. A random matrix is a matrix with entries consisting of random values from some specified distribution. Many different random matrices can be associated with a random graph. The spectra of these corresponding matrices are called the spectra of the random graph. The spectra of random graphs are critical to understanding the properties of random graphs. This thesis contains a number of results on the spectra and related spectral properties of several random graph models. In Chapter 1, we briefly present the background, some history as well as the main ideas behind our work. Apart from the introduction in Chapter 1, the first part of the main body of the thesis is Chapter 2. In this part we estimate the eigenvalues of the Laplacian matrix of random multipartite graphs. We also investigate some spectral properties of random multipartite graphs, such as the Laplacian energy, the Laplacian Estrada index, and the von Neumann entropy. The second part consists of Chapters 3, 4, 5 and 6. Guo and Mohar showed that mixed graphs are equivalent to digraphs if we regard (replace) each undirected edge as (by) two oppositely directed arcs. Motivated by the work of Guo and Mohar, we initially propose a new random graph model – the random mixed graph. Each arc is determined by an in-dependent random variable. The main themes of the second part are the spectra and related spectral properties of random mixed graphs. In Chapter 3, we prove that the empirical distribution of the eigenvalues of the Hermitian adjacency matrix converges to Wigner’s semicircle law. As an application of the LSD of Hermitian adjacency matrices, we estimate the Hermitian energy of a random mixed graph. In Chapter 4, we deal with the asymptotic behavior of the spectrum of the Hermitian adjacency matrix of random mixed graphs. We derive a separation result between the first and the remaining eigenvalues of the Hermitian adjacency matrix. As an application of the asymptotic behavior of the spectrum of the Hermitian adjacency matrix, we estimate the spectral moments of random mixed graphs. In Chapter 5, we prove that the empirical distribution of the eigenvalues of the normalized Hermitian Laplacian matrix converges to Wigner’s semicircle law. Moreover, in Chapter 6, we provide several results on the spectra of general random mixed graphs. In particular, we present a new probability inequality for sums of independent, random, self-adjoint matrices, and then apply this probability inequality to matrices arising from the study of random mixed graphs. We prove a concentration result involving the spectral norm of a random matrix and that of its expectation. Assuming that the probabilities of all the arcs of the mixed graph are mutually independent, we write the Hermitian adjacency matrix as a sum of random self-adjoint matrices. Using this, we estimate the spectrum of the Hermitian adjacency matrix, and prove a concentration result involving the spectrum of the normalized Hermitian Laplacian matrix and its expectation. Finally, in Chapter 7, we estimate upper bounds for the spectral radii of the skew adjacency matrix and skew Randić matrix of random oriented graphs
Random Walks Estimate Land Value
Expected urban population doubling calls for a compelling theory of the city.
Random walks and diffusions defined on spatial city graphs spot hidden areas of
geographical isolation in the urban landscape going downhill. First--passage
time to a place correlates with assessed value of land in that. The method
accounting the average number of random turns at junctions on the way to reach
any particular place in the city from various starting points could be used to
identify isolated neighborhoods in big cities with a complex web of roads,
walkways and public transport systems
- …