{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:46:55Z","timestamp":1780634815045,"version":"3.54.1"},"publisher-location":"New York, New York, USA","reference-count":49,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186103","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"369-378","source":"Crossref","is-referenced-by-count":101,"title":["Minimizing Polarization and Disagreement in Social Networks"],"prefix":"10.1145","author":[{"given":"Cameron","family":"Musco","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Musco","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos E.","family":"Tsourakakis","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186103-1","doi-asserted-by":"crossref","unstructured":"D. Acemoglu and A. Ozdaglar. Opinion dynamics and learning in social networks. Dynamic Games and Applications, 1(1):3--49, 2011.","DOI":"10.1007\/s13235-010-0004-1"},{"key":"key-10.1145\/3178876.3186103-2","doi-asserted-by":"crossref","unstructured":"W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, pages 171--180. Acm, 2000.","DOI":"10.1145\/335305.335326"},{"key":"key-10.1145\/3178876.3186103-3","doi-asserted-by":"crossref","unstructured":"J. Batson, D. A. Spielman, and N. Srivastava. Twice-Ramanujan sparsifiers. SIAM Journal on Computing, 41(6):1704--1721, 2012.","DOI":"10.1137\/090772873"},{"key":"key-10.1145\/3178876.3186103-4","doi-asserted-by":"crossref","unstructured":"D. Bindel, J. Kleinberg, and S. Oren. How bad is forming your own opinion? Games and Economic Behavior, 92:248--265, 2015.","DOI":"10.1016\/j.geb.2014.06.004"},{"key":"key-10.1145\/3178876.3186103-5","doi-asserted-by":"crossref","unstructured":"L. Boxell, M. Gentzkow, and J. M. Shapiro. Is the internet causing political polarization? Evidence from demographics. Technical report, National Bureau of Economic Research, 2017.","DOI":"10.3386\/w23258"},{"key":"key-10.1145\/3178876.3186103-6","doi-asserted-by":"crossref","unstructured":"S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. SIAM review, 46(4):667--689, 2004.","DOI":"10.1137\/S0036144503423264"},{"key":"key-10.1145\/3178876.3186103-7","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe. Convex optimization. Cambridge university press, 2004.","DOI":"10.1017\/CBO9780511804441"},{"key":"key-10.1145\/3178876.3186103-8","doi-asserted-by":"crossref","unstructured":"D. Braha and M. A. de Aguiar. Voting contagion: Modeling and analysis of a century of US presidential elections. PloS One, 12(5):e0177970, 2017.","DOI":"10.1371\/journal.pone.0177970"},{"key":"key-10.1145\/3178876.3186103-9","doi-asserted-by":"crossref","unstructured":"A. Clauset, C. R. Shalizi, and M. E. Newman. Power-law distributions in empirical data. SIAM Review, 51(4):661--703, 2009.","DOI":"10.1137\/070710111"},{"key":"key-10.1145\/3178876.3186103-10","doi-asserted-by":"crossref","unstructured":"P. Clifford and A. Sudbury. A model for spatial conflict. Biometrika, 60(3):581--588, 1973.","DOI":"10.1093\/biomet\/60.3.581"},{"key":"key-10.1145\/3178876.3186103-11","doi-asserted-by":"crossref","unstructured":"S. I. Daitch, J. A. Kelner, and D. A. Spielman. Fitting a graph to vector data. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 201--208. ACM, 2009.","DOI":"10.1145\/1553374.1553400"},{"key":"key-10.1145\/3178876.3186103-12","unstructured":"J. Damore. Google's ideological echo chamber, July 2017. https:\/\/tinyurl.com\/yde86v9e."},{"key":"key-10.1145\/3178876.3186103-13","doi-asserted-by":"crossref","unstructured":"P. Dandekar, A. Goel, and D. T. Lee. Biased assimilation, homophily, and the dynamics of polarization. Proceedings of the National Academy of Sciences, 110(15):5791--5796, 2013.","DOI":"10.1073\/pnas.1217220110"},{"key":"key-10.1145\/3178876.3186103-14","doi-asserted-by":"crossref","unstructured":"A. Das, S. Gollapudi, and K. Munagala. Modeling opinion dynamics in social networks. In Proceedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM '14, pages 403--412, 2014.","DOI":"10.1145\/2556195.2559896"},{"key":"key-10.1145\/3178876.3186103-15","doi-asserted-by":"crossref","unstructured":"A. De, S. Bhattacharya, P. Bhattacharya, N. Ganguly, and S. Chakrabarti. Learning a linear influence model from transient opinion dynamics. In Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pages 401--410. ACM, 2014.","DOI":"10.1145\/2661829.2662064"},{"key":"key-10.1145\/3178876.3186103-16","doi-asserted-by":"crossref","unstructured":"M. H. DeGroot. Reaching a consensus. Journal of the American Statistical Association, 69(345):118--121, 1974.","DOI":"10.1080\/01621459.1974.10480137"},{"key":"key-10.1145\/3178876.3186103-17","doi-asserted-by":"crossref","unstructured":"X. Dong, D. Thanou, P. Frossard, and P. Vandergheynst. Learning Laplacian matrix in smooth graph signal representations. IEEE Transactions on Signal Processing, 64(23):6160--6173, 2016.","DOI":"10.1109\/TSP.2016.2602809"},{"key":"key-10.1145\/3178876.3186103-18","unstructured":"R. Durrett. Lecture notes on particle systems and percolation. Brooks\/Cole Pub Co, 1988."},{"key":"key-10.1145\/3178876.3186103-19","doi-asserted-by":"crossref","unstructured":"J. Felsenstein. Confidence limits on phylogenies: an approach using the bootstrap. Evolution, 39(4):783--791, 1985.","DOI":"10.1111\/j.1558-5646.1985.tb00420.x"},{"key":"key-10.1145\/3178876.3186103-20","doi-asserted-by":"crossref","unstructured":"S. Flaxman, S. Goel, and J. M. Rao. Filter bubbles, echo chambers, and online news consumption. Public Opinion Quarterly, 80(S1):298--320, 2016.","DOI":"10.1093\/poq\/nfw006"},{"key":"key-10.1145\/3178876.3186103-21","doi-asserted-by":"crossref","unstructured":"N. E. Friedkin and E. C. Johnsen. Social influence and opinions. Journal of Mathematical Sociology, 15(3--4):193--206, 1990.","DOI":"10.1080\/0022250X.1990.9990069"},{"key":"key-10.1145\/3178876.3186103-22","doi-asserted-by":"crossref","unstructured":"N. E. Friedkin and E. C. Johnsen. Social positions in influence networks. Social Networks, 19(3):209--222, 1997.","DOI":"10.1016\/S0378-8733(96)00298-5"},{"key":"key-10.1145\/3178876.3186103-23","doi-asserted-by":"crossref","unstructured":"A. Frieze and M. Karo'nski. Introduction to random graphs. Cambridge University Press, 2015.","DOI":"10.1017\/CBO9781316339831"},{"key":"key-10.1145\/3178876.3186103-24","doi-asserted-by":"crossref","unstructured":"K. Garimella, G. De Francisci Morales, A. Gionis, and M. Mathioudakis. Quantifying controversy in social media. In Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, pages 33--42. ACM, 2016.","DOI":"10.1145\/2835776.2835792"},{"key":"key-10.1145\/3178876.3186103-25","doi-asserted-by":"crossref","unstructured":"K. Garimella, G. De Francisci Morales, A. Gionis, and M. Mathioudakis. Reducing controversy by connecting opposing views. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pages 81--90. ACM, 2017.","DOI":"10.1145\/3018661.3018703"},{"key":"key-10.1145\/3178876.3186103-26","unstructured":"K. Garimella, G. D. F. Morales, A. Gionis, and M. Mathioudakis. Exposing Twitter users to contrarian news. arXiv preprint arXiv:1703.10934, 2017."},{"key":"key-10.1145\/3178876.3186103-27","doi-asserted-by":"crossref","unstructured":"A. Gionis, E. Terzi, and P. Tsaparas. Opinion maximization in social networks. In Proceedings of the 2013 SIAM International Conference on Data Mining, pages 387--395. SIAM, 2013.","DOI":"10.1137\/1.9781611972832.43"},{"key":"key-10.1145\/3178876.3186103-28","unstructured":"R. Hegselmann, U. Krause, et al. Opinion dynamics and bounded confidence models, analysis, and simulation. Journal of Artificial Societies and Social Simulation, 5(3), 2002."},{"key":"key-10.1145\/3178876.3186103-29","unstructured":"C. Kadushin. Understanding social networks: Theories, concepts, and findings. OUP USA, 2012."},{"key":"key-10.1145\/3178876.3186103-30","unstructured":"D. Kahneman. Thinking, fast and slow. Macmillan, 2011."},{"key":"key-10.1145\/3178876.3186103-31","unstructured":"V. Kalofolias. How to learn a graph from smooth signals. In The 19th International Conference on Artificial Intelligence and Statistics (AISTATS 2016). Journal of Machine Learning Research (JMLR), 2016."},{"key":"key-10.1145\/3178876.3186103-32","unstructured":"D. Koller and N. Friedman. Probabilistic graphical models: principles and techniques. MIT press, 2009."},{"key":"key-10.1145\/3178876.3186103-33","doi-asserted-by":"crossref","unstructured":"Q. V. Liao and W.-T. Fu. Can you hear me now?: Mitigating the echo chamber effect by source position indicators. In Proceedings of the 17th ACM Conference on Computer Supported Cooperative Work & Social Computing, pages 184--196. ACM, 2014.","DOI":"10.1145\/2531602.2531711"},{"key":"key-10.1145\/3178876.3186103-34","doi-asserted-by":"crossref","unstructured":"E. Mossel, O. Tamuz, et al. Opinion exchange dynamics. Probability Surveys, 14:155--204, 2017.","DOI":"10.1214\/14-PS230"},{"key":"key-10.1145\/3178876.3186103-35","unstructured":"S. A. Munson, S. Y. Lee, and P. Resnick. Encouraging reading of diverse political viewpoints with a browser widget. In ICWSM, 2013."},{"key":"key-10.1145\/3178876.3186103-36","doi-asserted-by":"crossref","unstructured":"P. Nakov. Semantic sentiment analysis of Twitter data. arXiv preprint arXiv:1710.01492, 2017.","DOI":"10.1007\/978-1-4614-7163-9_110167-1"},{"key":"key-10.1145\/3178876.3186103-37","doi-asserted-by":"crossref","unstructured":"M. E. Newman. Power laws, Pareto distributions and Zipf's law. Contemporary Physics, 46(5):323--351, 2005.","DOI":"10.1080\/00107510500052444"},{"key":"key-10.1145\/3178876.3186103-38","doi-asserted-by":"crossref","unstructured":"I. Norros and H. Reittu. On a conditionally Poissonian graph process. Advances in Applied Probability, 38(1):59--75, 2006.","DOI":"10.1017\/S000186780000080X"},{"key":"key-10.1145\/3178876.3186103-39","unstructured":"J. W. Pennebaker, M. E. Francis, and R. J. Booth. Linguistic inquiry and word count: LIWC 2001. Mahway: Lawrence Erlbaum Associates, 71(2001):2001, 2001."},{"key":"key-10.1145\/3178876.3186103-40","doi-asserted-by":"crossref","unstructured":"W. Quattrociocchi, G. Caldarelli, and A. Scala. Opinion dynamics on interacting networks: media competition and social influence. Scientific Reports, 4:4938, 2014.","DOI":"10.1038\/srep04938"},{"key":"key-10.1145\/3178876.3186103-41","doi-asserted-by":"crossref","unstructured":"D. Shultz. Could Google influence the presidential election?, October 2016.","DOI":"10.1126\/science.aal0299"},{"key":"key-10.1145\/3178876.3186103-42","doi-asserted-by":"crossref","unstructured":"D. A. Spielman and N. Srivastava. Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6):1913--1926, 2011.","DOI":"10.1137\/080734029"},{"key":"key-10.1145\/3178876.3186103-43","doi-asserted-by":"crossref","unstructured":"D. A. Spielman and S.-H. Teng. Spectral sparsification of graphs. SIAM Journal on Computing, 40(4):981--1025, 2011.","DOI":"10.1137\/08074489X"},{"key":"key-10.1145\/3178876.3186103-44","doi-asserted-by":"crossref","unstructured":"D. A. Spielman and S.-H. Teng. Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. SIAM Journal on Matrix Analysis and Applications, 35(3):835--885, 2014.","DOI":"10.1137\/090771430"},{"key":"key-10.1145\/3178876.3186103-45","doi-asserted-by":"crossref","unstructured":"J. Sun, S. Boyd, L. Xiao, and P. Diaconis. The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM review, 48(4):681--699, 2006.","DOI":"10.1137\/S0036144504443821"},{"key":"key-10.1145\/3178876.3186103-46","unstructured":"N. Times. Facebook's Russia-linked ads came in many disguises, Oct. 2017. https:\/\/www.nytimes.com\/2017\/10\/02\/technology\/facebook-russia-ads-.html."},{"key":"key-10.1145\/3178876.3186103-47","unstructured":"N. Times. Tech giants, once seen as saviors, are now viewed as threats, October 2017."},{"key":"key-10.1145\/3178876.3186103-48","unstructured":"C. B. Williams, G. J. Gulati, et al. Social networks in political campaigns: Facebook and the 2006 midterm elections. In annual meeting of the American Political Science Association, volume 1, pages 49--62, 2007."},{"key":"key-10.1145\/3178876.3186103-49","doi-asserted-by":"crossref","unstructured":"J. Zhang and Y. Hong. Opinion evolution analysis for short-range and long-range Deffuant--Weisbuch models. Physica A: Statistical Mechanics and its Applications, 392(21):5289--5297, 2013.","DOI":"10.1016\/j.physa.2013.07.014"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186103&ftid=1957504&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186103"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186103","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}