Directedness of information flow in mobile phone communication - - PowerPoint PPT Presentation

directedness of information flow in mobile phone
SMART_READER_LITE
LIVE PREVIEW

Directedness of information flow in mobile phone communication - - PowerPoint PPT Presentation

Directedness of information flow in mobile phone communication networks Fernando Peruani In collaboration with: Lionel Tabourier MAPCON Dresden 2012 References: FP, Nicola and Morelli, New J. Phys. (2010) FP and Sibona, PRL (2008) FP


slide-1
SLIDE 1

Fernando Peruani

Directedness of information flow in mobile phone communication networks

MAPCON – Dresden – 2012 In collaboration with:

Lionel Tabourier

References: FP, Nicola and Morelli, New J. Phys. (2010) FP and Sibona, PRL (2008) FP and L. Tabourier, PLoS ONE 6, e28860 (2011)

  • L. Tabourier, A. Stoica, FP, ComsNets 12
slide-2
SLIDE 2

Synchronization in a spatial time-varying network

Kuramoto oscillators moving in the space… At a given time t, the state of the system can be represented as Equation of motion of the oscillators: Noise

slide-3
SLIDE 3

Synchronization in a spatial time-varying network

Kuramoto oscillators moving in the space… Equation of motion of the oscillators: Noise

slide-4
SLIDE 4

Synchronization in a spatial time-varying network

Any finite amount of noise is sufficient to prevent consensus in large enough systems of mobile autonomous agents randomly moving in 1D or 2D

Peruani, Nicola, Morelli, NJP (2010)

[Remember A. Diaz-Guilera’s talk: if there no noise, then global synchronization is possible]

slide-5
SLIDE 5

Synchronization in a spatial time-varying network

Peruani, Nicola, Morelli, NJP (2010) Langevin Eqs.: Associated (non linear!) Fokker-Planck Eq.: Solution: Multiple solutions!!! All these solutions exist and are linearly stable for an infinite system!!!

slide-6
SLIDE 6

Synchronization in a spatial time-varying network

Any finite amount of noise is sufficient to prevent consensus in large enough systems of mobile autonomous agents randomly moving in 1D or 2D

If agents do not move randomly, global synchronization is possible! Add a coupling between the phase and the direction of motion of the agents, and synchronization will occur in 2D (1D is more tricky!): Synchronization = collective motion Vicsek et al., PRL (1995) Gregoire & Chaté, PRL (2004) showed that this transition is first order.

slide-7
SLIDE 7

Spatial time-varying network & moving agent systems

Lattice models Classical MF models Network models (strong correlations in space)‏ (well-mixed )‏ Three classical approaches for information spreading

  • 0.45
  • 1

(at the critical point) (at the critical point)

FP and Sibona, PRL (2008)

slide-8
SLIDE 8

Spatial time-varying network & moving agent systems

Representation of a self - propelled agent

Velocity direction

L L

FP and Sibona, PRL (2008)

Moving agent systems allow us to bridge the gap between lattice to MF models, passing through time-varying networks

slide-9
SLIDE 9

Motivation

Information flow in mobile phone networks

FP and L. Tabourier, PLoS ONE 6, e28860 (2011)

  • L. Tabourier, A. Stoica, FP, ComsNets 12
slide-10
SLIDE 10

Motivation

Are there causality effects? Is there an intentional flow of information?

A B C D FP and L. Tabourier, PLoS ONE 6, e28860 (2011)

  • L. Tabourier, A. Stoica, FP, ComsNets 12
slide-11
SLIDE 11

What is the question here?

Motivation

A phone call certainly involves information exchange between two users. But is there information spreading beyond the two users involved in a communication? We focus on intentional transmission of information What are the statistical features of such information propagation process? Strategy: Construct causality trees and study their statistical properties

slide-12
SLIDE 12

Unintentional transmission of information

Motivation

A → B

calls

A phone call implies an undirected link!

A → B

A is informed

A → B A → B

B is informed

A → B

Here phone calls are not intended to transmit the information

slide-13
SLIDE 13

Intentional transmission of information

Motivation

A → B

calls

A phone call implies a directed link!

A → B

A is informed

A → B A → B

B is informed

A → B

Here phone calls could be intended to transmit the information!

slide-14
SLIDE 14

Intentional transmission of information

Motivation

A → B B → C

A is informed C is informed calls calls

A → C

after some time info flow

C → A

info flow

The temporal sequence of events does not allow it.

slide-15
SLIDE 15

Transmission of information

Motivation

A → B C → B

A is informed C is informed calls calls

after some time τ

This defines a valid flow of information, however the fact that C calls B cannot be associated to the fact that B got informed

  • previously. There is no intentionality and would not involve

“causality”.

slide-16
SLIDE 16

The social static network (cumulative network)

Definitions

1-month activity of a European mobile phone network operator 1.127.658 users 14.388.440 phone calls

Looking at the “cumulative” network… Log-normal distribution! In-out degree correlations: average: 2.5 min

* Pearson coeff. ~0.58 * There are super “senders” and “receivers” which are not necessary both.

<ki>=<ko>=2.86 <kundir>~17

slide-17
SLIDE 17

Definitions

In-out degree correlations:

* Pearson coeff. ~0.58 * There are super “senders” and “receivers” which are not necessary both.

The social static network (cumulative network)

slide-18
SLIDE 18

sender receiver time 17 33 70 05 57 19 12 57 46 57 81 42 62 15 95 15 25 99 30 65 110 135 150 180 230 300

Construction of causality trees

Definitions

slide-19
SLIDE 19

sender receiver time 17 33 70 05 57 57 12 57 46 57 81 42 62 15 25 15 25 99 30 65 110 135 150 180 230 300

Definitions

Construction of causality trees

slide-20
SLIDE 20

Definitions

Example of a real causality tree s=11 d=5

size (s) = 11 depth (d) = 5 Main features of a tree: &

slide-21
SLIDE 21

Definitions

Causality trees and S-I-R spreading dynamics

If an informed user calls

* SI (flooding) in mobile phone nets: Karsai et al., Phys. Rev. E 83, 025102 (2011) * SIR assuming that mobile phone net is undirected Miritello et al., Phys. Rev. E 83, 045102 (2011)

Disease spreading and mobile phone nets:

slide-22
SLIDE 22

Definitions

Causality trees and S-I-R spreading dynamics

  • Inoculate the disease in a node
  • Let the disease spread (on the social network)

(the spreading is dictated by the calling activity

  • f users!)
  • We get a tree after extinction of the disease

The probability of finding a causality tree of size s and depth d, is equivalent to the probability that a disease outbreak got extinguished after infecting s users at depth d.

slide-23
SLIDE 23

Theory & results

Phase transition associated with .

The average tree size exhibits a remarkable increase after ~30hours. We will see that this implies arbitrarily large cascades after 30 hours

slide-24
SLIDE 24

Theory & results

How can we understand that there is a phase transition associated to ?

phone call rate from user i to j average of this quantity average out degree of the “cumulative” network [network that contains all connection that occur in the database] The infection rate of an informed user competes with the time the user remains active

slide-25
SLIDE 25

Theory & results

How can we understand that there is a phase transition associated to ?

average tree size directed related to

Critical condition according to the MF

slide-26
SLIDE 26

Theory & results

How can we understand that there is a phase transition associated to ?

average tree size directed related to

  • Av. undir.

degree UNDIRECTED

  • 1]

[

slide-27
SLIDE 27

Theory & results

Taking into account the network topology

[in-out degree distribution – node-node correlations neglected]

“cumulative” (=social) network

Probability that an edge that arrives at a node of in-degree is used during Probability that an edge that emerges from a node of out-degree is used during

slide-28
SLIDE 28

Theory & results

Simplifying the transmission process

distribution of activity of an edge

Under all these assumption, the generating function:

slide-29
SLIDE 29

Theory & results

Condition for arbitrarily large trees

Percolation threshold for a static directed network From previously computed generating function we get:

Condition for arbitrarily large trees:

where

slide-30
SLIDE 30

Theory & results

Condition for arbitrarily large trees

To obtain the critical value we simplify the problem by assuming: for Two extreme situations: fully in-out correlated fully in-out uncorrelated

slide-31
SLIDE 31

Theory & results

Condition for arbitrarily large trees

To obtain the critical value we simplify the problem by assuming: for Two extreme situations: fully in-out correlated fully in-out uncorrelated UNDIRECTED ~12Hs !

slide-32
SLIDE 32

Theory & results

Size of trees

[ We look for the tree size distribution ] The tree size distribution generating function obeys:

We are describing tree the evolution process as a Galton-Watson process fully determined by p(ko, t) !

Reasoning: in general: related to with

slide-33
SLIDE 33

Theory & results

Size of trees

slide-34
SLIDE 34

Theory & results

Depth of trees

[ We look for the tree depth distribution ] Probability that a tree get extinguished at depth d or less We can expect the proposed tree theory to work before the emergence of arbitrarily large cascades This probability obeys: Using the fact that Tree depth distribution is then simply: where

slide-35
SLIDE 35

Theory & results

Depth of trees

slide-36
SLIDE 36

Theory & results

Depth of trees

t11 User 1 U17 U54 U89 t12 t13 t21 User 2 U25 U19 U67 t22 t23 time time

  • same topology
  • “global” mixing of time-stamps
  • Randomization of data:

RT data

slide-37
SLIDE 37

Theory & results

Absence of time-correlation effects

[at the level of size and depth distribution] The underlying social network in data and data w/ RT is the same. The only difference is due to the absence of time-correlations in data w/ RT. While for short “time-scales” (tau-values) we can neglect node-node (topological) correlations, above 30 hours these correlations becomes dominant and the simple theory proposed fails to describe the data.

slide-38
SLIDE 38

Theory & results

At short time scale the matching between RT and original data is good but not perfect – why?

Is this due to the bursty activity of user (neglected in RT data)? Is this related to sender-receiver time correlations (also neglected in RT data)? t11 User 1 U17 U54 U89 t12 t13 time

  • same topology
  • “user” mixing of time-stamps

RC data

slide-39
SLIDE 39

Theory & results

At short time scale the matching between RT and original is good but not perfect – why?

Answer: The difference is due to the bursty activity of users [sender-receiver time correlation play no role!] t11 User 1 U17 U54 U89 t12 t13 time

  • same topology
  • “user” mixing of time-stamps

RC data

slide-40
SLIDE 40

Theory & results

Looking at different motifs

slide-41
SLIDE 41

Theory & results

Looking at different motifs

slide-42
SLIDE 42

Local flow of information

Are there causality/information loops?

time t1 t2 t2-t1<tau time t1 t2 t2-t1<tau t3 t3-t2<tau

slide-43
SLIDE 43

Local flow of information

Are there causality/information loops?

Data has time-correlations while in data w/ RT time-correlations were washed out Time correlations induce larger causality loops for small values of tau!!!

slide-44
SLIDE 44

Summary

  • 1. Representation of mobile phone data as a directed network shows the

presence of super spreaders and super receivers.

  • 2. Intentional information spreading is extremely sensitive to in-out degree

correlations! These correlations help in the intentional info spreading!

  • 3. At short time scales the tree statistics can be described by a GW process –

We can neglect topological and temporal correlations!!!

  • 4. Small effect on the tree statistics is observed due to bursty user activity,

which helps to the info spreading !

  • 5. At long time scale, topological node-node correlation dominate the

dynamics! We can completely ignore temporal correlations!

  • 6. Macroscopic intentional spreading is only achieved if user retransmit for

more than 30 hours!!! (For unintentional spreading this is 12 hours!)

FP and L. Tabourier, PLoS ONE 6, e28860 (2011)

  • L. Tabourier, A. Stoica, FP, ComsNets 12
slide-45
SLIDE 45

Summary

  • 7. Time-correlations play a crucial role at very short time-scales in the form of

information cycles (that do not contribute to info spreading).

  • 8. The idea that there is information spreading beyond nearest and second-

nearest neighbors, i.e., beyond a small vicinity, is called into question!

FP and L. Tabourier, PLoS ONE 6, e28860 (2011)

  • L. Tabourier, A. Stoica, FP, ComsNets 12
slide-46
SLIDE 46

Thanks for your attention!

References: FP, Nicola and Morelli, New J. Phys. (2010) FP and Sibona, PRL (2008) FP and L. Tabourier, PLoS ONE 6, e28860 (2011)

  • L. Tabourier, A. Stoica, FP, ComsNets 12