Lecture 2-3 Deterministic Difussion Weili Wu Ding-Zhu Du University of Texas at Dallas.

Slides:

Advertisements

Similar presentations

Greedy Algorithms (Chap. 16)

Advertisements

Max Flow Min Cut. Theorem The maximum value of an st-flow in a digraph equals the minimum capacity of an st-cut. Theorem If every arc has integer capacity,

University of Texas at Dallas

C&O 355 Lecture 23 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.

1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.

Approximation Algorithms

Chapter 6. Relaxation (1) Superstring Ding-Zhu Du.

Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.

The Greedy Method1. 2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Minimum Spanning.

Spread of Influence through a Social Network Adapted from :

Ding-Zhu Du │ University of Texas at Dallas │ Lecture 7 Rumor Blocking 0.

1 Internet Networking Spring 2002 Tutorial 9 Max-Min Fairness.

Lecture 3 Power Law Structure Ding-Zhu Du Univ of Texas at Dallas.

Influence Maximization

Lecture 10 Matroid. Independent System Consider a finite set S and a collection C of subsets of S. (S,C) is called an independent system if i.e., it is.

Viral Marketing for Dedicated Customers Presented by: Cheng Long 25 August, 2012.

CISC 235: Topic 11 Shortest Paths Algorithms. CISC 235 Topic 112 Outline Single-Source Shortest Paths Algorithm for Unweighted Graphs Algorithm for Weighted,

Approximation Algorithms in Computational Social Networks Weili Wu Ding-Zhu Du University of Texas at Dallas.

Ding-Zhu Du Office: ECSS 3-611, M 3:15-4:30 Lecture: ECSS 2.311, MW 12:30-1:45.

1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,

Chapter 2 Greedy Strategy I. Independent System Ding-Zhu Du.

Network Flow. Network flow formulation A network G = (V, E). Capacity c(u, v)  0 for edge (u, v). Assume c(u, v) = 0 if (u, v)  E. Source s and sink.

Lecture 1-5 Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas.

Chapter 6 Relaxation (1) CDS in unit disk graph

Problem Setting :Influence Maximization A new product is available in the market. Whom to give free samples to maximize the purchase of the product ? 1.

Lecture 3-1 Independent Cascade Weili Wu Ding-Zhu Du University of Texas at Dallas.

On Bharathi-Kempe-Salek Conjecture about Influence Maximization Ding-Zhu Du University of Texas at Dallas.

Frequency Capping in Online Advertising Moran Feldman Technion Joint work with: Niv Buchbinder,The Open University of Israel Arpita Ghosh,Yahoo! Research.

Happy 60 th Birthday Forth Worth Chapter From Dallas Chapter 2.

Lecture 5-1 Positive Influence Dominating Set Ding-Zhu Du Univ of Texas at Dallas.

Lesson 7.   Part 1: Reading for Information (5 min)  Part 2: Applied Mathematics (10 min)  Part 3: Locating Information (15 min) Total Lesson: 30.

Lecture 2-1 Submodular Maximization Weili Wu Ding-Zhu Du University of Texas at Dallas.

Polyhedral Optimization Lecture 5 – Part 3 M. Pawan Kumar Slides available online

Lecture 5-2 Target-Influence and Power Law Graphs Ding-Zhu Du Univ of Texas at Dallas.

Computational Social Networks --computational data networks Weili Wu Ding-Zhu Du University of Texas at Dallas.

1/54 Rumor Source Detection: monitor placement Ding-Zhu Du Department of Computer Science University of Texas at Dallas.

Design and Analysis of Approximation Algorithms

Seed Selection.

Independent Cascade Model and Linear Threshold Model

Heuristic & Approximation

Influence Maximization

Modularity Maximization

Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas

Positive Influence Dominating Set

Independent Cascade Model and Linear Threshold Model

Influence Maximization

Edmonds-Karp Algorithm

Lecture 9 Greedy Strategy

Influence-Based Community Detection

© University of Cambridge

Detect rumor sources 2019/1/3

Activity Networks

How big is the business of sports?

Project Selection Bin Li 10/29/2008.

Bharathi-Kempe-Salek Conjecture

General Threshold and Cascade Models

Kempe-Kleinberg-Tardos Conjecture A simple proof

Lecture 21 More Approximation Algorithms

at University of Texas at Dallas

Influence Maximization

Independent Cascade Model and Linear Threshold Model

Survey on Coverage Problems in Wireless Sensor Networks - 2

Lecture 28 Approximation of Set Cover

And Competitive Influence

Lecture 2-6 Complexity for Computing Influence Spread

Multiple Products.

Noncooperative Rumor Blocking

Algorithms Lecture # 26 Dr. Sohail Aslam.

Algorithms Lecture # 25 Dr. Sohail Aslam.

Data-Dependent Approximation

Presentation transcript:

Lecture 2-3 Deterministic Difussion Weili Wu Ding-Zhu Du University of Texas at Dallas

Outline Influence Max Min Seeding 2

The trend effect that Kate, Duchess of Cambridge has on others, from cosmetic surgery for brides, to sales of coral-colored jeans.” “Kate Middleton effect Kate Middleton effect 3

According to Newsweek, "The Kate Effect may be worth £1 billion to the UK fashion industry." Tony DiMasso, L. K. Bennett’s US president, stated in 2012, "...when she does wear something, it always seems to go on a waiting list." Hike in Sales of Special Products 4

Influential persons often have many friends. Kate is one of the persons that have many friends in this social network. For more Kates, it’s not as easy as you might think! How to Find Kate? 5

Given a digraph and k>0, Find k seeds (Kates) to maximize the number of influenced persons (possibly in many steps). Influence Maximization 6

7 Theorem Proof

Modularity of Influence 8

Theorem 9

Outline Influence Max Min Seeding 10

Min Seeding 11

Greedy Algorithm

14

15

Theorem 16

THANK YOU!