Biased Assimilation, Homophily, and the Dynamics of Polarization
|
|
- Abraham McKenzie
- 6 years ago
- Views:
Transcription
1 Biased Assimilation, Homophily, and the Dynamics of Polarization Pranav Dandekar joint work with A. Goel D. Lee
2 Motivating Questions Are we as a society getting polarized? If so, why? Do recommender systems polarize?
3 Debate on Polarization!"#$%&'()&*+,#&-,./0)(%1&!"#$%&'()&*+,#&-,./0)(%!"#$%&#'()"*+%,-./%0)"12*"-3%4.5%64""#)%64"474'#-2 5#$6+#8,6#'.%6'%)',+%&'00-/9,-$1%&0#-.6$%'+%&,$6'2-+$%"-+-%'+%,$-%6"-%:;-(+#.6$:%6''0%6"/6%/((-/+$%.-<6%6'%/.) /+6#&0-3%=#$#6%>>>3.)6+-(+#.6$3&'2%*'+%$/2(0-$%/.5%/55#6#'./0%#.*'+2/6#'.3%?+5-+%/%+-(+#.6%'*%6"#$%/+6#&0-%.'>3!"#$%&'()&'**+,$-.&/$01%2&!.314)&5678-2&96#&:;;<2&=$44%3&/614 /01")"89!" #$%&%'()*++, -%.(/0%1*23(456'73$*5' C3'7)&3."D797%";$97$E!"#$%$&'"()*+,"-).."/)0&1"'23'"45"-$#%$&'")/"!6$#7%3&8"+$.7$9$"+)'2"'2$":$6)%#3'"3&1";$-0+.7%3&"-3#'7$8"82)0.1"+ Polarization? Yes
4 Homophily & Polarization Literature argues that Homophily (greater interaction with like-minded individuals) Social Corroboration Extreme Opinions Polarization
5 Debate on Polarization Polarization? No
6 Debate on Polarization Polarization? No
7 Our Contributions Define polarization. Show: DeGroot s opinion formation process is not polarizing, even in arbitrarily homophilous networks. Model biased assimilation in an opinion formation process. Show: Biased opinion formation results in polarization. Make connection between biased assimilation and the polarizing effects of recommender systems. Punchline: Homophily alone, without biased assimilation, is not sufficient to polarize society.
8 Polarization Definition Polarization = Increasing Divergence in Opinions
9 Polarization Definition Polarization = Increasing Divergence in Opinions
10 Model A connected, undirected, weighted graph G = (V, E, w). Node i has opinion x i (t) [0, 1] at time t = 0, 1, 2,.... Network Disagreement Index (NDI): η(g, x) := w ij (x i x j ) 2 (i,j) E An opinion formation process is polarizing if NDI increases.
11 DeGroot s Process Definition (DeGroot s Process) x i (t + 1) = w iix i (t) + s i (t) w ii + d i (1) where s i (t) := j N(i) w ijx j (t), and d i := j N(i) w ij. Variants used to explain lack of consensus (e.g., stubborn agents, intrinsic opinions).
12 DeGroot is not Polarizing Theorem At each timestep, DeGroot s process can only decrease NDI even if the network is arbitrarily homophilous.
13 Biased Assimilation aka confirmation bias (aka cherry-picking evidence) Lord et al. : People who hold strong opinions on complex social issues are likely to examine relevant empirical evidence in a biased manner. They are apt to accept confirming evidence at face value while subjecting disconfirming evidence to critical evaluation, and as a result to draw undue support for their initial positions from mixed or random empirical findings. A well-known phenomenon in social psychology.
14 Connection to Urn Models x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x j(t) 1 x j (t)
15 Connection to Urn Models DeGroot x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x j(t) 1 x j (t)
16 Connection to Urn Models DeGroot x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x j(t) 1 x j (t)
17 Connection to Urn Models DeGroot x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x j(t) 1 x j (t)
18 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
19 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
20 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
21 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
22 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
23 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
24 Connection to Urn Models Biased Assimilation x i (t): fraction of RED balls in i s urn. 1 x i (t): fraction of BLUE balls in i s urn. x i (t + 1) 1 x i (t + 1) x i (t)x j (t) (1 x i (t))(1 x j (t))
25 Biased Opinion Formation x i (t + 1) 1 x i (t + 1) (x i (t)) bi x j (t) (1 x i (t)) b i (1 xj (t))
26 Biased Opinion Formation x i (t + 1) 1 x i (t + 1) (x i (t)) bi x j (t) (1 x i (t)) b i (1 xj (t)) Definition (DeGroot s Process) x i (t + 1) = w iix i (t) + s i (t) w ii + d i where s i (t) := j N(i) w ijx j (t), and d i := j N(i) w ij.
27 Biased Opinion Formation x i (t + 1) 1 x i (t + 1) (x i (t)) bi x j (t) (1 x i (t)) b i (1 xj (t)) Definition (Biased Opinion Formation Process) x i (t + 1) = w ii x i (t) + (x i (t)) b i s i (t) w ii + (x i (t)) b i si (t) + (1 x i (t)) b i (di s i (t)) (2) where, s i (t) := j N(i) w ijx j (t), and d i := j N(i) w ij.
28 Two-island Network ps ps pd V1 h = ps/pd V2
29 Biased Assimilation and Polarization Theorem Assume for all i V 1, x i (0) = x 0 where 1 2 < x 0 < 1. Assume for all i V 2, x i (0) = 1 x 0. 1 (Polarization) If b 1, i V 1, lim t x i (t) = 1, and i V 2, lim t x i (t) = 0. 2 (Persistent Disagreement) if 1 > b 2 h+1, then there exists a unique ˆx ( 1 2, 1) such that i V 1, lim t x i (t) = ˆx, and i V 2, lim t x i (t) = 1 ˆx. 3 (Consensus) if b < 2 h+1, then for all i, lim t x i (t) = 1 2.
30 Recommender Systems and Polarization Do recommender systems polarize? Recommender systems Echo-chamber effect Extreme Opinions Polarization
31 Recommender Systems and Polarization n m... n
32 Recommender Systems and Polarization n m... n
33 Recommender Systems and Polarization n m... n
34 Recommender Systems and Polarization n m... n
35 Recommender Systems and Polarization n m... n
36 Recommender Systems and Polarization Definition Consider a book recommended to an individual i V 1. We say that i is unbiased if i accepts the recommendation with the same probability independent of whether the book is RED or BLUE. We say that i is biased if 1 i accepts the recommendation of a RED book with probability x i, and rejects it with probability 1 x i, and 2 i accepts the recommendation of a BLUE book with probability 1 x i, and rejects it with probability x i.
37 Recommender Systems and Polarization Definition Consider a recommender algorithm and an individual i V 1 that accepts the algorithm s recommendation. The algorithm is polarizing with respect to i if 1 when x i > 1 2, the probability that the recommended book was RED is greater than x i, and 2 when x i < 1 2, the probability that the recommended book was RED is less than x i. Recommender algorithms should be depolarizing at least when users are unbiased
38 Recommender Systems and Polarization Algorithm 1: Find the most relevant item R for a user, using a random walk based collaborative filtering algorithm.
39 Recommender Systems and Polarization Algorithm 2: Find a random item X that the user bought, and then use a random walk based collaborative filtering algorithm to find the most similar item R to X. Informally: The first algorithm causes polarization even with unbiased users, whereas the second causes depolarization.
40 Thank you Questions?
Opinion Dynamics over Signed Social Networks
Opinion Dynamics over Signed Social Networks Guodong Shi Research School of Engineering The Australian Na@onal University, Canberra, Australia Ins@tute for Systems Research The University of Maryland,
More informationOnline Social Networks and Media. Opinion formation on social networks
Online Social Networks and Media Opinion formation on social networks Diffusion of items So far we have assumed that what is being diffused in the network is some discrete item: E.g., a virus, a product,
More informationSocial network analysis: social learning
Social network analysis: social learning Donglei Du (ddu@unb.edu) Faculty of Business Administration, University of New Brunswick, NB Canada Fredericton E3B 9Y2 October 20, 2016 Donglei Du (UNB) AlgoTrading
More informationLearning distributions and hypothesis testing via social learning
UMich EECS 2015 1 / 48 Learning distributions and hypothesis testing via social learning Anand D. Department of Electrical and Computer Engineering, The State University of New Jersey September 29, 2015
More informationConsensus and Distributed Inference Rates Using Network Divergence
DIMACS August 2017 1 / 26 Consensus and Distributed Inference Rates Using Network Divergence Anand D. Department of Electrical and Computer Engineering, The State University of New Jersey August 23, 2017
More informationCS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions
CS 598RM: Algorithmic Game Theory, Spring 2017 1. Answer the following. Practice Exam Solutions Agents 1 and 2 are bargaining over how to split a dollar. Each agent simultaneously demands share he would
More informationUnderstanding and Solving Societal Problems with Modeling and Simulation Lecture 5: Opinion Polarization
Understanding and Solving Societal Problems with Modeling and Simulation Lecture 5: Opinion Polarization Dr. Michael Mäs Aims of this lecture Understand Abelson s puzzle of opinion polarization Understand
More informationEfficient learning by implicit exploration in bandit problems with side observations
Efficient learning by implicit exploration in bandit problems with side observations Tomáš Kocák, Gergely Neu, Michal Valko, Rémi Munos SequeL team, INRIA Lille - Nord Europe, France SequeL INRIA Lille
More informationGraphical Models for Collaborative Filtering
Graphical Models for Collaborative Filtering Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Sequence modeling HMM, Kalman Filter, etc.: Similarity: the same graphical model topology,
More informationORIE 4741: Learning with Big Messy Data. Spectral Graph Theory
ORIE 4741: Learning with Big Messy Data Spectral Graph Theory Mika Sumida Operations Research and Information Engineering Cornell September 15, 2017 1 / 32 Outline Graph Theory Spectral Graph Theory Laplacian
More informationOpinion Formation under Bounded Confidence via Gossip Algorithms and Applications
Opinion Formation under Bounded Confidence via Gossip Algorithms and Applications Nguyen Thi Hoai Linh 1, Takayuki Wada 1, Izumi Masubuchi 2, Toru Asai 3, Yasumasa Fujisaki 1 1 Osaka University, 2 Kobe
More informationRestricted Boltzmann Machines for Collaborative Filtering
Restricted Boltzmann Machines for Collaborative Filtering Authors: Ruslan Salakhutdinov Andriy Mnih Geoffrey Hinton Benjamin Schwehn Presentation by: Ioan Stanculescu 1 Overview The Netflix prize problem
More informationLink Prediction. Eman Badr Mohammed Saquib Akmal Khan
Link Prediction Eman Badr Mohammed Saquib Akmal Khan 11-06-2013 Link Prediction Which pair of nodes should be connected? Applications Facebook friend suggestion Recommendation systems Monitoring and controlling
More informationGraph Helmholtzian and Rank Learning
Graph Helmholtzian and Rank Learning Lek-Heng Lim NIPS Workshop on Algebraic Methods in Machine Learning December 2, 2008 (Joint work with Xiaoye Jiang, Yuan Yao, and Yinyu Ye) L.-H. Lim (NIPS 2008) Graph
More informationCollaborative topic models: motivations cont
Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: " boy Two articles: article A! girl article B Preferences: The boy likes A and B --- no problem.
More informationTell me something my friends do not know: Diversity maximization in social networks
Tell me something my friends do not know: Diversity maximization in social networks Antonis Matakos Department of Computer Science Aalto University Espoo, Finland firstname.lastname@aalto.fi Aristides
More informationCircle-based Recommendation in Online Social Networks
Circle-based Recommendation in Online Social Networks Xiwang Yang, Harald Steck*, and Yong Liu Polytechnic Institute of NYU * Bell Labs/Netflix 1 Outline q Background & Motivation q Circle-based RS Trust
More informationConvergence Rate of Markov Chains
Convergence Rate of Markov Chains Will Perkins April 16, 2013 Convergence Last class we saw that if X n is an irreducible, aperiodic, positive recurrent Markov chain, then there exists a stationary distribution
More informationConsensus Algorithms for Camera Sensor Networks. Roberto Tron Vision, Dynamics and Learning Lab Johns Hopkins University
Consensus Algorithms for Camera Sensor Networks Roberto Tron Vision, Dynamics and Learning Lab Johns Hopkins University Camera Sensor Networks Motes Small, battery powered Embedded camera Wireless interface
More informationRecommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 21, 2014 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 21, 2014 1 / 52 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
More informationSupplementary Information Activity driven modeling of time varying networks
Supplementary Information Activity driven modeling of time varying networks. Perra, B. Gonçalves, R. Pastor-Satorras, A. Vespignani May 11, 2012 Contents 1 The Model 1 1.1 Integrated network......................................
More informationData Mining Recitation Notes Week 3
Data Mining Recitation Notes Week 3 Jack Rae January 28, 2013 1 Information Retrieval Given a set of documents, pull the (k) most similar document(s) to a given query. 1.1 Setup Say we have D documents
More informationCS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling
CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling Professor Erik Sudderth Brown University Computer Science October 27, 2016 Some figures and materials courtesy
More informationActive Opinion-Formation in Online Social Networks
Active Opinion-Formation in Online Social Networks Wenjun Jiang and Jie Wu College of Computer Science and Electronic Engineering, Hunan University Department of Computer and Information Sciences, Temple
More informationLecture 3 Probability Basics
Lecture 3 Probability Basics Thais Paiva STA 111 - Summer 2013 Term II July 3, 2013 Lecture Plan 1 Definitions of probability 2 Rules of probability 3 Conditional probability What is Probability? Probability
More informationBiased Respondent Group Selection under Limited Budget for Minority Opinion Survey
Biased Respondent Group Selection under Limited Budget for Minority Opinion Survey Donghyun Kim 1, Wei Wang 2, Matthew Tetteh 1, Jun Liang 4, Soyoon Park 3, Wonjun Lee 3 1 Dept. of Math. and Physics, North
More informationA Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks
A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks Joydeep Chandra 1, Ingo Scholtes 2, Niloy Ganguly 1, Frank Schweitzer 2 1 - Dept. of Computer Science and Engineering,
More informationConsensus, Flocking and Opinion Dynamics
Consensus, Flocking and Opinion Dynamics Antoine Girard Laboratoire Jean Kuntzmann, Université de Grenoble antoine.girard@imag.fr International Summer School of Automatic Control GIPSA Lab, Grenoble, France,
More informationData Mining Techniques
Data Mining Techniques CS 622 - Section 2 - Spring 27 Pre-final Review Jan-Willem van de Meent Feedback Feedback https://goo.gl/er7eo8 (also posted on Piazza) Also, please fill out your TRACE evaluations!
More informationHierarchical Clustering and Consensus in Trust Networks
Hierarchical Clustering and Consensus in Trust etworks Santiago Segarra Alejandro Ribeiro Department of Electrical and Systems Engineering University of Pennsylvania Abstract We apply recent developments
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationCrowd-Learning: Improving the Quality of Crowdsourcing Using Sequential Learning
Crowd-Learning: Improving the Quality of Crowdsourcing Using Sequential Learning Mingyan Liu (Joint work with Yang Liu) Department of Electrical Engineering and Computer Science University of Michigan,
More informationMining Newsgroups Using Networks Arising From Social Behavior by Rakesh Agrawal et al. Presented by Will Lee
Mining Newsgroups Using Networks Arising From Social Behavior by Rakesh Agrawal et al. Presented by Will Lee wwlee1@uiuc.edu September 28, 2004 Motivation IR on newsgroups is challenging due to lack of
More informationAdv. App. Stat. Presentation On a paradoxical property of the Kolmogorov Smirnov two-sample test
Adv. App. Stat. Presentation On a paradoxical property of the Kolmogorov Smirnov two-sample test Stefan Hasselgren Niels Bohr Institute March 9, 2017 Slide 1/11 Bias of Kolmogorov g.o.f. test Draw a sample
More informationA Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology
A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology Amir Amini, Amir Asif, Arash Mohammadi Electrical and Computer Engineering,, Montreal, Canada.
More informationPrelim 1 (10 8)!8! = 10 9 = 45. (b) How many ways can it be done if the first three questions are required? 2 = 21
Math 1105 Fall 010 J.T. Gene Hwang, Instructor Robyn Miller, T.A. Prelim 1 Instructions This is a closed book exam. Graphing calculators are not permitted. Solutions should be written in your blue book
More informationECE534, Spring 2018: Solutions for Problem Set #3
ECE534, Spring 08: Solutions for Problem Set #3 Jointly Gaussian Random Variables and MMSE Estimation Suppose that X, Y are jointly Gaussian random variables with µ X = µ Y = 0 and σ X = σ Y = Let their
More informationLAPLACIAN MATRIX AND APPLICATIONS
LAPLACIAN MATRIX AND APPLICATIONS Alice Nanyanzi Supervisors: Dr. Franck Kalala Mutombo & Dr. Simukai Utete alicenanyanzi@aims.ac.za August 24, 2017 1 Complex systems & Complex Networks 2 Networks Overview
More informationA graph contains a set of nodes (vertices) connected by links (edges or arcs)
BOLTZMANN MACHINES Generative Models Graphical Models A graph contains a set of nodes (vertices) connected by links (edges or arcs) In a probabilistic graphical model, each node represents a random variable,
More informationEfficient Respondents Selection for Biased Survey using Online Social Networks
Efficient Respondents Selection for Biased Survey using Online Social Networks Donghyun Kim 1, Jiaofei Zhong 2, Minhyuk Lee 1, Deying Li 3, Alade O. Tokuta 1 1 North Carolina Central University, Durham,
More informationSocial Choice and Networks
Social Choice and Networks Elchanan Mossel UC Berkeley All rights reserved Logistics 1 Different numbers for the course: Compsci 294 Section 063 Econ 207A Math C223A Stat 206A Room: Cory 241 Time TuTh
More informationOn-Line Social Systems with Long-Range Goals
On-Line Social Systems with Long-Range Goals Jon Kleinberg Cornell University Including joint work with Ashton Anderson, Dan Huttenlocher, Jure Leskovec, and Sigal Oren. Long-Range Planning Growth in on-line
More informationTemporal patterns in information and social systems
Temporal patterns in information and social systems Matúš Medo University of Fribourg, Switzerland COST Workshop Quantifying scientific impact: networks, measures, insights? 12-13 February, 2015, Zurich
More informationRandom Sampling of Bandlimited Signals on Graphs
Random Sampling of Bandlimited Signals on Graphs Pierre Vandergheynst École Polytechnique Fédérale de Lausanne (EPFL) School of Engineering & School of Computer and Communication Sciences Joint work with
More informationV. Properties of estimators {Parts C, D & E in this file}
A. Definitions & Desiderata. model. estimator V. Properties of estimators {Parts C, D & E in this file}. sampling errors and sampling distribution 4. unbiasedness 5. low sampling variance 6. low mean squared
More informationSocial Choice and Social Networks. Some non martingale learning models. Draft All rights reserved
Social Choice and Social Networks Some non martingale learning models Draft All rights reserved Elchanan Mossel UC Berkeley The Gale Kariv Model Bayesian setup state of the word S = +/- with prob. ½. independent
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationCS246 Final Exam, Winter 2011
CS246 Final Exam, Winter 2011 1. Your name and student ID. Name:... Student ID:... 2. I agree to comply with Stanford Honor Code. Signature:... 3. There should be 17 numbered pages in this exam (including
More informationMeasuring Social Influence Without Bias
Measuring Social Influence Without Bias Annie Franco Bobbie NJ Macdonald December 9, 2015 The Problem CS224W: Final Paper How well can statistical models disentangle the effects of social influence from
More informationBlind Identification of Invertible Graph Filters with Multiple Sparse Inputs 1
Blind Identification of Invertible Graph Filters with Multiple Sparse Inputs Chang Ye Dept. of ECE and Goergen Institute for Data Science University of Rochester cye7@ur.rochester.edu http://www.ece.rochester.edu/~cye7/
More informationHow opinion dynamics generates group hierarchies
Author-produced version of the paper presented at ECCS'0 European Conference on Complex Systems, 3-7 septembre 200 - Lisbonne, Portugal How opinion dynamics generates group hierarchies F. Gargiulo, S.
More informationMonte Carlo Inference Methods
Monte Carlo Inference Methods Iain Murray University of Edinburgh http://iainmurray.net Monte Carlo and Insomnia Enrico Fermi (1901 1954) took great delight in astonishing his colleagues with his remarkably
More informationApril 20th, Advanced Topics in Machine Learning California Institute of Technology. Markov Chain Monte Carlo for Machine Learning
for for Advanced Topics in California Institute of Technology April 20th, 2017 1 / 50 Table of Contents for 1 2 3 4 2 / 50 History of methods for Enrico Fermi used to calculate incredibly accurate predictions
More informationIndirect Sampling in Case of Asymmetrical Link Structures
Indirect Sampling in Case of Asymmetrical Link Structures Torsten Harms Abstract Estimation in case of indirect sampling as introduced by Huang (1984) and Ernst (1989) and developed by Lavalle (1995) Deville
More informationBinary Principal Component Analysis in the Netflix Collaborative Filtering Task
Binary Principal Component Analysis in the Netflix Collaborative Filtering Task László Kozma, Alexander Ilin, Tapani Raiko first.last@tkk.fi Helsinki University of Technology Adaptive Informatics Research
More informationOn the Scalability in Cooperative Control. Zhongkui Li. Peking University
On the Scalability in Cooperative Control Zhongkui Li Email: zhongkli@pku.edu.cn Peking University June 25, 2016 Zhongkui Li (PKU) Scalability June 25, 2016 1 / 28 Background Cooperative control is to
More informationSampling. Jian Pei School of Computing Science Simon Fraser University
Sampling Jian Pei School of Computing Science Simon Fraser University jpei@cs.sfu.ca INTRODUCTION J. Pei: Sampling 2 What Is Sampling? Select some part of a population to observe estimate something about
More informationArea I: Contract Theory Question (Econ 206)
Theory Field Exam Summer 2011 Instructions You must complete two of the four areas (the areas being (I) contract theory, (II) game theory A, (III) game theory B, and (IV) psychology & economics). Be sure
More informationHow Homophily Affects Communication in Networks
How Homophily Affects Communication in Networks Benjamin Golub Matthew O. Jackson December 23, 2008 Abstract We examine how three different communication processes operating through social networks are
More informationWiki Definition. Reputation Systems I. Outline. Introduction to Reputations. Yury Lifshits. HITS, PageRank, SALSA, ebay, EigenTrust, VKontakte
Reputation Systems I HITS, PageRank, SALSA, ebay, EigenTrust, VKontakte Yury Lifshits Wiki Definition Reputation is the opinion (more technically, a social evaluation) of the public toward a person, a
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More informationLink Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
More informationRanking from Pairwise Comparisons
Ranking from Pairwise Comparisons Sewoong Oh Department of ISE University of Illinois at Urbana-Champaign Joint work with Sahand Negahban(MIT) and Devavrat Shah(MIT) / 9 Rank Aggregation Data Algorithm
More informationMarkov chain Monte Carlo
Markov chain Monte Carlo Markov chain Monte Carlo (MCMC) Gibbs and Metropolis Hastings Slice sampling Practical details Iain Murray http://iainmurray.net/ Reminder Need to sample large, non-standard distributions:
More informationInformation Cascades in Social Networks via Dynamic System Analyses
Information Cascades in Social Networks via Dynamic System Analyses Shao-Lun Huang and Kwang-Cheng Chen Graduate Institute of Communication Engineering, National Taiwan University, Taipei, Taiwan Email:{huangntu,
More information6.207/14.15: Networks Lecture 12: Generalized Random Graphs
6.207/14.15: Networks Lecture 12: Generalized Random Graphs 1 Outline Small-world model Growing random networks Power-law degree distributions: Rich-Get-Richer effects Models: Uniform attachment model
More informationMetrics: Growth, dimension, expansion
Metrics: Growth, dimension, expansion Social and Technological Networks Rik Sarkar University of Edinburgh, 2017. Metric A distance measure d is a metric if: d(u,v) 0 d(u,v) = 0 iff u=v d(u,v) = d(u,v)
More informationAnswers and expectations
Answers and expectations For a function f(x) and distribution P(x), the expectation of f with respect to P is The expectation is the average of f, when x is drawn from the probability distribution P E
More informationSocial Media Networks, Fake News, and Polarization
Social Media Networks, Fake News, and Polarization Marina Azzimonti Department of Economics Stony Brook University marina.azzimonti@gmail.com Marcos Fernandes Department of Economics Stony Brook University
More informationRecommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 29-30, 2015 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 29-30, 2015 1 / 61 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
More informationCS 1200 Exam 3 July 25, 2017
This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and clearly indicate the problem number. The max
More informationOptimal stopping, satisficing and scarce. attention. Pantelis Pipergias Analytis. attention. 1 Cornell University.
1 Cornell University January 29, 2018 The secretary problem Assumptions Single position to fill. There are n applicants for the position, and the value of n is known. The applicants, if seen altogether,
More informationSF2972 Game Theory Exam with Solutions March 15, 2013
SF2972 Game Theory Exam with s March 5, 203 Part A Classical Game Theory Jörgen Weibull and Mark Voorneveld. (a) What are N, S and u in the definition of a finite normal-form (or, equivalently, strategic-form)
More informationOutline. Offline Evaluation of Online Metrics Counterfactual Estimation Advanced Estimators. Case Studies & Demo Summary
Outline Offline Evaluation of Online Metrics Counterfactual Estimation Advanced Estimators 1. Self-Normalized Estimator 2. Doubly Robust Estimator 3. Slates Estimator Case Studies & Demo Summary IPS: Issues
More informationCollaborative Filtering
Collaborative Filtering Nicholas Ruozzi University of Texas at Dallas based on the slides of Alex Smola & Narges Razavian Collaborative Filtering Combining information among collaborating entities to make
More informationIdeological Bias and Trust in Information Sources
Ideological Bias and Trust in Information Sources Matthew Gentzkow Stanford and NBER Michael B. Wong MIT October 2018 Allen T. Zhang Harvard Abstract Two key features describe ideological differences in
More informationTest Code: STA/STB (Short Answer Type) 2013 Junior Research Fellowship for Research Course in Statistics
Test Code: STA/STB (Short Answer Type) 2013 Junior Research Fellowship for Research Course in Statistics The candidates for the research course in Statistics will have to take two shortanswer type tests
More informationSampling Algorithms for Probabilistic Graphical models
Sampling Algorithms for Probabilistic Graphical models Vibhav Gogate University of Washington References: Chapter 12 of Probabilistic Graphical models: Principles and Techniques by Daphne Koller and Nir
More informationSMALL-WORLD NAVIGABILITY. Alexandru Seminar in Distributed Computing
SMALL-WORLD NAVIGABILITY Talk about a small world 2 Zurich, CH Hunedoara, RO From cliché to social networks 3 Milgram s Experiment and The Small World Hypothesis Omaha, NE Boston, MA Wichita, KS Human
More informationAgreement algorithms for synchronization of clocks in nodes of stochastic networks
UDC 519.248: 62 192 Agreement algorithms for synchronization of clocks in nodes of stochastic networks L. Manita, A. Manita National Research University Higher School of Economics, Moscow Institute of
More informationMulti-Way Analysis of Variance (ANOVA)
Multi-Way Analysis of Variance (ANOVA) An approximate answer to the right problem is worth a good deal more than an exact answer to an approximate problem John Tukey (American Mathmetician) Multi-way ANOVA
More informationEstimation of a Local-Aggregate Network Model with. Sampled Networks
Estimation of a Local-Aggregate Network Model with Sampled Networks Xiaodong Liu y Department of Economics, University of Colorado, Boulder, CO 80309, USA August, 2012 Abstract This paper considers the
More informationECS 289 / MAE 298, Network Theory Spring 2014 Problem Set # 1, Solutions. Problem 1: Power Law Degree Distributions (Continuum approach)
ECS 289 / MAE 298, Network Theory Spring 204 Problem Set #, Solutions Problem : Power Law Degree Distributions (Continuum approach) Consider the power law distribution p(k) = Ak γ, with support (i.e.,
More informationControl of Manufacturing Processes
Control of Manufacturing Processes Subject 2.830 Spring 2004 Lecture #8 Hypothesis Testing and Shewhart Charts March 2, 2004 3/2/04 Lecture 8 D.E. Hardt, all rights reserved 1 Applying Statistics to Manufacturing:
More informationA noninformative Bayesian approach to domain estimation
A noninformative Bayesian approach to domain estimation Glen Meeden School of Statistics University of Minnesota Minneapolis, MN 55455 glen@stat.umn.edu August 2002 Revised July 2003 To appear in Journal
More informationIntroduction to Restricted Boltzmann Machines
Introduction to Restricted Boltzmann Machines Ilija Bogunovic and Edo Collins EPFL {ilija.bogunovic,edo.collins}@epfl.ch October 13, 2014 Introduction Ingredients: 1. Probabilistic graphical models (undirected,
More information1 T 1 = where 1 is the all-ones vector. For the upper bound, let v 1 be the eigenvector corresponding. u:(u,v) E v 1(u)
CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh (rezab@stanford.edu) Final Review Session 03/20/17 1. Let G = (V, E) be an unweighted, undirected graph. Let λ 1 be the maximum eigenvalue
More informationSampling, Inference and Clustering for Data on Graphs
Sampling, Inference and Clustering for Data on Graphs Pierre Vandergheynst École Polytechnique Fédérale de Lausanne (EPFL) School of Engineering & School of Computer and Communication Sciences Joint work
More informationWhy duplicate detection?
Near-Duplicates Detection Naama Kraus Slides are based on Introduction to Information Retrieval Book by Manning, Raghavan and Schütze Some slides are courtesy of Kira Radinsky Why duplicate detection?
More informationThree Interpretations of the Fourier Trasform The Fourier transform plays an important role in engineering and science. At one time or another,
hree Interpretations of the Fourier rasform he Fourier transform plays an important role in engineering and science. At one time or another, all electrical engineering students use the transform. However,
More informationarxiv: v1 [math.oc] 24 Dec 2018
On Increasing Self-Confidence in Non-Bayesian Social Learning over Time-Varying Directed Graphs César A. Uribe and Ali Jadbabaie arxiv:82.989v [math.oc] 24 Dec 28 Abstract We study the convergence of the
More informationStatistical Analysis of the Item Count Technique
Statistical Analysis of the Item Count Technique Kosuke Imai Department of Politics Princeton University Joint work with Graeme Blair May 4, 2011 Kosuke Imai (Princeton) Item Count Technique UCI (Statistics)
More informationPower Laws & Rich Get Richer
Power Laws & Rich Get Richer CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2015 Hadi Amiri hadi@umd.edu Lecture Topics Popularity as a Network Phenomenon
More informationConvergence speed in distributed consensus and averaging
Convergence speed in distributed consensus and averaging The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationGov 2002: 4. Observational Studies and Confounding
Gov 2002: 4. Observational Studies and Confounding Matthew Blackwell September 10, 2015 Where are we? Where are we going? Last two weeks: randomized experiments. From here on: observational studies. What
More informationNovel Multidimensional Models of Opinion Dynamics in Social Networks
1 Novel Multidimensional Models of Opinion Dynamics in Social Networks Sergey E. Parsegov, Anton V. Proskurnikov, Member, IEEE, Roberto Tempo, Fellow, IEEE and Noah E. Friedkin arxiv:155.492v5 [cs.sy]
More informationContents. Decision Making under Uncertainty 1. Meanings of uncertainty. Classical interpretation
Contents Decision Making under Uncertainty 1 elearning resources Prof. Ahti Salo Helsinki University of Technology http://www.dm.hut.fi Meanings of uncertainty Interpretations of probability Biases in
More informationCommunities Via Laplacian Matrices. Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices
Communities Via Laplacian Matrices Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices The Laplacian Approach As with betweenness approach, we want to divide a social graph into
More informationA Guaranteed Cost LMI-Based Approach for Event-Triggered Average Consensus in Multi-Agent Networks
A Guaranteed Cost LMI-Based Approach for Event-Triggered Average Consensus in Multi-Agent Networks Amir Amini, Arash Mohammadi, Amir Asif Electrical and Computer Engineering,, Montreal, Canada. Concordia
More informationSTATS 200: Introduction to Statistical Inference. Lecture 29: Course review
STATS 200: Introduction to Statistical Inference Lecture 29: Course review Course review We started in Lecture 1 with a fundamental assumption: Data is a realization of a random process. The goal throughout
More information