The impact of changes in network structure on diffusion of warnings
This presentation is the property of its rightful owner.
Sponsored Links
1 / 27

The Impact of Changes in Network Structure on Diffusion of Warnings PowerPoint PPT Presentation


  • 98 Views
  • Uploaded on
  • Presentation posted in: General

The Impact of Changes in Network Structure on Diffusion of Warnings. Cindy Hui Malik Magdon-Ismail William A. Wallace Mark Goldberg Rensselaer Polytechnic Institute. Diffusion on Dynamic Networks. Diffusion of warning messages through a population

Download Presentation

The Impact of Changes in Network Structure on Diffusion of Warnings

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


The impact of changes in network structure on diffusion of warnings

The Impact of Changes in Network Structure on Diffusion of Warnings

Cindy Hui

Malik Magdon-Ismail

William A. Wallace

Mark Goldberg

Rensselaer Polytechnic Institute


Diffusion on dynamic networks

Diffusion on Dynamic Networks

  • Diffusion of warning messages through a population

  • Network dynamics as the result of the information flow


Diffusion model

Diffusion Model

  • How does information flow through the network?

  • How do nodes process information?

  • How do nodes act on the information?


How does information flow

How does information flow?

  • Messages are propagated when nodes interact.


How does information flow1

How does information flow?

Information Loss Axiom

When a message is passed from one node to another, the information value of the message is non-increasing.

The information value of the message is a function of the social relationship between the sender and the receiver.

trust

A

B


How do nodes process information

How do nodes process information?

Source Union Axiom

The recipient node combines information from incoming messages.

Information Fusion Axiom

The combined information value is at most the sum of the individual bits of information and at least the maximum.


How do nodes act on the information

How do nodes act on the information?

Threshold Utility Axiom

If the node’s information fused value exceeds one of the thresholds, the node will enter a new state.

1

time

Believer

Action

Upper bound

Undecided

Lower bound

Disbelieved

0

Uninformed


Experiments

Experiments

  • Diffusion of evacuation warnings:

    • A warning message is broadcasted to a population.

    • Population is a network of household nodes.

    • The proportion of evacuated nodes is recorded.

  • Parameters:

    • Social network structure

    • Seed set selection

    • Diffusion scenarios


Experimental networks

Experimental Networks

  • The edges in the networks are undirected edges where messages may flow in either direction.


Seed set selection

Seed Set Selection

  • One single information source

    • High information value

    • Broadcast message at time step 1

  • Initially connected to 20% of the population

  • Two seeding strategies

    • Random seed set

    • Highest degree set of nodes


Social relation trust

Social Relation: Trust

  • We can use trust to differentiate the society into social groups.

  • We divide the population into two groups of nodes by randomly assigning each node to one of two groups, A or B.


Diffusion scenario 1 no groups

Diffusion Scenario 1: No Groups

  • Equal trust between all nodes

Group A

Group B


Diffusion scenario 2 groups 1

Diffusion Scenario 2: Groups (1)

  • High trust between nodes in the same group

Group A

Group B

Group A

Group B

High

Low


Diffusion scenario 3 groups 2

Diffusion Scenario 3: Groups (2)

  • High trust in nodes in group A

Group A

Group B

Group A

Group B

High

Low


Simulation results

Simulation Results


Simulation results1

Simulation Results


Simulation results2

Simulation Results


Simulation results3

Simulation Results


Simulation results4

Simulation Results


Simulation results5

Simulation Results


Conclusion

Conclusion

  • Presented a model for information propagation

    • Nodes process and act on the information

    • Group structure by assigning trust between nodes

  • Social groups are important for diffusion

    • Diffusion was more efficient when based on social group than in an unstructured way

    • Increasing trust differentials led to larger proportions of evacuated nodes

    • Trust differential alone does not accomplish the same as organized trust differentials (social groups)

  • Diffusion process and effectiveness depends on

    • Network structure

    • Seeding mechanism


Thank you

Thank you

  • Questions?

Acknowledgements: This material is based upon work partially supported by the U.S. National Science Foundation (NSF) under Grant No. IIS-0621303, IIS-0522672,IIS-0324947, CNS-0323324, NSF IIS-0634875 and by the U.S. Office of Naval Research (ONR) Contract N00014-06-1-0466 and by the U.S. Department of Homeland Security (DHS) through the Center for Dynamic Data Analysis for Homeland Security administered through ONR grant number N00014-07-1-0150 to Rutgers University.The content of this paper does not necessarily reflect the position or policy of the U.S. Government, no official endorsement should be inferred or implied.


Node states

Node States


Node parameters

Node Parameters

  • Node thresholds: Lower bound 0.1, Upper bound 0.3

  • Once a node enters believer state, they will evacuate from the network after 5 time steps

  • Nodes have high trust in the source (0.90)

  • Probability of successful communication on a link (0.75)

  • Information fusion

    • Source appears in multiple messages, take the maximum

    • Information fused value at the node, take the sum


Information fusion axiom a

Information Fusion Axiom (a)

Information Fusion Axiom (a)

When a source S is found in multiple messages with information values V1,V2,…, the information value from source S is fused into a single value V*, where

Node 1 {S1,V11;S2,V21}

Node 2 {S2,V22}

Node 3 {S1,V13; S2,V23}


Information fusion axiom b

Information Fusion Axiom (b)

Information Fusion Axiom (b)

Suppose that the sources (S1, S2,…) have information values (V1, V2,…).

The fused information value at the node is

Node 3 {S1,V13; S2,V23}


  • Login