Corpus ID: 2836094

# Convex relaxation for finding planted influential nodes in a social network

@article{Elkin2013ConvexRF,
title={Convex relaxation for finding planted influential nodes in a social network},
author={Lisa Elkin and Ting Kei Pong and Stephen A. Vavasis},
journal={ArXiv},
year={2013},
volume={abs/1307.4047}
}
• Published 2013
• Mathematics, Computer Science, Physics
• ArXiv
We consider the problem of maximizing influence in a social network. We focus on the case that the social network is a directed bipartite graph whose arcs join senders to receivers. We consider both the case of deterministic networks and probabilistic graphical models, that is, the so-called “cascade” model. The problem is to find the set of the k most influential senders for a given integer k. Although this problem is NP-hard, there is a polynomial-time approximation algorithm due to Kempe… Expand
Relax, No Need to Round: Integrality of Clustering Formulations
• Computer Science, Mathematics
• ITCS
• 2015
We study exact recovery conditions for convex relaxations of point cloud clustering problems, focusing on two of the most common optimization problems for unsupervised clustering: k-means andExpand
Optimizing the Administration of COVID-19 Vaccines
The COVID-19 pandemic has resulted in millions of deaths around the world and various effective vaccines are being developed and manufactured throughout the world. But given that the production ofExpand

#### References

SHOWING 1-10 OF 15 REFERENCES
Maximizing the Spread of Influence through a Social Network
• Mathematics, Computer Science
• Theory Comput.
• 2015
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
Convex optimization for the planted k-disjoint-clique problem
• Mathematics, Computer Science
• Math. Program.
• 2014
The $$k$$k-disjoint-clique problem is NP-hard, but it is shown that a convex relaxation can solve it in polynomial time for input instances constructed in a certain way. Expand
Guaranteed clustering and biclustering via semidefinite programming
It is shown that the correct partition of the objects and features can be recovered from the optimal solution of a semidefinite program in the case that the given data consists of several disjoint sets of objects exhibiting similar features. Expand
Graphs over time: densification laws, shrinking diameters and possible explanations
• Mathematics, Computer Science
• KDD '05
• 2005
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
Everyone's an influencer: quantifying influence on twitter
• Computer Science
• WSDM '11
• 2011
It is concluded that word-of-mouth diffusion can only be harnessed reliably by targeting large numbers of potential influencers, thereby capturing average effects and that predictions of which particular user or URL will generate large cascades are relatively unreliable. Expand
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
• Computer Science
• 2001
The results clearly indicate that information dissemination is dominated by both weak and strong w-o-m, rather than by advertising, which means that strong and weak ties become the main forces propelling growth. Expand
For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution
We consider linear equations y = Φx where y is a given vector in ℝn and Φ is a given n × m matrix with n 0 so that for large n and for all Φ's except a negligible fraction, the following propertyExpand
Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm
• Mathematics, Computer Science
• SIAM J. Optim.
• 2013
This work proposes a convex optimization formulation with the nuclear norm and $\ell_1$-norm to find a large approximately rank-one submatrix of a given nonnegative matrix and establishes conditions under which the optimal solution of the convex formulation has a specific sparse structure. Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
• Computer Science, Mathematics
• 1978
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
The spread of obesity in a large social network over 32 years.
• Medicine
• The New England journal of medicine
• 2007
Network phenomena appear to be relevant to the biologic and behavioral trait of obesity, and obesity appears to spread through social ties, which has implications for clinical and public health interventions. Expand