Share This Author
Maximizing the spread of influence through a social network
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.
The link-prediction problem for social networks
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.
The small-world phenomenon: an algorithmic perspective
- J. Kleinberg
- Materials ScienceSTOC '00
- 1 May 2000
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
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.
Graphs over time: densification laws, shrinking diameters and possible explanations
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.
Authoritative sources in a hyperlinked environment
- J. Kleinberg
- Computer ScienceJACM
- 1 September 1999
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.
Predicting positive and negative links in online social networks
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.
Bursty and Hierarchical Structure in Streams
- J. Kleinberg
- Computer ScienceData Mining and Knowledge Discovery
- 23 July 2002
The goal of the present work is to develop a formal approach for modeling such “bursts,” in such a way that they can be robustly and efficiently identified, and can provide an organizational framework for analyzing the underlying content.
Kronecker Graphs: An Approach to Modeling Networks
- J. Leskovec, Deepayan Chakrabarti, J. Kleinberg, C. Faloutsos, Zoubin Ghahramani
- Computer ScienceJ. Mach. Learn. Res.
- 29 December 2008
Kronecker graphs naturally obey common network properties and it is rigorously proved that they do so, and KRONFIT, a fast and scalable algorithm for fitting the Kronecker graph generation model to large real networks, is presented.
Meme-tracking and the dynamics of the news cycle
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.