45,727 research outputs found
Google matrix analysis of DNA sequences
For DNA sequences of various species we construct the Google matrix G of
Markov transitions between nearby words composed of several letters. The
statistical distribution of matrix elements of this matrix is shown to be
described by a power law with the exponent being close to those of outgoing
links in such scale-free networks as the World Wide Web (WWW). At the same time
the sum of ingoing matrix elements is characterized by the exponent being
significantly larger than those typical for WWW networks. This results in a
slow algebraic decay of the PageRank probability determined by the distribution
of ingoing elements. The spectrum of G is characterized by a large gap leading
to a rapid relaxation process on the DNA sequence networks. We introduce the
PageRank proximity correlator between different species which determines their
statistical similarity from the view point of Markov chains. The properties of
other eigenstates of the Google matrix are also discussed. Our results
establish scale-free features of DNA sequence networks showing their
similarities and distinctions with the WWW and linguistic networks.Comment: latex, 11 fig
Random matrix analysis of network Laplacians
We analyze eigenvalues fluctuations of the Laplacian of various networks
under the random matrix theory framework. Analyses of random networks,
scale-free networks and small-world networks show that nearest neighbor spacing
distribution of the Laplacian of these networks follow Gaussian orthogonal
ensemble statistics of random matrix theory. Furthermore, we study nearest
neighbor spacing distribution as a function of the random connections and find
that transition to the Gaussian orthogonal ensemble statistics occurs at the
small-world transition.Comment: 14 pages, 5 figures, replaced with the final versio
Random matrix analysis of complex networks
We study complex networks under random matrix theory (RMT) framework. Using
nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the
eigenvalues of adjacency matrix of various model networks, namely, random,
scale-free and small-world networks. These distributions follow Gaussian
orthogonal ensemble statistic of RMT. To probe long-range correlations in the
eigenvalues we study spectral rigidity via statistic of RMT as well.
It follows RMT prediction of linear behavior in semi-logarithmic scale with
slope being . Random and scale-free networks follow RMT
prediction for very large scale. Small-world network follows it for
sufficiently large scale, but much less than the random and scale-free
networks.Comment: accepted in Phys. Rev. E (replaced with the final version
Google matrix analysis of directed networks
In past ten years, modern societies developed enormous communication and
social networks. Their classification and information retrieval processing
become a formidable task for the society. Due to the rapid growth of World Wide
Web, social and communication networks, new mathematical methods have been
invented to characterize the properties of these networks on a more detailed
and precise level. Various search engines are essentially using such methods.
It is highly important to develop new tools to classify and rank enormous
amount of network information in a way adapted to internal network structures
and characteristics. This review describes the Google matrix analysis of
directed complex networks demonstrating its efficiency on various examples
including World Wide Web, Wikipedia, software architecture, world trade, social
and citation networks, brain neural networks, DNA sequences and Ulam networks.
The analytical and numerical matrix methods used in this analysis originate
from the fields of Markov chains, quantum chaos and Random Matrix theory.Comment: 56 pages, 58 figures. Missed link added in network example of Fig3
Universality in Complex Networks: Random Matrix Analysis
We apply random matrix theory to complex networks. We show that nearest
neighbor spacing distribution of the eigenvalues of the adjacency matrices of
various model networks, namely scale-free, small-world and random networks
follow universal Gaussian orthogonal ensemble statistics of random matrix
theory. Secondly we show an analogy between the onset of small-world behavior,
quantified by the structural properties of networks, and the transition from
Poisson to Gaussian orthogonal ensemble statistics, quantified by Brody
parameter characterizing a spectral property. We also present our analysis for
a protein-protein interaction network in budding yeast.Comment: 4+ pages, 4 figures, to appear in PRE, major change in the paper
including titl
Tools and techniques for AIS Strategic Planning.
AIS went through and will continue to undergo evolution and revolution as it grows. This article analyzes the current state of AIS and concludes it is in or approaching a crisis of priorities. Planning is the recommended path for solving this crisis. Four planning methods are proposed: stakeholder analysis, service matrix analysis, missions matrix analysis, and a four-year budget cycle.AIS, planning, planning methods, priority setting, stakeholder analysis, service matrix analysis, missions matrix analysis, budget cycleAssociation of Information Systems Planning; Planning method; Stakeholder analysis; Service matrix analysis; Missions matrix analysis; Planification stratégique;
Matrix analysis for associated consistency in cooperative game theory
Hamiache's recent axiomatization of the well-known Shapley value for TU games states that the Shapley value is the unique solution verifying the following three axioms: the inessential game property, continuity and associated consistency. Driessen extended Hamiache's axiomatization to the enlarged class of efficient, symmetric, and linear values, of which the Shapley value is the most important representative.
In this paper, we introduce the notion of row (resp. column)-coalitional matrix in the framework of cooperative game theory. Particularly, both the Shapley value and the associated game are represented algebraically by their coalitional matrices called the Shapley standard matrix and the associated transformation matrix respectively. We develop a matrix approach for Hamiache's axiomatization of the Shapley value. The associated consistency for the Shapley value is formulated as the matrix equality The diagonalization procedure of and the inessential property for coalitional matrices are fundamental tools to prove the convergence of the sequence of repeated associated games as well as its limit game to be inessential. In addition, a similar matrix approach is applicable to study Driessen's axiomatization of a certain class of linear values. Matrix analysis is adopted throughout both the mathematical developments and the proofs. In summary, it is illustrated that matrix analysis is a new and powerful technique for research in the field of cooperative game theory
- …