SearcharxivSearch

arXiv · 0712.0469

Multiple equilibria of nonhomogeneous Markov chains and self-validating web rankings

Abstract

PageRank is a ranking of the web pages that measures how often a given web page is visited by a random surfer on the web graph, for a simple model of web surfing. It seems realistic that PageRank may also have an influence on the behavior of web surfers. We propose here a simple model taking into account the mutual influence between web ranking and web surfing. Our ranking, the T-PageRank, is a nonlinear generalization of the PageRank. It is defined as the limit, if it exists, of some nonlinear iterates. A positive parameter T, the temperature, measures the confidence of the web surfer in the web ranking. We prove that, when the temperature is large enough, the T-PageRank is unique and the iterates converge globally on the domain. But when the temperature is small, there may be several T-PageRanks, that may strongly depend on the initial ranking. Our analysis uses results of nonlinear Perron-Frobenius theory, Hilbert projective metric and Birkhoff's coefficient of ergodicity.

Explore related subjects

Keep this discovery

BibTeXRIS

Marianne Akian, Stephane Gaubert, Laure Ninove. 2007-12-04. Multiple equilibria of nonhomogeneous Markov chains and self-validating web rankings. https://arxiv.org/abs/0712.0469

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR