Internet Mathematics最新文献_第8页

A Dynamical System for PageRank with Time-Dependent Teleportation 具有时间相关隐形传态的PageRank动态系统

Internet Mathematics Pub Date : 2012-11-18 DOI: 10.1080/15427951.2013.814092

D. Gleich, Ryan A. Rossi

{"title":"A Dynamical System for PageRank with Time-Dependent Teleportation","authors":"D. Gleich, Ryan A. Rossi","doi":"10.1080/15427951.2013.814092","DOIUrl":"https://doi.org/10.1080/15427951.2013.814092","url":null,"abstract":"Abstract We propose a dynamical system that captures changes to the network centrality of nodes as external interest in those nodes varies. We derive this system by adding time-dependent teleportation to the PageRank score. The result is not a single set of importance scores, but rather a time-dependent set. These can be converted into ranked lists in a variety of ways, for instance, by taking the largest change in the importance score. For an interesting class of dynamic teleportation functions, we derive closed-form solutions for the dynamic PageRank vector. The magnitude of the deviation from a static PageRank vector is given by a PageRank problem with complex-valued teleportation parameters. Moreover, these dynamical systems are easy to evaluate. We demonstrate the utility of dynamic teleportation on both the article graph of Wikipedia, where the external interest information is given by the number of hourly visitors to each page, and the Twitter social network, where external interest is the number of tweets per month. For these problems, we show that using information from the dynamical system helps improve a prediction task and identify trends in the data.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"10 1","pages":"188 - 217"},"PeriodicalIF":0.0,"publicationDate":"2012-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2013.814092","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59947540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 43

On the Peak-to-Average Power Ratio Reduction Problem for Orthogonal Transmission Schemes 正交传输方案的峰均功率比减小问题

Internet Mathematics Pub Date : 2012-08-26 DOI: 10.1080/15427951.2012.728100

H. Boche, Brendan Farrell

引用次数: 12

An Extended Stochastic Model for Quantitative Security Analysis of Networked Systems 网络系统定量安全分析的扩展随机模型

Internet Mathematics Pub Date : 2012-08-01 DOI: 10.1080/15427951.2012.654480

Maochao Xu, Shouhuai Xu

引用次数: 35

A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence 幂律度序列图中所有高次顶点的快速查找算法

Internet Mathematics Pub Date : 2012-06-22 DOI: 10.1080/15427951.2013.819210

C. Cooper, T. Radzik, Yiannis Siantos

{"title":"A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence","authors":"C. Cooper, T. Radzik, Yiannis Siantos","doi":"10.1080/15427951.2013.819210","DOIUrl":"https://doi.org/10.1080/15427951.2013.819210","url":null,"abstract":"Abstract We develop a fast method for finding all high-degree vertices of a connected graph with a power-law degree sequence. The method uses a biased random walk, where the bias is a function of the power law c of the degree sequence. Let G(t) be a t-vertex graph, with degree sequence power law c ≥ 3 generated by a generalized preferential attachment process that adds m edges at each step. Let Sa be the set of all vertices of degree at least ta in G(t). We analyze a biased random walk that makes transitions along undirected edges {x, y} with probabilities proportional to (d(x)d(y))b, where d(x) is the degree of vertex x and b > 0 is a constant parameter. With parameter b = (c − 1)(c − 2)/(2c − 3), the random walk discovers the set Sa completely in steps with high probability. The error parameter ε depends on c, a, and m. The cover time of the entire graph G(t) by the biased walk is . Thus the expected time to discover all vertices by the biased walk is not much higher than the Θ(tlog t) cover time of a simple random walk. The standard preferential attachment process generates graphs with power law c = 3. The search parameter b = 2/3 is appropriate for such graphs. We conduct experimental tests on a preferential attachment graph and on a sample of the underlying graph of the World Wide Web with power law c ≈ 3 that support the claimed property.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"62 1","pages":"137 - 161"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2013.819210","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59947595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Ranking and Sparsifying a Connection Graph 连接图的排序与稀疏

Internet Mathematics Pub Date : 2012-06-22 DOI: 10.1080/15427951.2013.800005

F. Graham, Wenbo Zhao, Mark Kempton

引用次数: 23

Hypergraph Coloring Games and Voter Models 超图着色游戏和选民模型

Internet Mathematics Pub Date : 2012-06-22 DOI: 10.1080/15427951.2013.833676

F. Graham, Alexander Tsiatas

{"title":"Hypergraph Coloring Games and Voter Models","authors":"F. Graham, Alexander Tsiatas","doi":"10.1080/15427951.2013.833676","DOIUrl":"https://doi.org/10.1080/15427951.2013.833676","url":null,"abstract":"Abstract We analyze a network coloring game on hypergraphs that can also describe a voter model. Each node represents a voter and is colored according to its preferred candidate (or undecided). Each hyperedge is a subset of voters that can interact and influence one another. In each round of the game, one hyperedge is chosen randomly, and the voters in the hyperedge can change their colors according to some prescribed probability distribution. We analyze this interaction model based on random walks on the associated weighted directed state graph. Under certain “memoryless” restrictions, we can use semigroup spectral methods to explicitly determine the spectrum of the state graph, and the random walk on the state graph converges to its stationary distribution in O(mlog n) steps, where n is the number of voters and m the number of hyperedges. We can then estimate probabilities that events occur within an error bound of ε by simulating the voting game for O(log (1/ε)mlog n) rounds. We also consider a partially memoryless game using the memoryless game for comparison and analysis, which serves as an approximation of the actual interaction dynamics.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"10 1","pages":"66 - 86"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2013.833676","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59947739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Some Typical Properties of the Spatial Preferred Attachment Model 空间偏好依恋模型的几个典型特征

Internet Mathematics Pub Date : 2012-06-22 DOI: 10.1080/15427951.2013.796301

C. Cooper, A. Frieze, P. Prałat

引用次数: 38

Concentration and Stability of Community-Detecting Functions on Random Networks 随机网络上社区检测函数的集中与稳定性

Internet Mathematics Pub Date : 2012-03-27 DOI: 10.1080/15427951.2012.749437

Weituo Zhang, C. Lim

引用次数: 0

Introduction to the Special Issue on Algorithms and Models for the Web Graph 网络图的算法和模型专题导论

Internet Mathematics Pub Date : 2012-03-01 DOI: 10.1080/15427951.2012.635562

A. Bonato, Ravi Kumar, D. Sivakumar

{"title":"Introduction to the Special Issue on Algorithms and Models for the Web Graph","authors":"A. Bonato, Ravi Kumar, D. Sivakumar","doi":"10.1080/15427951.2012.635562","DOIUrl":"https://doi.org/10.1080/15427951.2012.635562","url":null,"abstract":"This issue of Internet Mathematics includes a selection of papers that were presented at the Seventh Workshop on Algorithms and Models for the Web-Graph, WAW 2010, held at Stanford University in December 2010. The papers in this issue, unlike the conference proceedings of the workshop, do not have page limits and contain full versions of proofs and algorithms. All the articles have been thoroughly reviewed in accordance with the usual high standards of Internet Mathematics. The papers address a number of topics related to complex networks such as network-creation games, applications of PageRank, efficient triangle-counting algorithms, and models for online social networks. The last decade has seen an explosive growth in research on complex networks, ranging from the web graph, to online social networks, to protein–protein interaction networks. Such research has been of great practical importance and has also pushed the frontiers of pure mathematics. One of the goals of the 2010 workshop was to present current research on the theory and applications of complex networks. The papers presented in this special issue should stimulate new and exciting directions in research on complex networks. We would like to thank the authors and reviewers for making the special issue a reality.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"8 1","pages":"1 - 1"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2012.635562","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59946542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Quick Detection of Nodes with Large Degrees 大度节点的快速检测

Internet Mathematics Pub Date : 2012-02-15 DOI: 10.1080/15427951.2013.798601

K. Avrachenkov, Nelly Litvak, Marina Sokol, Donald F. Towsley

引用次数: 26