Open AccessProceedings Article
Influence Study on Hyper-graphs
Reads0
Chats0
TLDR
An empirical study is undertaken to compare the effect of degree, k- shell and eigenvector centrality under the SIS, and SIR models of infection, and indicates that k-shell centrality is a more accurate predictor of the influence of a node than degree centrality.Abstract:
Multilateral relations between entities lose their semantics when represented as simple graphs. Instead hypergraphs can naturally represent the said relations, which are common in social tagging systems. An important issue is the effect of the structural properties of a hypergraph on influence propagation. In the current work, an empirical study is undertaken to compare the effect of degree, k-shell and eigenvector centrality under the SIS, and SIR models of infection. The results on the MovieLens, Delicious and LastFM social networks indicate that k-shell centrality is a more accurate predictor of the influence of a node than degree centrality, and that eigenvector centrality is closely correlated with k-shell centrality.read more
Citations
More filters
Proceedings Article
Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.
TL;DR: The collapsed kcore problem is proposed, given a graph G, a positive integer k and a budget b, and it is proved the problem is NP-hard, which significantly reduces the number of candidate vertices to speed up the computation.
Journal ArticleDOI
OLAK: an efficient algorithm to prevent unraveling in social networks
TL;DR: An onion layer structure is designed, which is generated by a simple onion-peeling-like algorithm against a small set of vertices in the graph, and it is shown that computation of the best anchor can be conducted upon the vertices on the onion layers, which significantly reduces the search space.
Journal ArticleDOI
Efficient progressive minimum k-core search
TL;DR: An effective and efficient progressive algorithm, namely PSA, is developed to provide a good trade-off between the quality of the result and the search time and to find the smallest k-core subgraph containing every query vertex q ∈ Q.
Journal ArticleDOI
Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications
Fanchen Bu,Geon Lee,Kijung Shin +2 more
TL;DR: In this paper , the authors propose a new substructure model, called ($k, $t$)-hypercore, based on the assumption that high-order relations remain as long as at least a fraction of the members remain.
References
More filters
Journal ArticleDOI
The anatomy of a large-scale hypertextual Web search engine
Sergey Brin,Lawrence Page +1 more
TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal Article
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Sergey Brin,Lawrence Page +1 more
TL;DR: Google as discussed by the authors is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.
Book
Networks: An Introduction
TL;DR: This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.
Journal ArticleDOI
A Set of Measures of Centrality Based on Betweenness
TL;DR: A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced in this paper, which define centrality in terms of the degree to which a point falls on the shortest path between others and there fore has a potential for control of communication.
Journal ArticleDOI
The Mathematics of Infectious Diseases
TL;DR: Threshold theorems involving the basic reproduction number, the contact number, and the replacement number $R$ are reviewed for classic SIR epidemic and endemic models and results with new expressions for $R_{0}$ are obtained for MSEIR and SEIR endemic models with either continuous age or age groups.