Fetching the paper…
Reading the bibliography…
Existing socio-psychological studies suggest that users of a social network form their opinions relying on the opinions of their neighbors.
F. Heider, “Attitudes and cognitive organization,” The Journal of Psychology
1946
Earlier work this paper cites.
L. Festinger, “A theory of social comparison processes,” Human Relations
1954
Earlier work this paper cites.
D. Cartwright and F. Harary, “Structural balance: A generalization of Heider’s theory,” Psychological Review
1956
Earlier work this paper cites.
Stanford University Press, 1962
L. Festinger, A Theory of Cognitive Dissonance · 1962
Earlier work this paper cites.
R. P. Abelson, “Mathematical models of the distribution of attitudes under controversy,” Contributions to Mathematical Psychology
1964
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations
1972
Earlier work this paper cites.
M. H. DeGroot, “Reaching a consensus,” Journal of the American Statistical Association
1974
Earlier work this paper cites.
Springer, 1976
J. G. Kemeny and J. L. Snell, Finite Markov Chains · 1976
Earlier work this paper cites.
C. A. Phillips, “The network inhibition problem,” in Proc. of Symposium on Theory of Computing
1993
Earlier work this paper cites.
R. Merris, “Laplacian matrices of graphs: A survey,” Linear Algebra and Its Applications
1994
Earlier work this paper cites.
N. E. Friedkin and E. C. Johnsen, “Social influence networks and opinion change,” Advances in Group Processes
1999
Earlier work this paper cites.
G. E. Cho and C. D. Meyer, “Markov chain sensitivity measured by mean first passage times,” Linear Algebra and its Applications
2000
Earlier work this paper cites.
P. Domingos and M. Richardson, “Mining the network value of customers,” in Proc. of International Conference on Knowledge Discovery and Data Mining (KDD)
2001
Earlier work this paper cites.
S. Chien, C. Dwork, R. Kumar, and D. Sivakumar, “Towards exploiting link evolution,” in Workshop on Algorithms and Models for the Web Graph
2001
Earlier work this paper cites.
E. Israeli and R. K. Wood, “Shortest-path network interdiction,” Networks
2002
Earlier work this paper cites.
G. Jeh and J. Widom, “Scaling personalized web search,” in Proc. of International Conference on World Wide Web (WWW)
2003
Earlier work this paper cites.
S. White and P. Smyth, “Algorithms for estimating relative importance in networks,” in Proc. of International Conference on Knowledge Discovery and Data Mining (KDD)
2003
Earlier work this paper cites.
J. J. Hunter, “Stationary distributions and mean first passage times of perturbed Markov chains,” Linear Algebra and its Applications
2005
Earlier work this paper cites.
A. Ghosh and S. Boyd, “Growing well-connected graphs,” in Proc. of Conf. on Decision and Control
2006
Earlier work this paper cites.
K. Avrachenkov and N. Litvak, “The effect of new links on Google PageRank,” Stochastic Models
2006
Cited alongside, same era.
A. N. Langville and C. D. Meyer, “Updating Markov chains with an eye on Google’s PageRank,” SIAM Journal on Matrix Analysis and Applications
2006
Cited alongside, same era.
K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, “Monte Carlo methods in PageRank computation: When one iteration is sufficient,” SIAM Journal on Numerical Analysis
2007
Cited alongside, same era.
A. Ghosh, S. Boyd, and A. Saberi, “Minimizing effective resistance of a graph,” SIAM Review
2008
Cited alongside, same era.
C. de Kerchove, L. Ninove, and P. Van Dooren, “Maximizing PageRank via outlinks,” Linear Algebra and its Applications
2008
Cited alongside, same era.
B. C. Csáji, R. M. Jungers, and V. D. Blondel, “PageRank optimization by edge selection,” Discrete Applied Mathematics
2014
Later among the works it cites.
Z. Yu, C. Wang, J. Bu, X. Wang, Y. Wu, and C. Chen, “Friend recommendation with content spread enhancement in social networks,” Information Sciences
2015
Later among the works it cites.
S. Saha, A. Adiga, B. A. Prakash, and A. K. S. Vullikanti, “Approximation algorithms for reducing the spectral radius to control epidemic spread,” in Proc. of International Conference on Data Mining (SDM)
2015
Later among the works it cites.
Y. Zhang, A. Adiga, A. Vullikanti, and B. A. Prakash, “Controlling propagation at group scale on networks,” in Proc. of International Conference on Data Mining (ICDM)
2015
Later among the works it cites.
L. T. Le, T. Eliassi-Rad, and H. Tong, “MET: A fast algorithm for minimizing propagation in large graphs with small eigen-gaps,” in Proc. of International Conference on Data Mining (SDM)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Ishii and R. Tempo, “Computing the PageRank variation for fragile web data,” SICE Journal of Control, Measurement, and System Integration
2009
Cited alongside, same era.
P. Van Mieghem, D. Stevanović, F. Kuipers, C. Li, R. Van De Bovenkamp, D. Liu, and H. Wang, “Decreasing the spectral radius of a graph by link removals,” Physical Review E
2011
Cited alongside, same era.
M. Papagelis, F. Bonchi, and A. Gionis, “Suggesting ghost edges for a smaller world,” in Proc. of International Conference on Information and Knowledge Management (CIKM)
2011
Cited alongside, same era.
H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos, “Gelling, and melting, large graphs by edge manipulation,” in Proc. of International Conference on Information and Knowledge Management (CIKM)
2012
Cited alongside, same era.
V. Chaoji, S. Ranu, R. Rastogi, and R. Bhatt, “Recommendations to boost content spread in social networks,” in Proc. of International Conference on World Wide Web (WWW)
2012
Cited alongside, same era.
V. Ishakian, D. Erdös, E. Terzi, and A. Bestavros, “A framework for the evaluation and management of network centrality,” in Proc. of International Conference on Data Mining (SDM)
2012
Cited alongside, same era.
B. Bahmani, R. Kumar, M. Mahdian, and E. Upfal, “PageRank on an evolving graph,” in Proc. of International Conference on Knowledge Discovery and Data Mining (KDD)
2012
Cited alongside, same era.
2015
Later among the works it cites.
P. Jia, A. MirTabatabaei, N. E. Friedkin, and F. Bullo, “Opinion dynamics and the evolution of social power in influence networks,” SIAM Review
2015
Later among the works it cites.
G. Como and F. Fagnani, “Robustness of large-scale stochastic matrices to localized perturbations,” IEEE Transactions on Network Science and Engineering
2015
Later among the works it cites.
L. Li, H. Tong, Y. Xiao, and W. Fan, “Cheetah: Fast graph kernel tracking on dynamic graphs,” in Proc. of International Conference on Data Mining (SDM)
2015
Later among the works it cites.
C. Chen, H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos, “Eigen-optimization on large graphs by edge manipulation,” ACM Transactions on Knowledge Discovery from Data (TKDD)
2016
Later among the works it cites.
F. Arrigo and M. Benzi, “Updating and downdating techniques for optimizing network communicability,” SIAM Journal on Scientific Computing
2016
Later among the works it cites.
N. Parotsidis, E. Pitoura, and P. Tsaparas, “Centrality-aware link recommendations,” in Proc. of International Conference on Web Search and Data Mining (WSDM)
2016
Later among the works it cites.
V. Amelkin, P. Bogdanov, and A. K. Singh, “A distance measure for the analysis of polar opinion dynamics in social networks,” in Proc. International Conference on Data Engineering (ICDE)
2017
Closest in time.
K. Garimella, G. De Francisci Morales, A. Gionis, and M. Mathioudakis, “Reducing controversy by connecting opposing views,” in Proc. of International Conference on Web Search and Data Mining (WSDM)
2017
Closest in time.
S. Medya, A. Silva, A. Singh, P. Basu, and A. Swami, “Maximizing coverage centrality via network design,” in Proc. of International Conference on Knowledge Discovery and Data Mining (KDD)
2017
Closest in time.
2017
Closest in time.
C. Chen and H. Tong, “On the eigen-functions of dynamic graphs: Fast tracking and attribution algorithms,” Statistical Analysis and Data Mining: The ASA Data Science Journal
2017
Closest in time.
2017
Closest in time.