1. lidong.wu@utdallas.edu Lecture 3 Power Law Structure Ding-Zhu Du Univ of Texas at Dallas

2. Why study Power-law? Many Social Networks are power-law graphs. Many NP-hard network problems are still NP- hard in power-law graphs. While they have no good approximation in general, they have constant-approximation in power-law graphs.

3. What is Power Law Graph?

4. During the evolution and growth of a network, the great majority of new edges are to nodes with an already high degree. Power Law 4

5. Power law distribution: f(x) ~ x –α Log-log scale: log f(x) ~ –αlog x Power-law distribution 5

6. Nodes with high degrees may have “butterfly effect”. Small number Big influence Power Law 6

7. 7

8. Warning In study on Power-law Graph, a lot of real numbers are treated as integers!!! 8

9. 9

10. 10 A.L. Barabasi, et al., Evolution of the social network of scientific collaborations, Physica A, vol. 311, 2002. R. Albert, et al., Erro and attack tolerance of complex networks, Nature, vol. 406, M. Faloutsos, et al., On power-law relationship of the internet topology, SIGCOMM’99,

11. Why still NP-hard in Power-law? 11

12. Proof Techniques NP-hard in graph with constant degree, e.g., the Vertex-Cover is NP-hard in cubic graphs. Embedding a constant-degree graph into a power-law graph. 12

13. 13

14. Why approximate easily in Power- law? 14

15. More nodes with low degree Less nodes with high degree Size of opt solution is often determined by # of nodes with low degree. 15

16. Modularity Maximization 16 Modularity Function (Newman 2006)

17. Modularity Maximization 17

18. Low-Degree Following Algorithm 18 i i j i i j T.N. Dinh & M.T. Thai, 2013

19. Low-Degree Following Algorithm 19

20. Low-Degree Following Algorithm 20 Choice of d 0

21. Low-Degree Following Algorithm 21 Theorem

22. Idea of Proof 22

23. Lower bound for positive part 23

24. Upper bound for negative part 24

25. 25

26. Warning In study on Power-law Graph, a lot of real numbers are treated as integers!!! 26 Can we get same results if not do so?

27. THANK YOU!