標(biāo)題: Titlebook: Algorithms and Models for the Web-Graph; 5th International Wo Anthony Bonato,Fan R. K. Chung Conference proceedings 2007 Springer-Verlag Be [打印本頁(yè)] 作者: 孵化 時(shí)間: 2025-3-21 18:05
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph影響因子(影響力)
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph被引頻次
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph年度引用
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph讀者反饋
書(shū)目名稱(chēng)Algorithms and Models for the Web-Graph讀者反饋學(xué)科排名
作者: 打折 時(shí)間: 2025-3-21 23:38 作者: faultfinder 時(shí)間: 2025-3-22 01:28 作者: AUGUR 時(shí)間: 2025-3-22 04:44 作者: modish 時(shí)間: 2025-3-22 09:00 作者: 使服水土 時(shí)間: 2025-3-22 16:46 作者: 草本植物 時(shí)間: 2025-3-22 19:30
,Das Atelier 35, Rue de Sèvres,y techniques used in calculating statistics about the internet, it can introduce bias that corrupts these estimates. This paper reports on a theoretical and experimental investigation of a new technique to reduce the bias of traceroute sampling when estimating the degree distribution. We develop a n作者: photophobia 時(shí)間: 2025-3-23 00:00
,Das Atelier 35, Rue de Sèvres,ch, we show that the PageRank share of IN and SCC components remains high even for very large values of the damping factor, in spite of the fact that it drops to zero when .→1. However, a detailed study of the OUT component reveals the presence of “dead-ends” (small groups of pages linking only to e作者: formula 時(shí)間: 2025-3-23 02:04 作者: maudtin 時(shí)間: 2025-3-23 05:31 作者: 并排上下 時(shí)間: 2025-3-23 10:47
https://doi.org/10.1007/978-3-662-58782-9riteria are limited in that clusters typically do not overlap, all vertices are clustered and/or external sparsity is ignored. We introduce a new criterion that overcomes these limitations by combining internal density with external sparsity in a natural way. An algorithm is given for provably findi作者: Ondines-curse 時(shí)間: 2025-3-23 16:42 作者: 憤怒歷史 時(shí)間: 2025-3-23 18:01
https://doi.org/10.1007/978-3-658-33215-0 be globally relevant, the teleportation coefficient should account for the influence of all users. Therefore, we correct the PageRank formulation by modeling the teleportation coefficient as a random variable distributed according to user behavior. With this correction, the PageRank values themselv作者: 不規(guī)則的跳動(dòng) 時(shí)間: 2025-3-23 23:19 作者: PSA-velocity 時(shí)間: 2025-3-24 06:10 作者: 諷刺滑稽戲劇 時(shí)間: 2025-3-24 10:22
https://doi.org/10.1007/978-3-7091-3108-4mine betweenness; currently the fastest-known algorithm by Brandes requires .(.) time for unweighted graphs and .(.?+?. .log.) time for weighted graphs, where . is the number of vertices and . is the number of edges in the network. These are also the worst-case time bounds for computing the betweenn作者: Chronic 時(shí)間: 2025-3-24 12:27 作者: 引水渠 時(shí)間: 2025-3-24 17:42 作者: Obsequious 時(shí)間: 2025-3-24 22:30 作者: Intellectual 時(shí)間: 2025-3-25 01:12
,Die Autonomie des Aufkl?rers in der Krise,etworks such as the web. This model simultaneously captures several well-known properties of real-world networks; in particular, it gives rise to a heavy-tailed degree distribution, has a low diameter, and obeys the densification power law. Most properties of Kronecker products of graphs (such as co作者: Arteriography 時(shí)間: 2025-3-25 05:07
Tabelle der bisher bekannten Ramanspektren,local information to reach their destination in a bounded number of steps in expectation. This class includes (with small modifications) the search algorithms used in Kleinberg’s pioneering work on long-range percolation graphs and hierarchical network models. We give a characterization of searchabl作者: LITHE 時(shí)間: 2025-3-25 09:54
Tabelle der bisher bekannten Ramanspektren,b graph a summary of its immediate neighborhood (which is a query-independent operation and thus can be done off-line), and to approximate the neighborhood graph of a result set at query-time by combining the summaries of the result set nodes. This approximation of the query-specific neighborhood gr作者: CYN 時(shí)間: 2025-3-25 14:35 作者: JAMB 時(shí)間: 2025-3-25 18:19 作者: GUILT 時(shí)間: 2025-3-25 21:18
978-3-540-77003-9Springer-Verlag Berlin Heidelberg 2007作者: 使顯得不重要 時(shí)間: 2025-3-26 02:24
Random Dot Product Graph Models for Social Networks, graph model proposed by Kraetzl, Nickel and Scheinerman, and Tucker [1,2]. In particular we consider the properties of clustering, diameter and degree distribution with respect to these models. Additionally we explore the conductance of these models and show that in a geometric sense, the conductance is constant.作者: boisterous 時(shí)間: 2025-3-26 06:26
https://doi.org/10.1007/978-3-8274-2774-8del yields a graph with power-law degree distribution where the expansion property depends on a tunable parameter of the model..The vertices of .. are . sequentially generated points ..,..,...,.. chosen uniformly at random from the unit sphere in .. After generating .., we randomly connect it to . points from those points in ..,..,...,.. ....作者: endarterectomy 時(shí)間: 2025-3-26 12:14
https://doi.org/10.1007/978-3-7091-3108-4gle-source shortest path computations for vertices with high centrality. We conduct an extensive experimental study on real-world graph instances, and observe that our random sampling algorithm gives very good betweenness approximations for biological networks, road networks and web crawls.作者: lesion 時(shí)間: 2025-3-26 14:25
,Die Autonomie des Aufkl?rers in der Krise,a phase transition for the emergence of the giant component and another phase transition for connectivity, and prove that such graphs have constant diameters beyond the connectivity threshold, but are not searchable using a decentralized algorithm.作者: 亞當(dāng)心理陰影 時(shí)間: 2025-3-26 18:28 作者: 咽下 時(shí)間: 2025-3-26 21:49 作者: cylinder 時(shí)間: 2025-3-27 02:39 作者: HACK 時(shí)間: 2025-3-27 07:50
,Das Atelier 35, Rue de Sèvres,it drops to zero when .→1. However, a detailed study of the OUT component reveals the presence of “dead-ends” (small groups of pages linking only to each other) that receive an unfairly high ranking when . is close to one. We argue that this problem can be mitigated by choosing . as small as 1/2.作者: 厭煩 時(shí)間: 2025-3-27 12:23
https://doi.org/10.1007/978-3-662-58782-9erion that overcomes these limitations by combining internal density with external sparsity in a natural way. An algorithm is given for provably finding the clusters, provided there is a sufficiently large gap between internal density and external sparsity. Experiments on real social networks illustrate the effectiveness of the algorithm.作者: 拱墻 時(shí)間: 2025-3-27 16:37 作者: 迫擊炮 時(shí)間: 2025-3-27 20:01
Distribution of PageRank Mass Among Principle Components of the Web,it drops to zero when .→1. However, a detailed study of the OUT component reveals the presence of “dead-ends” (small groups of pages linking only to each other) that receive an unfairly high ranking when . is close to one. We argue that this problem can be mitigated by choosing . as small as 1/2.作者: Debility 時(shí)間: 2025-3-28 00:54 作者: 平庸的人或物 時(shí)間: 2025-3-28 03:43
Deterministic Decentralized Search in Random Graphs,gorithms used in Kleinberg’s pioneering work on long-range percolation graphs and hierarchical network models. We give a characterization of searchable graphs in this model, and use this characterization to prove a monotonicity property for searchability.作者: 愛(ài)哭 時(shí)間: 2025-3-28 10:13 作者: critic 時(shí)間: 2025-3-28 13:39 作者: GULF 時(shí)間: 2025-3-28 16:09 作者: Foam-Cells 時(shí)間: 2025-3-28 20:54
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) 時(shí)間: 2025-3-29 01:21 作者: 擦試不掉 時(shí)間: 2025-3-29 05:31
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.作者: 拋物線(xiàn) 時(shí)間: 2025-3-29 10:59
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 時(shí)間: 2025-3-29 15:03
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) 時(shí)間: 2025-3-29 17:58 作者: Peak-Bone-Mass 時(shí)間: 2025-3-29 21:56
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)向 時(shí)間: 2025-3-30 03:16
,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.作者: 修改 時(shí)間: 2025-3-30 06:54
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.作者: Minatory 時(shí)間: 2025-3-30 11:05
Determining Factors Behind the PageRank Log-Log Plot,stant, which depends mainly on the fraction of dangling nodes, average in-degree, the power law exponent, and the damping factor. The out-degree distribution has a minor effect, which we explicitly quantify. Finally, we propose a ranking scheme which does not depend on out-degrees.作者: 蠟燭 時(shí)間: 2025-3-30 13:07
,Das Atelier 35, Rue de Sèvres,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.作者: grounded 時(shí)間: 2025-3-30 20:37 作者: 悶熱 時(shí)間: 2025-3-30 23:21 作者: Introvert 時(shí)間: 2025-3-31 03:32
Finding a Dense-Core in Jellyfish Graphs,analyze its running time. We also implemented our algorithm and tested it on real AS-graph data. Our results show that the core discovered by our algorithm is nearly identical to the cores found by existing algorithms - at a fraction of the running time.作者: 漫步 時(shí)間: 2025-3-31 06:20 作者: Priapism 時(shí)間: 2025-3-31 10:44 作者: 獨(dú)白 時(shí)間: 2025-3-31 13:48
https://doi.org/10.1007/978-3-658-32104-8aining the .-contributing set of . and at most .(1/.) vertices from the ./2-contributing set of ., and which does so by examining at most .(1/.) vertices. We also give a local algorithm for solving the following problem: If there exist . vertices that contribute a .-fraction to the PageRank of ., fi作者: 樹(shù)木中 時(shí)間: 2025-3-31 20:27
,Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet,y techniques used in calculating statistics about the internet, it can introduce bias that corrupts these estimates. This paper reports on a theoretical and experimental investigation of a new technique to reduce the bias of traceroute sampling when estimating the degree distribution. We develop a n作者: FER 時(shí)間: 2025-3-31 23:31
Distribution of PageRank Mass Among Principle Components of the Web,ch, we show that the PageRank share of IN and SCC components remains high even for very large values of the damping factor, in spite of the fact that it drops to zero when .→1. However, a detailed study of the OUT component reveals the presence of “dead-ends” (small groups of pages linking only to e作者: 船員 時(shí)間: 2025-4-1 03:57
Finding a Dense-Core in Jellyfish Graphs,on using the Border Gateway Protocol (BGP). These relationships can be modeled as a graph, called the AS-graph, in which the vertices model the ASes, and the edges model the peering arrangements between the ASes. Based on topological studies, it is widely believed that the Internet graph contains a 作者: 大都市 時(shí)間: 2025-4-1 06:52 作者: ADOPT 時(shí)間: 2025-4-1 13:54
