60,977 research outputs found
Small World Graphs by the iterated "My Friends are Your Friends'' Principle
We study graphs obtained by successive creation and destruction of edges into
small neighborhoods of the vertices. Starting with a circle graph of large
diameter we obtain small world graphs with logarithmic diameter, high
clustering coefficients and a fat tail distribution for the degree. Only local
edge formation processes are involved and no preferential attachment was used.
Furthermore we found an interesting phase transition with respect to the
initial conditions.Comment: Latex, 12 pages with 10 figure
Geometrical and spectral study of beta-skeleton graphs
We perform an extensive numerical analysis of beta-skeleton graphs, a particular type of proximity graphs. In beta-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter beta is an element of (0, infinity), is satisfied. Moreover, for beta > 1 there exist two different proximity rules, leading to lune-based and circle-based BSGs. First, by computing the average degree of large ensembles of BSGs we detect differences, which increase with the increase of beta, between lune-based and circle-based BSGs. Then, within a random matrix theory (RMT) approach, we explore spectral and eigenvector properties of random BSGs by the use of the nearest-neighbor energy-level spacing distribution and the entropic eigenvector localization length, respectively. The RMT analysis allows us to conclude that a localization transition occurs at beta = 1
Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
Many natural and social systems develop complex networks, that are usually
modelled as random graphs. The eigenvalue spectrum of these graphs provides
information about their structural properties. While the semi-circle law is
known to describe the spectral density of uncorrelated random graphs, much less
is known about the eigenvalues of real-world graphs, describing such complex
systems as the Internet, metabolic pathways, networks of power stations,
scientific collaborations or movie actors, which are inherently correlated and
usually very sparse. An important limitation in addressing the spectra of these
systems is that the numerical determination of the spectra for systems with
more than a few thousand nodes is prohibitively time and memory consuming.
Making use of recent advances in algorithms for spectral characterization, here
we develop new methods to determine the eigenvalues of networks comparable in
size to real systems, obtaining several surprising results on the spectra of
adjacency matrices corresponding to models of real-world graphs. We find that
when the number of links grows as the number of nodes, the spectral density of
uncorrelated random graphs does not converge to the semi-circle law.
Furthermore, the spectral densities of real-world graphs have specific features
depending on the details of the corresponding models. In particular, scale-free
graphs develop a triangle-like spectral density with a power law tail, while
small-world graphs have a complex spectral density function consisting of
several sharp peaks. These and further results indicate that the spectra of
correlated graphs represent a practical tool for graph classification and can
provide useful insight into the relevant structural properties of real
networks.Comment: 14 pages, 9 figures (corrected typos, added references) accepted for
Phys. Rev.
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focussed
attention on graphs with distributions of vertex degree that are significantly
different from the Poisson degree distributions that have been widely studied
in the past. In this paper we develop in detail the theory of random graphs
with arbitrary degree distributions. In addition to simple undirected,
unipartite graphs, we examine the properties of directed and bipartite graphs.
Among other results, we derive exact expressions for the position of the phase
transition at which a giant component first forms, the mean component size, the
size of the giant component if there is one, the mean number of vertices a
certain distance away from a randomly chosen vertex, and the average
vertex-vertex distance within a graph. We apply our theory to some real-world
graphs, including the world-wide web and collaboration graphs of scientists and
Fortune 1000 company directors. We demonstrate that in some cases random graphs
with appropriate distributions of vertex degree predict with surprising
accuracy the behavior of the real world, while in others there is a measurable
discrepancy between theory and reality, perhaps indicating the presence of
additional social structure in the network that is not captured by the random
graph.Comment: 19 pages, 11 figures, some new material added in this version along
with minor updates and correction
A Bose-Einstein Approach to the Random Partitioning of an Integer
Consider N equally-spaced points on a circle of circumference N. Choose at
random n points out of on this circle and append clockwise an arc of
integral length k to each such point. The resulting random set is made of a
random number of connected components. Questions such as the evaluation of the
probability of random covering and parking configurations, number and length of
the gaps are addressed. They are the discrete versions of similar problems
raised in the continuum. For each value of k, asymptotic results are presented
when n,N both go to infinity according to two different regimes. This model may
equivalently be viewed as a random partitioning problem of N items into n
recipients. A grand-canonical balls in boxes approach is also supplied, giving
some insight into the multiplicities of the box filling amounts or spacings.
The latter model is a k-nearest neighbor random graph with N vertices and kn
edges. We shall also briefly consider the covering problem in the context of a
random graph model with N vertices and n (out-degree 1) edges whose endpoints
are no more bound to be neighbors
- …