Page 1

Displaying 1 – 6 of 6

Showing per page

Graph fibrations, graph isomorphism, and PageRank

Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna (2006)

RAIRO - Theoretical Informatics and Applications

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...

Green functions on self-similar graphs and bounds for the spectrum of the laplacian

Bernhard Krön (2002)

Annales de l’institut Fourier

Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method for spectral analysis on self-similar graphs.First, for a rather general, axiomatically defined class of self-similar graphs a graph theoretic analogue to the Banach fixed point theorem is proved. The subsequent results hold for a subclass consisting of “symmetrically” self-similar graphs which however is still more general then...

Growth rates and average optimality in risk-sensitive Markov decision chains

Karel Sladký (2008)

Kybernetika

In this note we focus attention on characterizations of policies maximizing growth rate of expected utility, along with average of the associated certainty equivalent, in risk-sensitive Markov decision chains with finite state and action spaces. In contrast to the existing literature the problem is handled by methods of stochastic dynamic programming on condition that the transition probabilities are replaced by general nonnegative matrices. Using the block-triangular decomposition of a collection...

Currently displaying 1 – 6 of 6

Page 1