Internet Mathematics最新文献_第2页

Approximating Betweenness Centrality in Fully Dynamic Networks 全动态网络的中间中心性逼近

Internet Mathematics Pub Date : 2015-10-27 DOI: 10.1080/15427951.2016.1177802

E. Bergamini, Henning Meyerhenke

{"title":"Approximating Betweenness Centrality in Fully Dynamic Networks","authors":"E. Bergamini, Henning Meyerhenke","doi":"10.1080/15427951.2016.1177802","DOIUrl":"https://doi.org/10.1080/15427951.2016.1177802","url":null,"abstract":"Abstract Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Because exact computations are prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in networks that change over time. In this article, we propose the first betweenness centrality approximation algorithms with a provable guarantee on the maximum approximation error for dynamic networks. Several new intermediate algorithmic results contribute to the respective approximation algorithms: (i) new upper bounds on the vertex diameter, (ii) the first fully dynamic algorithm for updating an approximation of the vertex diameter in undirected graphs, and (iii) an algorithm with lower time complexity for updating single-source shortest paths in unweighted graphs after a batch of edge actions. Using approximation, our algorithms are the first to make in-memory computation of betweenness in dynamic networks with millions of edges feasible. Our experiments show that our algorithms can achieve substantial speedups compared to recomputation, up to several orders of magnitude. Moreover, the approximation accuracy is usually significantly better than the theoretical guarantee in terms of absolute error. More importantly, for reasonably small approximation error thresholds, the rank of nodes is well preserved, in particular for nodes with high betweenness.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"12 1","pages":"281 - 314"},"PeriodicalIF":0.0,"publicationDate":"2015-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2016.1177802","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59948094","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}

引用次数: 35

Statement of Removal 搬迁声明书

Internet Mathematics Pub Date : 2015-09-03 DOI: 10.1080/15427951.2015.1046742

引用次数: 0

Special Issue on Algorithms and Models for the Web-graph 网络图的算法和模型特刊

Internet Mathematics Pub Date : 2015-09-03 DOI: 10.1080/15427951.2015.1069522

A. Bonato, P. Prałat

{"title":"Special Issue on Algorithms and Models for the Web-graph","authors":"A. Bonato, P. Prałat","doi":"10.1080/15427951.2015.1069522","DOIUrl":"https://doi.org/10.1080/15427951.2015.1069522","url":null,"abstract":"This issue of Internet Mathematics includes a selection of papers that were presented at the Eleventh Workshop on Algorithms and Models for the Web-Graph (WAW 2013) held at Harvard University in December 2013. The workshop was co-located with the 9th Conference on Web and Internet Economics (WINE 2013). All the articles have been thoroughly reviewed in accordance with the usual high standards of Internet Mathematics. The World Wide Web has become part of our everyday life, and information retrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph, induced in various ways by links among pages, hosts and users. The aim of WAW 2013 was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop included talks from researchers working on graph-theoretic and algorithmic aspects of complex networks such as on-line social networks. We would like to thank the authors and reviewers for making this special issue a reality.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"11 1","pages":"307 - 307"},"PeriodicalIF":0.0,"publicationDate":"2015-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2015.1069522","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59948242","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}

引用次数: 0

A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter 一种新的自优化节点随机图模型:连通性和直径

Internet Mathematics Pub Date : 2015-08-03 DOI: 10.1080/15427951.2015.1022626

R. La, Maya Kabkab

引用次数: 3

How to Burn a Graph 如何烧掉图形

Internet Mathematics Pub Date : 2015-07-23 DOI: 10.1080/15427951.2015.1103339

A. Bonato, J. Janssen, Elham Roshanbin

引用次数: 67

Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model 空间优先依恋模型中节点的非均匀分布

Internet Mathematics Pub Date : 2015-05-21 DOI: 10.1080/15427951.2015.1110543

J. Janssen, P. Prałat, Rory Wilson

引用次数: 11

Toward Optimal Community Detection: From Trees to General Weighted Networks 向最优社团检测:从树到一般加权网络

Internet Mathematics Pub Date : 2015-05-04 DOI: 10.1080/15427951.2014.950875

Thang N. Dinh, M. Thai

{"title":"Toward Optimal Community Detection: From Trees to General Weighted Networks","authors":"Thang N. Dinh, M. Thai","doi":"10.1080/15427951.2014.950875","DOIUrl":"https://doi.org/10.1080/15427951.2014.950875","url":null,"abstract":"Abstract Many networks, including the Internet, social networks, and biological relations, are found to be naturally divided into communities of densely connected nodes, known as community structure. Since Newman’s suggestion of using modularity as a measure to qualify the goodness of community structures, many efficient methods to maximize modularity have been proposed but without optimality guarantees. In this work we study exact and theoretically near-optimal algorithms for maximizing modularity. In the first part, we investigate the complexity and approximability of the problem on tree graphs. Somewhat surprisingly, the problem is still NP-complete on trees. We then provide a polynomial time algorithm for uniform-weighted trees and a pseudopolynomial time algorithm and a PTAS for trees with arbitrary weights. In the second part, we present a family of compact linear programming formulations for the problem in general graphs. These formulations exploit the graph connectivity structure and reduce substantially the number of constraints, thus, they vastly improve the running time for solving linear programming and integer programming. As a result, networks of thousands of vertices can be solved in minutes, whereas the current largest instance solved with mathematical programming has fewer than 250 vertices.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"11 1","pages":"181 - 200"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2014.950875","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59947756","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}

引用次数: 23

Weak Balance in Random Signed Graphs 随机符号图中的弱平衡

Internet Mathematics Pub Date : 2015-03-04 DOI: 10.1080/15427951.2014.912994

A. E. Maftouhi, Ararat Harutyunyan, Y. Manoussakis

引用次数: 1

Voter Model on Signed Social Networks 签名社交网络上的选民模型

Internet Mathematics Pub Date : 2015-03-04 DOI: 10.1080/15427951.2013.862884

Yanhua Li, Wei Chen, Yajun Wang, Zhi-Li Zhang

{"title":"Voter Model on Signed Social Networks","authors":"Yanhua Li, Wei Chen, Yajun Wang, Zhi-Li Zhang","doi":"10.1080/15427951.2013.862884","DOIUrl":"https://doi.org/10.1080/15427951.2013.862884","url":null,"abstract":"Online social networks (OSNs) are becoming increasingly popular and are generating great interest in the study of the influence diffusion and influence maximization with applications to online viral marketing. Existing studies focus on social networks with only friendship relations, whereas the foe or enemy relations that commonly exist in many OSNs, e.g., Epinions and Slashdot, are completely ignored. In this study, we make the first attempt to investigate the influence diffusion and influence maximization in OSNs with both friend and foe relations, which are modeled using positive and negative edges on signed networks. In particular, we extend the classic voter model to signed networks and analyze the dynamics of influence diffusion of two opposite opinions. We first provide systematic characterization of both short-term and long-term dynamics of influence diffusion in this model and illustrate that the steady state behaviors of the dynamics depend on three types of graph structures, which we refer to as balanced graphs, anti balanced graphs, and strictly unbalanced graphs. We then apply our results to solve the influence maximization problem and develop efficient algorithms to select initial seeds of one opinion that maximize either its short-term influence coverage or long-term steady state influence coverage. Extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on influence diffusion dynamics, and demonstrate the efficacy of our influence maximization algorithm over other heuristic algorithms.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"11 1","pages":"133 - 93"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2013.862884","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59947356","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}

引用次数: 33

Traffic Congestion in Expanders and (p,δ)–Hyperbolic Spaces 扩张空间与(p，δ) -双曲空间中的交通拥堵

Internet Mathematics Pub Date : 2015-03-04 DOI: 10.1080/15427951.2014.884513

Shi Li, G. Tucci

引用次数: 9