A paper talk: Using Diffusion Characters for the Taxonomy of Self-Organizing Social Networks Daniel Ashlock and Colin Lee CIBCB 2009

1. Using Diffusion Characters for the Taxonomy of Self-Organizing Social Networks Daniel Ashlock and Colin Lee CIBCB 2009

4. Prisoner's Dilemma £ 20 000

5. Prisoner's Dilemma £10k £10k cooperation

6. Prisoner's Dilemma £ 10k £ 10k £ 5k £ 5k cooperation defection

7. Prisoner's Dilemma £ 0k £ 20k sucker! temptation £ 5k £ 5k defection £ 10k £ 10k cooperation

9. 2 x Cooperation ≤ Sucker + Temptation £ 10k £ 10k £ 0k cooperation sucker! temptation £ 5k £ 5k defection £ 20k

13. Contact number = number of times agents play one another

14. 95% of mean contact number places an edge between agents

15. Contact Networks

17. Technique: column entropy (CE) distance distance ... ... Sort

19. Multiply by diffusion ( β = ½)

20. Take Leontief inverse distance ... ... Sort

22. T: adjacency matrix * diffusion distance ... ... Sort

24. Calculate column entropies

25. Sort entropy vectors

26. Euclidean distance between vectors distance ... ... Sort

32. Use other ways to verify taxonomy data?

33. Collaborate??