標(biāo)題: Titlebook: Algorithms and Models for the Web Graph; 9th International Wo Anthony Bonato,Jeannette Janssen Conference proceedings 2012 Springer-Verlag [打印本頁] 作者: 嚴(yán)峻 時(shí)間: 2025-3-21 18:34
書目名稱Algorithms and Models for the Web Graph影響因子(影響力)
書目名稱Algorithms and Models for the Web Graph影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Models for the Web Graph網(wǎng)絡(luò)公開度
書目名稱Algorithms and Models for the Web Graph網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Models for the Web Graph被引頻次
書目名稱Algorithms and Models for the Web Graph被引頻次學(xué)科排名
書目名稱Algorithms and Models for the Web Graph年度引用
書目名稱Algorithms and Models for the Web Graph年度引用學(xué)科排名
書目名稱Algorithms and Models for the Web Graph讀者反饋
書目名稱Algorithms and Models for the Web Graph讀者反饋學(xué)科排名
作者: Commission 時(shí)間: 2025-3-21 22:52 作者: 斜谷 時(shí)間: 2025-3-22 03:33
A Game-Theoretic Model of Attention in Social Networks, construct and analyze a family of production games that have an arbitrarily large price of anarchy. We also prove non-robustness of the price of anarchy for a particular instance of the introduced family, establishing a distinction between the games studied here and network congestion games.作者: enormous 時(shí)間: 2025-3-22 05:21
Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directio. mutuality tendency and minimizing the . mutuality tendency. Extensive simulation results on synthetic datasets as well as real online social network datasets such as Slashdot, demonstrate that our proposed mutuality-tendency-aware spectral clustering algorithm extracts more stable social community作者: Adjourn 時(shí)間: 2025-3-22 09:40
A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence, the entire graph .(.) by the biassed walk is .. Thus the expected time to discover all vertices by the biassed walk is not much higher than in the case of a simple random walk Θ(. log.)..The standard preferential attachment process generates graphs with power law .?=?3. Choosing search parameter .?作者: compassion 時(shí)間: 2025-3-22 13:37 作者: 上坡 時(shí)間: 2025-3-22 17:43
Neurophysiologische Mechanismen im Schlafhis problem must have expected time complexity of .. Thus, our algorithm is optimal up to logarithmic factors. Our algorithm (for identifying vertices with significant PageRank) applies a multi-scale sampling scheme that uses a fast personalized PageRank estimator as its main subroutine. For that, w作者: laceration 時(shí)間: 2025-3-22 23:47 作者: 效果 時(shí)間: 2025-3-23 03:14
M. Hennerici,M. Daffertshofer,S. Meairs. mutuality tendency and minimizing the . mutuality tendency. Extensive simulation results on synthetic datasets as well as real online social network datasets such as Slashdot, demonstrate that our proposed mutuality-tendency-aware spectral clustering algorithm extracts more stable social community作者: 固定某物 時(shí)間: 2025-3-23 09:31
,Spontane intrazerebrale H?matome, the entire graph .(.) by the biassed walk is .. Thus the expected time to discover all vertices by the biassed walk is not much higher than in the case of a simple random walk Θ(. log.)..The standard preferential attachment process generates graphs with power law .?=?3. Choosing search parameter .?作者: 欲望小妹 時(shí)間: 2025-3-23 12:01 作者: 不成比例 時(shí)間: 2025-3-23 14:54 作者: ligature 時(shí)間: 2025-3-23 21:24
Uro? J. Jovanovi? (Priv.-Dozent)ery fixed .?>?0, there is no (..)-approximation algorithm, even if the input graph is restricted to have unit weight arcs, maximum out-degree three, and two sinks. We also present a polynomial time algorithm for solving the DAG Partitioning problem in graphs with bounded pathwidth.作者: 淺灘 時(shí)間: 2025-3-23 22:11
Herdaktivation durch Schlaf oder Medikamentehe spatial embedding of the nodes models the background knowledge or identity of the node, which influences its link environment. In this paper, we focus on the (directed) diameter, small separators, and the (weak) giant component of the model.作者: 安裝 時(shí)間: 2025-3-24 04:34
On a DAG Partitioning Problem,ery fixed .?>?0, there is no (..)-approximation algorithm, even if the input graph is restricted to have unit weight arcs, maximum out-degree three, and two sinks. We also present a polynomial time algorithm for solving the DAG Partitioning problem in graphs with bounded pathwidth.作者: 不能逃避 時(shí)間: 2025-3-24 08:31 作者: 錢財(cái) 時(shí)間: 2025-3-24 11:25
Conference proceedings 2012of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.作者: Offbeat 時(shí)間: 2025-3-24 16:46 作者: TOM 時(shí)間: 2025-3-24 19:19
M. Hennerici,M. Daffertshofer,S. Meairs. We demonstrate the effectiveness of the evolving teleportation on the Wikipedia graph and the Twitter social network. The external interest is given by the number of hourly visitors to each page and the number of monthly tweets for each user.作者: 不可比擬 時(shí)間: 2025-3-25 03:06
Physiologie der Hirndurchblutung,he situation that the demand distribution evolves mostly in clusters around the initial vertices and the case that the demands spread to the whole network. We establish sharp upper bounds for the probability that the demands are satisfied as a function of PageRank vectors.作者: 木訥 時(shí)間: 2025-3-25 07:06
Neurophysiologische Mechanismen im Schlafsts of nodes with high probability and with computational savings of orders of magnitude. We also propose stopping criteria for the random walk method which requires very little knowledge about the structure of the network..?(. .)作者: 不要不誠實(shí) 時(shí)間: 2025-3-25 10:05
K.-H. Mauritz,T. Platz,S. Hesseo be proportional to the number of desired number of edges. We also prescribe a method for choosing this proportionality constant. We run a series of experiments showing that the distributions of common graph properties converge in this time, providing empirical evidence for our claims.作者: 不公開 時(shí)間: 2025-3-25 15:04
Quick Detection of Nodes with Large Degrees,sts of nodes with high probability and with computational savings of orders of magnitude. We also propose stopping criteria for the random walk method which requires very little knowledge about the structure of the network..?(. .)作者: vocation 時(shí)間: 2025-3-25 16:36
Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs,o be proportional to the number of desired number of edges. We also prescribe a method for choosing this proportionality constant. We run a series of experiments showing that the distributions of common graph properties converge in this time, providing empirical evidence for our claims.作者: Lipohypertrophy 時(shí)間: 2025-3-25 20:11
Ranking and Sparsifying a Connection Graph,usion distances for vector diffusion maps in data and image processing. Furthermore, the edge ranking of the connection graphs determined by the vectorized PageRank and effective resistance are an essential part of sparsification algorithms which simplify and preserve the global structure of connection graphs.作者: Injunction 時(shí)間: 2025-3-26 03:42
Dynamic PageRank Using Evolving Teleportation,. We demonstrate the effectiveness of the evolving teleportation on the Wikipedia graph and the Twitter social network. The external interest is given by the number of hourly visitors to each page and the number of monthly tweets for each user.作者: 柔軟 時(shí)間: 2025-3-26 04:39 作者: Salivary-Gland 時(shí)間: 2025-3-26 09:52 作者: 包裹 時(shí)間: 2025-3-26 15:55
Anthony Bonato,Jeannette JanssenUp-to-date results.Fast-track conference proceedings.State-of-the-art research作者: happiness 時(shí)間: 2025-3-26 20:48 作者: Infraction 時(shí)間: 2025-3-27 00:25 作者: Occlusion 時(shí)間: 2025-3-27 02:43
M. Hennerici,M. Daffertshofer,S. MeairsIn this work we analyze fundamental properties of Random Apollonian Networks [34,35], a popular random graph model which generates planar graphs with power law properties. Specifically, we analyze (a) the degree distribution, (b) the . largest degrees, (c) the . largest eigenvalues and (d) the diameter, where . is a constant.作者: 高腳酒杯 時(shí)間: 2025-3-27 08:38 作者: Longitude 時(shí)間: 2025-3-27 12:01 作者: 拋媚眼 時(shí)間: 2025-3-27 14:40 作者: Communicate 時(shí)間: 2025-3-27 20:47 作者: Irascible 時(shí)間: 2025-3-27 23:16
Uro? J. Jovanovi? (Priv.-Dozent) each of the resulting connected components has exactly one sink. We prove that the problem is hard to approximate in a strong sense: If . then for every fixed .?>?0, there is no (..)-approximation algorithm, even if the input graph is restricted to have unit weight arcs, maximum out-degree three, a作者: 疾馳 時(shí)間: 2025-3-28 04:04
Herdaktivation durch Schlaf oder Medikamente. In the SPA model, nodes have spheres of influence of varying size, and new nodes may only link to a node if they fall within its influence region. The spatial embedding of the nodes models the background knowledge or identity of the node, which influences its link environment. In this paper, we fo作者: 低三下四之人 時(shí)間: 2025-3-28 07:57 作者: JUST 時(shí)間: 2025-3-28 13:09
Neurophysiologische Mechanismen im Schlaft often the case in complex networks), a deterministic algorithm to find the top . list of nodes with the largest degrees requires an average complexity of ., where . is the number of nodes in the network. Even this modest complexity can be very high for large complex networks. We propose to use the作者: 集合 時(shí)間: 2025-3-28 18:38
Rudolf Janzen,Walter Bushart,Gerd Wendlernd a .-dimensional linear transformation. We consider vectorized versions of the PageRank and effective resistance which can be used as basic tools for organizing and analyzing complex data sets. For example, the generalized PageRank and effective resistance can be utilized to derive and modify diff作者: 自由職業(yè)者 時(shí)間: 2025-3-28 18:58
,Die Behandlung der Schlafst?rungen,quantify inefficiencies from contributions by strategic users in online environments. Attention and information are assumed to be the main motivation for user contributions. We treat attention as a mechanism for sharing the profit from consuming information and introduce a general framework for anal作者: intolerance 時(shí)間: 2025-3-29 02:55 作者: condone 時(shí)間: 2025-3-29 06:55 作者: PAGAN 時(shí)間: 2025-3-29 09:10 作者: esculent 時(shí)間: 2025-3-29 13:42 作者: Nutrient 時(shí)間: 2025-3-29 17:49
,Spontane intrazerebrale H?matome,walk, where the bias is a function of the power law . of the degree sequence..Let .(.) be a .-vertex graph, with degree sequence power law .?≥?3 generated by a generalized preferential attachment process which adds . edges at each step. Let .. be the set of all vertices of degree at least .. in .(.)
