Malik Magdon-Ismail, Konstantin Mertsalov, Mark Goldberg

Slides:



Advertisements
Similar presentations
Probability in Propagation
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
BiG-Align: Fast Bipartite Graph Alignment
Modeling Blog Dynamics Speaker: Michaela Götz Joint work with: Jure Leskovec, Mary McGlohon, Christos Faloutsos Cornell University Carnegie Mellon University.
Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.
Spread of Influence through a Social Network Adapted from :
Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) WIDS MIT, May 31, 2011.
Clustering Social Networks Isabelle Stanton, University of Virginia Joint work with Nina Mishra, Robert Schreiber, and Robert E. Tarjan.
Maximizing the Spread of Influence through a Social Network
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Gossip algorithms : “infect forever” dynamics Low-level objectives: – One-to-all: Disseminate rumor from source node to all nodes of network – All-to-all:
Efficient Control of Epidemics over Random Networks Marc Lelarge (INRIA-ENS) SIGMETRICS 09.
Brian Baingana, Gonzalo Mateos and Georgios B. Giannakis Dynamic Structural Equation Models for Tracking Cascades over Social Networks Acknowledgments:
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Masters Thesis Defense Amit Karandikar Advisor: Dr. Anupam Joshi Committee: Dr. Finin, Dr. Yesha, Dr. Oates Date: 1 st May 2007 Time: 9:30 am Place: ITE.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
INFERRING NETWORKS OF DIFFUSION AND INFLUENCE Presented by Alicia Frame Paper by Manuel Gomez-Rodriguez, Jure Leskovec, and Andreas Kraus.
Clustering Social Networks Isabelle Stanton, University of Virginia Joint work with Nina Mishra, Robert Schreiber, and Robert E. Tarjan.
Advanced Topics in Data Mining Special focus: Social Networks.
Sunbelt 2009statnet Development Team ERGM introduction 1 Exponential Random Graph Models Statnet Development Team Mark Handcock (UW) Martina.
Models of Influence in Online Social Networks
Online Social Networks and Media Epidemics and Influence.
Motif Discovery in Protein Sequences using Messy De Bruijn Graph Mehmet Dalkilic and Rupali Patwardhan.
Modeling Information Diffusion in Networks with Unobserved Links Quang Duong Michael P. Wellman Satinder Singh Computer Science and Engineering University.
Efficient Identification of Overlapping Communities Jeffrey Baumes Mark Goldberg Malik Magdon-Ismail Rensselaer Polytechnic Institute, Troy, NY.
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Class 10: Introduction to CINET Using CINET for network analysis and visualization Network Science: Introduction to CINET 2015 Prof. Boleslaw K. Szymanski.
Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, É va Tardos KDD 2003.
15-853:Algorithms in the Real World
Online Social Networks and Media
I NFORMATION C ASCADE Priyanka Garg. OUTLINE Information Propagation Virus Propagation Model How to model infection? Inferring Latent Social Networks.
 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.
On Bharathi-Kempe-Salek Conjecture about Influence Maximization Ding-Zhu Du University of Texas at Dallas.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs Maleq Khan September 9, 2014 Joint work with: Hasanuzzaman.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University
Random Walk for Similarity Testing in Complex Networks
Wenyu Zhang From Social Network Group
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Independent Cascade Model and Linear Threshold Model
Random Walks on Graphs.
A Study of Group-Tree Matching in Large Scale Group Communications
What Stops Social Epidemics?
On Growth of Limited Scale-free Overlay Network Topologies
Diffusion and Viral Marketing in Networks
Social and Information Network Analysis: Review of Key Concepts
Finding Communities by Clustering a Graph into Overlapping Subgraphs
Generative Model To Construct Blog and Post Networks In Blogosphere
Independent Cascade Model and Linear Threshold Model
Extract Agent-based Model from Communication Network
A Locality Model of the Evolution of Blog Networks
The likelihood of linking to a popular website is higher
Chi Zhang, Yang Song and Yuguang Fang
Small World Networks Scotty Smith February 7, 2007.
Diffusion in Networks Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale 1/17/2019.
A History Sensitive Cascade Model in Diffusion Networks
Bharathi-Kempe-Salek Conjecture
复杂网络可控性 研究进展 汪秉宏 2014 北京 网络科学论坛.
Viral Marketing over Social Networks
Independent Cascade Model and Linear Threshold Model
Advanced Topics in Data Mining Special focus: Social Networks
The Impact of Changes in Network Structure on Diffusion of Warnings
Presentation transcript:

Malik Magdon-Ismail, Konstantin Mertsalov, Mark Goldberg Models of Communication Dynamics for Simulation of Information Diffusion Malik Magdon-Ismail, Konstantin Mertsalov, Mark Goldberg

Motivation Important to understand information diffusion in social networks Viral marketing, gossip, rumors, etc. Social Networks are dynamic Edges and nodes change with time. Cannot repeat historical dynamics, so need to simulate dynamics for research.

LiveJournal Data Construct sequence of comment graphs (every week) Alice’s Blog Bill’s Blog Alice Posted Bill Posted A Bill commented Alice commented Cory commented Edges: (A,B); (C,B) (D,B) Edges: (B,A); (C,A) Alice commented Cory commented Dave commented D B C Construct sequence of comment graphs (every week) 3

Dynamics of LiveJournal Network 60 weeks Per week: 153,028 nodes 510,317 edges Very dynamic: 70% of edges change from week to week 4

Diffusion in Dynamic Networks Time: T Time: T+1 Time: T+2 A B F E H C D G J A B F E H C D G J A B F E H C D G J Static C A B F E H C D G J A B F E H C D G J A B D Dynamic F E J H G

Diffusion in LiveJournal Blogs Linear Threshold Independent Cascade Diffusion model and network dynamics have a big impact on infection.

Goal Can we model the network dynamics so that diffusion in the model mimics diffusion in the real network?

Network at iteration t+1 Modeling Dynamics Input Network at iteration t Output Network at iteration t+1 C C A A B D B D E J E J F F H H G G

Step 2: Local Attachment A General Model Input: Gt Step 1: Find Locality C A C B A D B D F E J F E J H G H G Step 2: Local Attachment Output: Gt+1 C A B C D A B D F E J F E J H G H G

Ingredients to General Model 1. What is the locality of the node ? C A Global: all nodes k-Neighborhood Community* B D Gt F E J H G 2. How to attach within locality ? C A B Uniform Preferential Attachment Random walk D Gt+1 F E J H G * Community = union of overlapping clusters [Baumes, Goldberg, Magdon-Ismail 2005]

Diffusion Models Linear Threshold: C C Linear Threshold: Node i has a susceptibility fraction T(i). Node i infected if at least T(i) neighbors are infected. A A B B D D F F E J E J H H G G C C A A Independent Cascade: Every edge (i,j) has transmission prob. P(i,j). Nodes have one chance to infect neighbors. B B D D 0.3 0.2 F F E J E J 0.4 H H G G

Diffusion in Dynamic Network Diffusion Model Network Dynamics Cascade Real LiveJournal Diffusion Progression Locality and Attachment Threshold Model

Static Aggregated Network Results Dynamic Network Static Aggregated Network Cascade Threshold

Conclusions Dynamics of the network strongly affects it’s diffusion properties Global random link dynamics does not model dynamics correctly Social network links evolve through locality (social groups), eg. cluster-based communities+PA produces diffusion faithful network dynamics.

Thank you !