Information ranking and power laws on trees
نویسندگان
چکیده
منابع مشابه
Information Ranking and Power Laws on Trees
We consider the stochastic analysis of information ranking algorithms of large interconnected data sets, e.g. Google’s PageRank algorithm for ranking pages on the World Wide Web. The stochastic formulation of the problem results in an equation of the form R D = Q+ N X
متن کاملPower laws and market crashes Empirical laws on bursting bubbles
In this paper, we quantitatively investigate the statistical properties of a statistical ensemble of stock prices. We selected 1200 stocks traded on the Tokyo Stock Exchange, and formed a statistical ensemble of daily stock prices for each trading day in the 3-year period from January 4, 1999 to December 28, 2001, corresponding to the period of the forming of the internet bubble in Japn, and it...
متن کاملOn-line Ranking Algorithms for Trees
A node k-ranking of a graph G = (V, E) is a proper node coloring C: V {1, 2, ..., k} such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) C(x). In the on-line version of this problem, the nodes v1, v2,..., vn are coming one by one in an arbitrary order; and only the edges of the induced subgraph G[{v1, v2, ..., vi}] are known when the color...
متن کاملPower-laws and Non-Power-laws in Dark Matter Halos
Simulated dark matter profiles are often modelled as a ‘NFW’ density profile rather than a single power law. Recently, attention has turned to the rather rigorous power-law behaviour exhibited by the ‘pseudo phase-space density’ of the dark matter halo, which is defined dimensionally in terms of the local density and velocity dispersion of the dark matter particles. The non-power-law behaviour ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2010
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800004523