Sciweavers

35 search results - page 2 / 7
» Ranking of Closeness Centrality for Large-Scale Social Netwo...
Sort
View
ASUNAM
2009
IEEE
13 years 11 months ago
Social Network Discovery Based on Sensitivity Analysis
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
Tarik Crnovrsanin, Carlos D. Correa, Kwan-Liu Ma
WINE
2010
Springer
201views Economy» more  WINE 2010»
13 years 2 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...
SIGMOD
2009
ACM
149views Database» more  SIGMOD 2009»
14 years 5 months ago
CourseRank: a social system for course planning
Special-purpose social sites can offer valuable services to well-defined, closed, communities, e.g., in a university or in a corporation. The purpose of this demo is to show the c...
Benjamin Bercovitz, Filip Kaliszan, Georgia Koutri...
ATAL
2007
Springer
13 years 11 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
WWW
2011
ACM
12 years 11 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi