Google matrix and Ulam networks of intermittency maps

@article{Ermann2010GoogleMA,
  title={Google matrix and Ulam networks of intermittency maps},
  author={Leonardo Ermann and Dima L. Shepelyansky},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2010},
  volume={81 3 Pt 2},
  pages={
          036221
        }
}
  • L. Ermann, D. Shepelyansky
  • Published 19 November 2009
  • Mathematics, Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
We study the properties of the Google matrix of an Ulam network generated by intermittency maps. This network is created by the Ulam method which gives a matrix approximant for the Perron-Frobenius operator of dynamical map. The spectral properties of eigenvalues and eigenvectors of this matrix are analyzed. We show that the PageRank of the system is characterized by a power law decay with the exponent beta dependent on map parameters and the Google damping factor alpha . Under certain… 
Spectral properties of the Google matrix of the World Wide Web and other directed networks
TLDR
Numerically the spectrum and eigenstate properties of the Google matrix of various examples of directed networks such as vocabulary networks of dictionaries and university World Wide Web networks are studied, including the PageRank.
Google matrix of Twitter
TLDR
This work constructs the Google matrix of the entire Twitter network, dated by July 2009, and analyzes its spectrum and eigenstate properties including the PageRank and CheiRank vectors and 2DRanking of all nodes to argue that this small fraction of the whole number of users plays the dominant role in the process of opinion formation on the network.
Fractal Weyl law for Linux Kernel architecture
TLDR
The results obtained for various versions of the Linux Kernel show that the spectrum is characterized by the fractal Weyl law established recently for systems of quantum chaotic scattering and the Perron-Frobenius operators of dynamical maps.
Arnold cat map, Ulam method and time reversal
Google matrix analysis of directed networks
TLDR
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.
Google matrix of Bitcoin network
TLDR
The Google matrix analysis of bitcoin network gives a new understanding of the bitcoin transactions with PageRank and CheiRank characterization of sellers and buyers which are dominant not simply due to the sold/bought volume but also by taking into account if bitcoins are sold to (bought by) other important sellers (buyers).
Ulam method and fractal Weyl law for Perron-Frobenius operators
We use the Ulam method to study spectral properties of the Perron-Frobenius operators of dynamical maps in a chaotic regime. For maps with absorption we show numerically that the spectrum is
Towards Google matrix of brain
Ulam method for the Chirikov standard map
AbstractWe introduce a generalized Ulam method and apply it to symplectic dynamical maps with a divided phase space. Our extensive numerical studies based on the Arnoldi method show that the Ulam
...
1
2
...

References

SHOWING 1-10 OF 84 REFERENCES
Google matrix, dynamical attractors, and Ulam networks.
TLDR
The properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation are studied, which shows a power-law decay in PageRank that mirrors the decay of PageRank on the world wide web and a sensitivity to the value alpha inPageRank.
Delocalization transition for the Google matrix
TLDR
It is argued that, for networks with delocalized PageRank, the efficiency of information retrieval by Google-type search is strongly affected since the PageRank values have no clear hierarchical structure in this case.
PageRank of Scale-Free Growing Networks
TLDR
An analytical expression is found for the expected PageRank value in a scale-free growing network model as a function of the age of the growing network and theAge of a particular node and it is shown that PageRank follows closely a power law in the middle range of its values.
Eigenvalue spectrum of the Frobenius-Perron operator near intermittency.
  • Kaufmann, Lustfeld, Béné
  • Mathematics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1996
The spectral properties of the Frobenius-Perron operator of one-dimensional maps are studied when approaching a weakly intermittent situation. Numerical investigation of a particular family of maps
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
TLDR
A novel mathematical model is presented that explains the relation between PageRank and In-Degree through a stochastic equation, which is inspired by the original definition of PageRank, and is analogous to the well-known distributional identity for the busy period in the M/G/1 queue.
Slowly mixing systems and intermittency maps
  • M. Holland
  • Mathematics
    Ergodic Theory and Dynamical Systems
  • 2004
We consider families of one-dimensional maps on the circle which mix at sub-polynomial rates. Such maps will have an indifferent fixed point, and we show that the rate of mixing of these maps is
Using PageRank to Characterize Web Structure
TLDR
It is suggested that PageRank values on the web follow a power law, and generative models for the web graph are developed that explain this observation and moreover remain faithful to previously studied degree distributions.
Scaling in multifractals: Discretization of an eigenvalue problem.
  • Kovács, Tél
  • Mathematics, Physics
    Physical review. A, General physics
  • 1989
A matrix approximant to the generalized Frobenius-Perron equation is presented, the largest eigenvalues of which approach the most important eigenvalues of the operator (e.g., the so-called free
Large scale properties of the Webgraph
TLDR
Experimental findings on the topological properties of web graphs, such as the number of bipartite cores and the distribution of degree, PageRank values and strongly connected components are reported.
Algorithms and Models for the Web-Graph, 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings
TLDR
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet and Giant Component and Connectivity in Geographical Threshold Graphs.
...
1
2
3
4
5
...