• Publications
  • Influence
Maximizing the Spread of Influence through a Social Network
TLDR
The present article is an expanded version of two conference papers, which appeared in KDD 2003 and ICALP 2005, which provide the first provable approximation guarantees for efficient algorithms. Expand
The link-prediction problem for social networks
TLDR
Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures. Expand
The small-world phenomenon: an algorithmic perspective
A method of improving certain characteristics of cadmium mercury telluride single crystal material by heat treating the single crystal material in the presence of both tellurium and mercury.
Graph evolution: Densification and shrinking diameters
TLDR
A new graph generator is provided, based on a forest fire spreading process that has a simple, intuitive justification, requires very few parameters, and produces graphs exhibiting the full range of properties observed both in prior work and in the present study. Expand
Graphs over time: densification laws, shrinking diameters and possible explanations
TLDR
A new graph generator is provided, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study. Expand
Maximizing the spread of influence through a social network
TLDR
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks. Expand
Predicting positive and negative links in online social networks
TLDR
These models provide insight into some of the fundamental principles that drive the formation of signed links in networks, shedding light on theories of balance and status from social psychology and suggest social computing applications by which the attitude of one user toward another can be estimated from evidence provided by their relationships with other members of the surrounding social network. Expand
Authoritative sources in a hyperlinked environment
TLDR
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph. Expand
Meme-tracking and the dynamics of the news cycle
TLDR
This work develops a framework for tracking short, distinctive phrases that travel relatively intact through on-line text; developing scalable algorithms for clustering textual variants of such phrases, and identifies a broad class of memes that exhibit wide spread and rich variation on a daily basis. Expand
...
1
2
3
4
5
...