Transcript Propagation on Large Networks B. Aditya Prakash http://www.cs.cmu.edu/~badityap Christos Faloutsos http://www.cs.cmu.edu/~christos Carnegie Mellon University INARC Meeting – May 2nd.

Propagation on Large
Networks
B. Aditya Prakash
http://www.cs.cmu.edu/~badityap
Christos Faloutsos
http://www.cs.cmu.edu/~christos
Carnegie Mellon University
INARC Meeting – May 2nd
Preaching to the choir:
Networks are everywhere!
Facebook Network [2010]
Gene Regulatory Network
[Decourty 2008]
Human Disease Network
[Barabasi 2007]
The Internet [2005]
Prakash and Faloutsos 2012
2
Focus of this talk:
Dynamical Processes over networks
are also everywhere!
Prakash and Faloutsos 2012
3
Why do we care?
• Social collaboration
• Information Diffusion
• Viral Marketing
• Epidemiology and Public Health
• Cyber Security
• Human mobility
• Games and Virtual Worlds
• Ecology
........
Prakash and Faloutsos 2012
4
Why do we care? (1: Epidemiology)
• Dynamical Processes over networks
[AJPH 2007]
Diseases over contact networks
Prakash and Faloutsos 2012
CDC data: Visualization of
the first 35 tuberculosis
(TB) patients and their
1039 contacts
5
Why do we care? (1: Epidemiology)
• Dynamical Processes over networks
• Each circle is a hospital
• ~3000 hospitals
• More than 30,000 patients
transferred
[US-MEDICARE
NETWORK 2005]
Problem: Given k units of
disinfectant, whom to immunize?
Prakash and Faloutsos 2012
6
Why do we care? (1: Epidemiology)
~6x
fewer!
CURRENT PRACTICE
[US-MEDICARE
NETWORK 2005]
OUR METHOD
Prakash and Faloutsos 2012
7
Hospital-acquired inf. took
99K+ lives, cost $5B+ (all per year)
Why do we care? (2: Online
Diffusion)
> 800m users, ~$1B
revenue [WSJ 2010]
~100m active users
> 50m users
Prakash and Faloutsos 2012
8
Why do we care? (2: Online
Diffusion)
• Dynamical Processes over networks
Buy Versace™!
Followers
Celebrity
Social MediaPrakash
Marketing
and Faloutsos 2012
9
Why do we care?
(3: To change the world?)
• Dynamical Processes over networks
Social networks and Collaborative Action
Prakash and Faloutsos 2012
10
High Impact – Multiple Settings
epidemic out-breaks
Q. How to squash rumors faster?
products/viruses
Q. How do opinions spread?
transmit s/w patches
Q. How to market better?
Prakash and Faloutsos 2012
11
Research Theme
ANALYSIS
Understanding
POLICY/
ACTION
DATA
Large real-world
networks & processes
Managing
Prakash and Faloutsos 2012
12
Research Theme – Public Health
ANALYSIS
Will an epidemic
happen?
POLICY/
ACTION
DATA
Modeling # patient
transfers
Prakash and Faloutsos 2012
How to control
out-breaks?
13
Research Theme – Social Media
ANALYSIS
# cascades in
future?
POLICY/
ACTION
DATA
Modeling Tweets
spreading
Prakash and Faloutsos 2012
How to market
better?14
In this talk
Given propagation models:
Q1: Will an epidemic
happen?
ANALYSIS
Understanding
Prakash and Faloutsos 2012
15
In this talk
Q2: How to immunize and
control out-breaks better?
POLICY/
ACTION
Managing
Prakash and Faloutsos 2012
16
Outline
• Motivation
• Epidemics: what happens? (Theory)
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
17
A fundamental question
Strong
Virus
Epidemic?
Prakash and Faloutsos 2012
18
example (static graph)
Weak Virus
Epidemic?
Prakash and Faloutsos 2012
19
Problem Statement
# Infected
above (epidemic)
below (extinction)
Separate the
regimes?
time
Find, a condition under which
– virus will die out exponentially quickly
– regardless of initial infection condition
Prakash and Faloutsos 2012
20
Threshold (static version)
Problem Statement
• Given:
–Graph G, and
–Virus specs (attack prob. etc.)
• Find:
–A condition for virus extinction/invasion
Prakash and Faloutsos 2012
21
Threshold: Why important?
•
•
•
•
Accelerating simulations
Forecasting (‘What-if’ scenarios)
Design of contagion and/or topology
A great handle to manipulate the spreading
– Immunization
– Maximize collaboration
…..
Prakash and Faloutsos 2012
22
Outline
• Motivation
• Epidemics: what happens? (Theory)
– Background
– Result (Static Graphs)
– Proof Ideas (Static Graphs)
– Bonus 1: Dynamic Graphs
– Bonus 2: Competing Viruses
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
23
“SIR” model: life immunity
(mumps)
• Each node in the graph is in one of three states
– Susceptible (i.e. healthy)
– Infected
– Removed (i.e. can’t get infected again)
Prob. δ
t=1
t=2
Prakash and Faloutsos 2012
t=3
24
Terminology: continued
• Other virus propagation models (“VPM”)
– SIS : susceptible-infected-susceptible, flu-like
– SIRS : temporary immunity, like pertussis
– SEIR : mumps-like, with virus incubation
(E = Exposed)
….………….
• Underlying contact-network – ‘who-can-infectwhom’
Prakash and Faloutsos 2012
25
Related Work















R. M. Anderson and R. M. May. Infectious Diseases of Humans. Oxford University Press,
1991.
A. Barrat, M. Barthélemy, and A. Vespignani. Dynamical Processes on Complex
Networks. Cambridge University Press, 2010.
F. M. Bass. A new product growth for model consumer durables. Management Science,
15(5):215–227, 1969.
D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos. Epidemic thresholds in
real networks. ACM TISSEC, 10(4), 2008.
D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly
Connected World. Cambridge University Press, 2010.
A. Ganesh, L. Massoulie, and D. Towsley. The effect of network topology in spread of
epidemics. IEEE INFOCOM, 2005.
Y. Hayashi, M. Minoura, and J. Matsukubo. Recoverable prevalence in growing scale-free
networks and the effective immunization. arXiv:cond-at/0305549 v2, Aug. 6 2003.
H. W. Hethcote. The mathematics of infectious diseases. SIAM Review, 42, 2000.
H. W. Hethcote and J. A. Yorke. Gonorrhea transmission dynamics and control. Springer
Lecture Notes in Biomathematics, 46, 1984.
J. O. Kephart and S. R. White. Directed-graph epidemiological models of computer
viruses. IEEE Computer Society Symposium on Research in Security and Privacy, 1991.
J. O. Kephart and S. R. White. Measuring and modeling computer virus prevalence. IEEE
Computer Society Symposium on Research in Security and Privacy, 1993.
R. Pastor-Santorras and A. Vespignani. Epidemic spreading in scale-free networks.
Physical Review Letters 86, 14, 2001.
………
………
………
All are about either:
• Structured
topologies (cliques,
block-diagonals,
hierarchies, random)
• Specific virus
propagation models
• Static graphs
Prakash and Faloutsos 2012
26
Outline
• Motivation
• Epidemics: what happens? (Theory)
– Background
– Result (Static Graphs)
– Proof Ideas (Static Graphs)
– Bonus 1: Dynamic Graphs
– Bonus 2: Competing Viruses
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
27
How should the answer look like?
• Answer should depend on:
– Graph
– Virus Propagation Model (VPM)
• But how??
– Graph – average degree? max. degree? diameter?
– VPM – which parameters?
– How to combine – linear? quadratic? exponential?
2 2
(

d avg  d avg ) / d max ? …..
d avg   diameter ?
Prakash and Faloutsos 2012
28
Static Graphs: Our Main Result
• Informally,
For,
 any arbitrary topology (adjacency
matrix A)
 any virus propagation model (VPM) in
standard literature
•
the
epidemic threshold depends only
1. on the λ, first eigenvalue of A, and
2. some constant CVPM , determined by
the virus propagation model
λ
CVPM
No
epidemic if
λ * CVPM < 1
In Prakash+ ICDM 2011 (Selected among best papers).
Prakash and Faloutsos 2012
29
Our thresholds for some models
• s = effective strength
• s < 1 : below threshold
Models
SIS, SIR, SIRS, SEIR
SIV, SEIV
Effective Strength
(s)
s=λ.
 
 
 
s=λ.
  


      
SI1I2 V1 V2 (H.I.V.) s
 1v2   2
= λ .  v2   v1 
Prakash and Faloutsos 2012
Threshold (tipping
point)
s=1



30
Our result: Intuition for λ
“Official” definition:
• Let A be the adjacency
matrix. Then λ is the root
with the largest magnitude of
the characteristic polynomial
of A [det(A – xI)].
“Un-official” Intuition 
• λ ~ # paths in the graph
k
A
≈
u
k
.u
• Doesn’t give much intuition!
k (i, j) = # of paths i  j
A
of length k
Prakash and Faloutsos 2012
31
Largest Eigenvalue (λ)
better connectivity
Prakash and Faloutsos 2012
higher λ
32
Largest Eigenvalue (λ)
better connectivity
λ≈2
λ≈2
N = 1000
higher λ
λ= N
λ = N-1
λ= 31.67
λ= 999
Prakash and Faloutsos 2012
N nodes
33
Footprint
Fraction of Infections
Examples: Simulations – SIR
(mumps)
Effective Strength
Time ticks
(a) Infection profile
(b) “Take-off” plot
PORTLAND graph: synthetic population,
31 million links, 6 million nodes
Prakash and Faloutsos 2012
34
Footprint
Fraction of Infections
Examples: Simulations – SIRS
(pertusis)
Time ticks
Effective Strength
(a) Infection profile
(b) “Take-off” plot
PORTLAND graph: synthetic population,
31 million links, 6 million nodes
Prakash and Faloutsos 2012
35
Outline
• Motivation
• Epidemics: what happens? (Theory)
– Background
– Result (Static Graphs)
– Proof Ideas (Static Graphs)
– Bonus 1: Dynamic Graphs
– Bonus 2: Competing Viruses
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
36
Proof Sketch
General VPM
structure
Model-based
λ * CVPM < 1
Topology and
stability
Graph-based
37
Models and more models
Model
Used for
SIR
Mumps
SIS
Flu
SIRS
Pertussis
SEIR
Chicken-pox
……..
SICR
Tuberculosis
MSIR
Measles
SIV
Sensor Stability
SI1I2 V1 V2 H.I.V.
……….
38
Ingredient 1: Our generalized model
Endogenous
Transitions
Susceptible
Infected
Exogenous
Transitions
Endogenous
Transitions
Vigilant
39
Special case
Susceptible
Infected
Vigilant
40
Special case: H.I.V.
SI1I2 V1 V2
“Non-terminal”
“Terminal”
Multiple Infectious,
Vigilant states
41
Ingredient 2: NLDS+Stability
• View as a NLDS
– discrete time
– non-linear dynamical system (NLDS)
size
mN x 1
.
.
.
.
.
.
Probability vector
Specifies the state of
the system at time t
size N (number of
nodes in the graph)
S
I
V
42
Ingredient 2: NLDS + Stability
• View as a NLDS
– discrete time
– non-linear dynamical system (NLDS)
size
mN x 1
.
.
.
.
.
.
Non-linear function
Explicitly gives the
evolution of system
43
Ingredient 2: NLDS + Stability
• View as a NLDS
– discrete time
– non-linear dynamical system (NLDS)
• Threshold  Stability of NLDS
44
Special case: SIR
S
size
3N x 1
S
I
I
R
R
= probability that node
i is not attacked by
any of its infectious
NLDS
neighbors
45
Fixed Point
1
1
.
0
0
.
0
0
.
State when no node is
infected
Q: Is it stable?
46
Stability for SIR
Stable
under threshold
Unstable
above threshold
47
See paper for
full proof
General VPM
structure
Model-based
λ * CVPM < 1
Topology and
stability
Prakash and Faloutsos 2012
Graph-based
48
Outline
• Motivation
• Epidemics: what happens? (Theory)
– Background
– Result (Static Graphs)
– Proof Ideas (Static Graphs)
– Bonus 1: Dynamic Graphs
– Bonus 2: Competing Viruses
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
49
Dynamic Graphs: Epidemic?
Alternating behaviors
DAY
(e.g., work)
adjacency
matrix
8
8
Prakash and Faloutsos 2012
50
Dynamic Graphs: Epidemic?
Alternating behaviors
NIGHT
(e.g., home)
adjacency
matrix
8
8
Prakash and Faloutsos 2012
51
Model Description
Healthy
• SIS model
N2
Prob. β
– recovery rate δ
– infection rate β
N1
X
Prob. δ
Infected
N3
• Set of T arbitrary graphs
day
N
night
N
N
, weekend…..
N
Prakash and Faloutsos 2012
52
Our result: Dynamic Graphs
Threshold
• Informally, NO epidemic if
eig (S) =
Single number!
Largest eigenvalue of
The system matrix S
In Prakash+, ECML-PKDD 2010
Prakash and Faloutsos 2012
<1
S =
53
Infection-profile
log(fraction infected)
MIT Reality
Mining
Synthetic
ABOVE
ABOVE
AT
AT
BELOW
BELOW
Time
Prakash and Faloutsos 2012
54
Footprint (#
infected @
“steady state”)
“Take-off” plots
Synthetic
MIT Reality
EPIDEMIC
Our
threshold
NO EPIDEMIC
Our
threshold
EPIDEMIC
NO EPIDEMIC
(log scale)
Prakash and Faloutsos 2012
55
Outline
• Motivation
• Epidemics: what happens? (Theory)
– Background
– Result (Static Graphs)
– Proof Ideas (Static Graphs)
– Bonus 1: Dynamic Graphs
– Bonus 2: Competing Viruses
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
56
Competing Contagions
iPhone v Android
Blu-ray v HD-DVD
Attack
v
Retreat
Biological common flu/avian flu, pneumococcal inf etc
57
A simple model
• Modified flu-like
• Mutual Immunity (“pick one of the two”)
• Susceptible-Infected1-Infected2-Susceptible
Virus 2
Virus 1
Prakash and Faloutsos 2012
58
Question: What happens in the end?
Number of
Infections
green: virus 1
red: virus 2
Footprint @ Steady State
Footprint @ Steady State
ASSUME:
Virus 1 is stronger than Virus 2
Prakash and Faloutsos 2012
= ?
59
Question: What happens in the end?
Number of
Infections
green: virus 1
red: virus 2
Footprint @ Steady State
Footprint @ Steady State
??
Strength
Strength
=
2
Strength
Strength
ASSUME:
Virus 1 is stronger than Virus 2
60
Answer: Winner-Takes-All
Number of
Infections
green: virus 1
red: virus 2
ASSUME:
Virus 1 is stronger than Virus 2
61
Our Result: Winner-Takes-All
Given our model, and any graph, the
weaker virus always dies-out completely
1. The stronger survives only if it is above threshold
2. Virus 1 is stronger than Virus 2, if:
strength(Virus 1) > strength(Virus 2)
3. Strength(Virus) = λ β / δ  same as before!
In Prakash+ WWW 2012
62
Real Examples
[Google Search Trends data]
Reddit v Digg
Blu-Ray v HD-DVD
63
Outline
• Motivation
• Epidemics: what happens? (Theory)
• Action: Who to immunize? (Algorithms)
Prakash and Faloutsos 2012
64
Full Static Immunization
Given: a graph A, virus prop. model and budget k;
Find: k ‘best’ nodes for immunization (removal).
?
?
k=2
?
?
Prakash and Faloutsos 2012
65
Outline
• Motivation
• Epidemics: what happens? (Theory)
• Action: Who to immunize? (Algorithms)
– Full Immunization (Static Graphs)
– Fractional Immunization
Prakash and Faloutsos 2012
66
Challenges
• Given a graph A, budget k,
Q1 (Metric) How to measure the ‘shieldvalue’ for a set of nodes (S)?
Q2 (Algorithm) How to find a set of k nodes
with highest ‘shield-value’?
Prakash and Faloutsos 2012
67
Proposed vulnerability measure λ
λ is the epidemic threshold
“Safe”
“Vulnerable”
“Deadly”
Increasing λ
Increasing vulnerability
Prakash and Faloutsos 2012
68
A1: “Eigen-Drop”: an ideal shield
value
Eigen-Drop(S)
Δ λ = λ - λs
9
9
11
10
Δ
9
10
1
1
4
4
8
8
2
2
5
7
3
7
3
5
6
Original Graph
Prakash and Faloutsos 2012
6
Without {2, 6}
69
(Q2) - Direct Algorithm too
expensive!
• Immunize k nodes which maximize Δ λ
S = argmax Δ λ
• Combinatorial!
• Complexity:
– Example:
• 1,000 nodes, with 10,000 edges
• It takes 0.01 seconds to compute λ
• It takes 2,615 years to find 5-best nodes!
Prakash and Faloutsos 2012
70
A2: Our Solution
• Part 1: Shield Value
– Carefully approximate Eigen-drop (Δ λ)
– Matrix perturbation theory
• Part 2: Algorithm
– Greedily pick best node at each step
– Near-optimal due to submodularity
• NetShield (linear complexity)
– O(nk2+m) n = # nodes; m = # edges
In Tong, Prakash+ ICDM 2010
Prakash and Faloutsos 2012
71
Our Solution: Part 1
• Approximate Eigen-drop (Δ λ)
• Δ λ ≈ SV(S) =
– Result using Matrix perturbation theory
– u(i) == ‘eigenscore’
~~ pagerank(i)
A
u(i)
u =λ. u
72
P1: node importance
Original Graph
P2: set diversity
Select by P1
Select by P1+P2
73
Our Solution: Part 2: NetShield
• We prove that:
SV(S) is sub-modular (& monotone non-decreasing)
Corollary: Greedy algorithm works
1. NetShield is near-optimal (w.r.t. max SV(S))
2. NetShield is O(nk2+m)
• NetShield: Greedily add best node at each step
Footnote: near-optimal means SV(S NetShield) >= (1-1/e) SV(S Opt)
74
Experiment: Immunization quality
Log(fraction of
infected
nodes)
PageRank
Betweeness (shortest path)
Degree
Lower
is
better
Acquaintance
Eigs (=HITS)
NetShield
Time
Prakash and Faloutsos 2012
75
Outline
• Motivation
• Epidemics: what happens? (Theory)
• Action: Who to immunize? (Algorithms)
– Full Immunization (Static Graphs)
– Fractional Immunization
Prakash and Faloutsos 2012
76
Fractional Immunization of Networks
B. Aditya Prakash, Lada Adamic, Theodore
Iwashyna (M.D.), Hanghang Tong, Christos
Faloutsos
Submitted to Science
Prakash and Faloutsos 2012
77
Fractional Asymmetric
Immunization
Drug-resistant Bacteria
(like XDR-TB)
Another
Hospital
Hospital
Prakash and Faloutsos 2012
78
Fractional Asymmetric
Immunization
=f
Drug-resistant Bacteria
(like XDR-TB)
Another
Hospital
Hospital
Prakash and Faloutsos 2012
79
Fractional Asymmetric
Immunization
Problem: Given k units of disinfectant,
how to distribute them to maximize
hospitals saved?
Another
Hospital
Hospital
Prakash and Faloutsos 2012
80
Our Algorithm “SMART-ALLOC”
~6x
fewer!
[US-MEDICARE NETWORK 2005]
• Each circle is a hospital, ~3000 hospitals
• More than 30,000 patients transferred
CURRENT PRACTICE
Prakash and Faloutsos 2012
SMART-ALLOC
81
Wall-Clock
Time
Running Time
> 1 week
≈
> 30,000x
speed-up!
Lower
is
better
14 secs
Simulations
Prakash and Faloutsos 2012
SMART-ALLOC
82
* = ones which I talked about
Publications
*
*
1.
2.
3.
4.
5.
*
*
6.
7.
8.
9.
10.
11.
12.
13.
14.
Winner-takes-all: Competing Viruses or Ideas on fair-play networks (B. Aditya Prakash, Alex Beutel, Roni Rosenfeld, Christos
Faloutsos) – In WWW 2012, Lyon
Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks (B. Aditya Prakash, Deepayan Chakrabarti, Michalis
Faloutsos, Nicholas Valler, Christos Faloutsos) - In IEEE ICDM 2011, Vancouver (Invited to KAIS Journal Best Papers of
ICDM.)
Times Series Clustering: Complex is Simpler! (Lei Li, B. Aditya Prakash) - In ICML 2011, Bellevue
Epidemic Spreading on Mobile Ad Hoc Networks: Determining the Tipping Point (Nicholas Valler, B. Aditya Prakash, Hanghang
Tong, Michalis Faloutsos and Christos Faloutsos) – In IEEE NETWORKING 2011, Valencia, Spain
Formalizing the BGP stability problem: patterns and a chaotic model (B. Aditya Prakash, Michalis Faloutsos and Christos
Faloutsos) – In IEEE INFOCOM NetSciCom Workshop, 2011.
On the Vulnerability of Large Graphs (Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad and Christos Faloutsos) – In IEEE
ICDM 2010, Sydney, Australia
Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms (B. Aditya Prakash, Hanghang Tong,
Nicholas Valler, Michalis Faloutsos and Christos Faloutsos) – In ECML-PKDD 2010, Barcelona, Spain
MetricForensics: A Multi-Level Approach for Mining Volatile Graphs (Keith Henderson, Tina Eliassi-Rad, Christos Faloutsos,
Leman Akoglu, Lei Li, Koji Maruhashi, B. Aditya Prakash and Hanghang Tong) - In SIGKDD 2010, Washington D.C.
Parsimonious Linear Fingerprinting for Time Series (Lei Li, B. Aditya Prakash and Christos Faloutsos) - In VLDB 2010,
Singapore
EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs (B. Aditya Prakash, Ashwin Sridharan,
Mukund Seshadri, Sridhar Machiraju and Christos Faloutsos) – In PAKDD 2010, Hyderabad, India
BGP-lens: Patterns and Anomalies in Internet-Routing Updates (B. Aditya Prakash, Nicholas Valler, David Andersen, Michalis
Faloutsos and Christos Faloutsos) – In ACM SIGKDD 2009, Paris, France.
Surprising Patterns and Scalable Community Detection in Large Graphs (B. Aditya Prakash, Ashwin Sridharan, Mukund
Seshadri, Sridhar Machiraju and Christos Faloutsos) – In IEEE ICDM Large Data Workshop 2009, Miami
FRAPP: A Framework for high-Accuracy Privacy-Preserving Mining (Shipra Agarwal, Jayant R. Haritsa and B. Aditya Prakash)
– In Intl. Journal on Data Mining and Knowledge Discovery (DKMD), Springer, vol. 18, no. 1, February 2009, Ed:
Johannes Gehrke.
Complex Group-By Queries For XML (C. Gokhale, N. Gupta, P. Kumar, L. V. S. Lakshmanan, R. Ng and B. Aditya Prakash) – In
IEEE ICDE 2007, Istanbul, Turkey.
*
Submitted
1.
2.
3.
4.
5.
6.
Fractional Immunization of Networks (B. Aditya Prakash, Lada Adamic, Theodore Iwashyna,
Hanghang Tong, Christos Faloutsos)
How much of Twitter is Influence? (B. Aditya Prakash, Deepayan Chakrabarti, Kunal Punera)
Who is to blame? Finding Culprits in Epidemics (B. Aditya Prakash, Jilles Vreeken, Christos Faloutsos)
Competing Viruses on Composite Networks: Who wins? (Xuetao Wei, Nicholas Valler, B. Aditya
Prakash, Iulian Neamtiu, Michalis Faloutsos and Christos Faloutsos)
Gelling, and Melting, Large Graphs through Edge Manipulation (Hanghang Tong, B. Aditya Prakash,
Tina Eliassi-Rad, Michalis Faloutsos, Christos Faloutsos)
Worst-case Footprints in the SIS model (B. Aditya Prakash, Varun Gupta and Christos Faloutsos)
Patents
1.
2.
Determining User Communities in Communication Networks (Ashwin Sridharan, Mukund Seshadri,
James Schneider, B. Aditya Prakash, Christos Faloutsos) Sprint Inc., filed March 2010
Analysis of Computer Network Activity by Successively Removing Accepted Types of Access Events
(B. Aditya Prakash, Alice Zheng, Jack Stokes, Eric Fitzgerald, Theodore Hardy) Microsoft Research,
filed April 2010
84
Acknowledgements
Collaborators
Christos Faloutsos
Roni Rosenfeld,
Michalis Faloutsos,
Lada Adamic,
Theodore Iwashyna (M.D.),
Dave Andersen,
Tina Eliassi-Rad,
Iulian Neamtiu,
Varun Gupta,
Jilles Vreeken,
Deepayan Chakrabarti,
Hanghang Tong,
Kunal Punera,
Ashwin Sridharan,
Sridhar Machiraju,
Mukund Seshadri,
Alice Zheng,
Lei Li,
Polo Chau,
Nicholas Valler,
Alex Beutel,
Xuetao Wei
Prakash and Faloutsos 2012
85
Acknowledgements
Funding
Prakash and Faloutsos 2012
86
Propagation on Large Networks
B. Aditya Prakash
Christos Faloutsos
Analysis
Policy/Action
Prakash and Faloutsos 2012
Data
87