Titlebook: Algorithms and Models for the Web-Graph; 5th International Wo Anthony Bonato,Fan R. K. Chung Conference proceedings 2007 Springer-Verlag Be

GULF

Foam-Cells

Tabelle der bisher bekannten Ramanspektren,raph and a substantial set of queries with partially judged results, and found that its effectiveness (retrieval performance) is comparable to the original SALSA algorithm, while its efficiency (query-time speed) is substantially higher.

表被動(dòng)

擦試不掉

Manipulation-Resistant Reputations Using Hitting Time,stem based on hitting time resists tampering by individuals or groups who strategically place outlinks. We also present an algorithm to efficiently compute hitting time for all nodes in a massive graph; conventional algorithms do not scale adequately.

拋物線

Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model,he truncated polynomial chaos expansion of the random quantities. With each of these methods, we compute the expectation and standard deviation of the PageRanks. Our statistical analysis shows that the standard deviation of the PageRanks are uncorrelated with the PageRank vector.

relieve

Local Partitioning for Directed Graphs Using PageRank,andom walk in the directed graph. In addition, we describe how this algorithm may be applied to the PageRank Markov chain of an arbitrary directed graph, which provides a way to partition directed graphs that are not strongly connected.

伴隨而來(lái)

Peak-Bone-Mass

Parallelizing the Computation of PageRank, degree of accuracy. This should lead to increasingly better performance as we utilize more processors. For example, using . (a variant of Jacobi iteration) as our linear solver and the 2001 web graph from Stanford’s WebBase project, on 12 processors . outperforms . by a factor of 1.4, while on 32 processors the performance ratio improves to 2.8.

轉(zhuǎn)向

,Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet,ew estimator for the degree of a node in a traceroute-sampled graph; validate the estimator theoretically in ER graphs and, through computer experiments, for a wider range of graphs; and apply it to produce a new picture of the degree distribution of the autonomous system graph.

修改

A Spatial Web Graph Model with Local Influence Regions,ove that our model gives a power law in-degree distribution, with exponent in [2,?∞?) depending on the parameters, and with concentration for a wide range of in-degree values. We also show that the model allows for edges that span a large distance in the underlying space, modelling a feature often observed in real-world complex networks.