Networking - A statistical physics perspective

Journal of Physics A: Mathematical and Theoretical

Volumn 46, Issue 10, 2013, Pages

  Yeung, Chi Ho ^a   Saad, David ^a  

^a ASTON UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84874329653     PISSN: 17518113     EISSN: 17518121     Source Type: Journal    
DOI: 10.1088/1751-8113/46/10/103001     Document Type: Review

References (187)

1. Huitema C 1995 Routing in the Internet (Englewood Cliffs, NJ: Prentice-Hall)
2. Moy J T 1998 OSPF: Anatomy of an Internet Routing Protocol (Reading, MA: Addison-Wesley)
3. Lampe C, Ellison N and Steinfield C 2006 A face(book) in the crowd: social searching versus social browsing Proc. 20th Anniversary Conf. on Computer Supported Cooperative Work pp 167-70 (Pubitemid 47112404)
4. Beckmann M, McGuire C B and Winsten C B 1956 Studies in the Economics of Transportation (New Haven, CT: Yale University Press)
5. Rangwala S, Gummadi R, Govindan R and Psounis K 2006 Interference-aware fair rate control in wireless sensor networks Comput. Commun. Rev. 36 63-74 (Pubitemid 44623716)
6. Vasan A and Simonovic S P 2010 Optimization of water distribution network design using differential evolution J. Water Resour. Plan. Manage. 136 279-87
7. Buyya R, Yeoa C S, Venugopala S, Broberga J and Brandicc I 2009 Cloud computing and emerging it platforms: vision, hype, and reality for delivering computing as the 5th utility Future Gener. Comput. Syst. 25 599-616
8. Buyya R (ed) 1999 High Performance Cluster Computing: Architectures and Systems (Englewood Cliffs, NJ: Prentice-Hall)
9. Chardaire P, McKeown G P, Verity-Harrison S A and Richardson S B 2005 Solving a time-space network formulation for the convoy movement problem Oper. Res. 53 219-30 (Pubitemid 40666155)
10. Ni L M and McKinley P K 1993 A survey of wormhole routing techniques in direct networks Computer 26 62-76
11. Al-Karaki J N and Kamal A E 2004 Routing techniques in wireless sensor networks: a survey IEEE Wirel. Commun. 11 6-28 (Pubitemid 40021186)
12. Akkaya K and Younis M 2005 A survey on routing protocols for wireless sensor networks Ad Hoc Netw. 3 325-49 (Pubitemid 40266054)
13. Cordeau J-F, Toth P and Vigo D 1998 A survey of optimization models for train routing and scheduling Transp. Sci. 32 380-404 (Pubitemid 128608925)
14. Strogatz S H 2001 Exploring complex networks Nature 410 268 (Pubitemid 32216604)
15. Albert R and Barabaśi A-L 2002 Statistical mechanics of complex networks Rev. Mod. Phys. 74 47
16. Newman M E J 2003 The structure and function of complex networks SIAM Rev. 45 167
17. Barmpoutis D and Murray R M 2011 Extremal properties of complex networks arXiv:1104.5532
18. Dorogovtsev S N, Goltsev A V and Mendes J F F 2008 Critical phenomena in complex networks Rev. Mod. Phys. 80 1276
19. Boccaletti S, Latora V, Moreno Y, Chavez M and Hwang D-U 2006 Complex networks: structure and dynamics Phys. Rep. 424 175-308 (Pubitemid 43135890)
20. Arenas A, Díaz-Guilera A, Kurths J, Moreno Y and Zhou C 2008 Synchronization in complex networks Phys. Rep. 469 93-153
21. Fortunato S 2010 Community detection in graphs Phys. Rep. 486 75-174
22. Bellman R 1958 On a routing problem Q. Appl. Math. 16 87
23. Dijkstra E W 1959 A note on two problems in connexion with graphs Numer. Math. 1 269-71
24. Lee S J and Gerla M 2001 Split multipath routing with maximally disjoint paths in ad hoc networks Proc. IEEE Int. Conf. on Communications pp 3201-5 (Pubitemid 32796984)
25. Marina M K and Das S R 2001 On-demand multi path distance vector routing in ad hoc networks Proc. 9th Int. Conf. on Network Protocols pp 14-23 (Pubitemid 34099965)
26. Takagi H and Kleinrock L 1984 Optimal transmission ranges for randomly distributed packet radio terminals IEEE Commun. Mag. 32 246-57 (Pubitemid 14544854)
27. Finn G G 1987 Routing and addressing problems in large metropolitan-scale internetworks Information Science Institutes (ISI) Technical Report ISI/RR-87-180
28. Brad K and Kung H T 2000 Gpsr: greedy perimeter stateless routing for wireless networks Proc. 6th Annu. Int. Conf. on Mobile Computing and Networking pp 243-54 (Pubitemid 32024699)
29. Stojmenovic I 2002 Position-based routing in ad hoc networks IEEE Commun. Mag. 40 128-34 (Pubitemid 34814382)
30. Ramanathan S 1999 A unified framework and algorithm for channel assignment in wireless networks Wirel. Netw. 5 81-94
31. Zheng H and Peng C 2005 Collaboration and fairness in opportunistic spectrum access Proc. IEEE Int. Conf. Communications (ICC) pp 3132-6 (Pubitemid 41240837)
32. Cao L and Zheng H 2005 Distributed spectrum allocation via local bargaining Proc. IEEE Conf. on Sensor and Ad Hoc Communications and Networks pp 475-86 (Pubitemid 44910452)
33. Jiang A and Bruck J 2002 Diversity coloring for information storage in networks Proc. IEEE Int. Symp. on Information Theory p 381 (Pubitemid 34965000)
34. Jiang A and Bruck J 2005 Multicluster interleaving on paths and cycles IEEE Trans. Inf. Theory 51 597-611 (Pubitemid 40211068)
35. Candes E J and Tao T 2005 Decoding by linear programming IEEE Trans. Inf. Theory 51 4203-15 (Pubitemid 41800353)
36. Candes E and Tao T 2006 Near optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52 5406-25 (Pubitemid 46445381)
37. Mézard M, Parisi G and Virasoro M A 1987 Spin Glass Theory and Beyond (Singapore: World Scientific)
38. Nishimori H 2001 Statistical Physics of Spin Glasses and Information Processing (Oxford: Oxford University Press)
39. Mézard M and Montanari A 2009 Information, Physics, and Computation (Oxford: Oxford University Press)
40. Hartmann A and Rieger H 2004 New Optimization Algorithms in Physics (Berlin: Wiley)
41. van Kampen N G 2006 Stochastic Processes in Physics and Chemistry (Amsterdam: Elsevier)
42. Zhao L, Lai Y-C, Park K and Ye N 2006 Onset of traffic congestion in complex networks Phys. Rev. E 71 026125
43. Gilbert E N 1959 Random graphs Ann. Math. Stat. 30 1141-4
44. Erdös P and Rényi A 1960 On random graphs: I M. Tud. Akad. Mat. Kut. Intez. Közl. 5 17-61
45. Watts D J and Strogatz S H 1998 Collective dynamics of 'small-world' networks Nature 393 440 (Pubitemid 28292183)
46. Yeung C H and Saad D 2012 Competition for shortest paths on sparse graphs Phys. Rev. Lett. 108 208701
47. Pastor-Satorras R, Vázquez A and Vespignani A 2001 Dynamical and correlation properties of the internet Phys. Rev. Lett. 87 258701
48. Catanzaro M, Boguná M and Pastor-Satorras R 2005 Generation of uncorrelated random scale-free networks Phys. Rev. E 71 027103 (Pubitemid 40607082)
49. Newman M E J 2002 Assortative mixing in networks Phys. Rev. Lett. 89 208701
50. Rodgers J L and Nicewander W A 1988 Thirteen ways to look at the correlation coefficient Am. Stat. 42 59-66
51. Eriksen E A, Simonsen I, Maslov S and Sneppen K 2003 Modularity and extreme edges of the internet Phys. Rev. Lett. 90 148701
52. Newman M E J 2006 Modularity and community structure in networks Proc. Natl Acad. Sci. USA 103 8577-82 (Pubitemid 43878062)
53. Reichardt J, Alamino R and Saad D 2011 The interplay between microscopic and mesoscopic structures in complex networks PLoS ONE 6 08
54. Leicht E A and Newman M E J 2008 Community structure in directed networks Phys. Rev. Lett. 100 118703 (Pubitemid 351457185)
55. Newman M E J and Girvan M 2004 Finding and evaluating community structure in networks Phys. Rev. E 69 026113
56. Goh K-I, Salvi G, Kahng B and Kim D 2006 Skeleton and fractal scaling in complex networks Phys. Rev. Lett. 96 018701 (Pubitemid 43248420)
57. Gauldi S, Yeung C H and Zhang Y-C 2011 Tracing the evolution of physics on the backbone of citation networks Phys. Rev. E 84 046104
58. Trusina A, Maslov S, Minnhagen P and Sneppen K 2004 Hierarchy measures in complex networks Phys. Rev. Lett. 92 178702
59. Kim D-H, Noh J D and Jeong H 2004 Scale-free trees: the skeletons of complex networks Phys. Rev. E 70 046126 (Pubitemid 40010331)
60. Carmi S, Havlin S, Kirkpatrick S, Shavitt Y and Shir E 2007 A model of internet topology using k-shell decomposition Proc. Natl Acad. Sci. 104 11150-4 (Pubitemid 47175109)
61. Kim B J, Yoon C N, Han S K and Jeong H 2002 Path finding strategies in scale-free networks Phys. Rev. E 65 027103 (Pubitemid 40619540)
62. Guare J 1990 Six Degrees of Separation: A Play (New York: Vintage Books)
63. Bollobás B 2001 Random Graphs (Cambridge: Cambridge University Press)
64. Barabási A-L and Albert R 1999 Emergence of scaling in random networks Science 286 509
65. Yule U 1925 A mathematical theory of evolution based on the conclusions of Dr. J. C. Willis, F.R.S. J. R. Stat. Soc. 88 433-6
66. Simon H A 1955 On a class of skew distribution functions Biometrika 42 425-40
67. Dorogovstev S N, Mendes J F F and Samukhin A N 2000 Structure of growing networks with preferential linking Phys. Rev. Lett. 85 4633 (Pubitemid 32024909)
68. Caldarelli G, Capocci A, Rios P D L and Munoz M A 2002 Scale-free networks from varying vertex intrinsic fitness Phys. Rev. Lett. 89 258702
69. Bianconi G and Barabaśi A-L 2001 Competition and multiscaling in evolving networks Europhys. Lett. 54 436-42
70. Almaas E, Kulkarni R V and Stroud D 2003 Scaling properties of random walks on small-world networks Phys. Rev. E 68 056105
71. Samukhin A N, Dorogovtsev S N and Mendes J F F 2008 Laplacian spectra of, and random walks on, complex networks: Are scale-free architectures really important? Phys. Rev. E 77 036115 (Pubitemid 351431339)
72. Noh J D and Rieger H 2004 Random walks on complex networks Phys. Rev. Lett. 92 118701
73. Condamin S, Bénichou O and Moreau M 2005 First-passage times for randomwalks in bounded domains Phys. Rev. Lett. 95 260601 (Pubitemid 43061522)
74. Zlatanov N and Kocarev L 2009 Random walks on networks: cumulative distribution of cover time Phys. Rev. E 80 056105
75. Page L, Brin S, Motwani R and Winograd T 1999 The pagerank citation ranking: bringing order to the web Technical Report, Stanford Digital Libraries Technology Project 1998
76. Arenas A, Diaz-Guilera A and Guimerà R 2001 Communication in networks with hierarchical branching Phys. Rev. Lett. 86 3196 (Pubitemid 32317893)
77. Kim Y, Son S-W and Jeong H 2010 Finding communities in directed networks Phys. Rev. E 81 016103
78. Adamic L A, Lukose R M, Puniyani A R and Huberman B A 2001 Search in power-law networks Phys. Rev. E 64 046135
79. Guimerá R, Diza-Guilera A, Vega-Redondo F, Cabrales A and Arenas A 2002 Optimal network topologies for local search with congestion Phys. Rev. E 89 248701
80. Masuda N, Kawamura Y and Kori H 2009 Impact of hierarchical modular structure on ranking of individual nodes in directed networks New J. Phys. 11 113002
81. Kac M 1947 On the notion of recurrence in discrete stochastic processes Bull. Am. Math. Soc. 53 1002-10
82. Aldous D and Fill J 1999 (www.stat.berkeley.edu/∼aldous/RWG/book. html)
83. Kemeny J G and Snell T L 1960 Finite Markov Chains (Princeton, NJ: Van Nostrand-Reinhold)
84. Baronchelli A, Catanzaro M and Pastor-Satorras R 2008 Random walks on complex trees Phys. Rev. E 78 011114
85. Pandit S A and Amritkar R E 2001 Random spread on the family of small-world networks Phys. Rev. E 63 041104
86. Yurkevich I V, Lerner I V, Stepanenko A S and Constantinou C C 2006 Random walks in local dynamics of network losses Phys. Rev. E 74 046120 (Pubitemid 44684168)
87. Wang W-X, Wang B-H, Yin C-Y, Xie Y-B and Zhou T 2006 Traffic dynamics based on local routing and protocol on a scale-free network Phys. Rev. E 73 026111 (Pubitemid 43287713)
88. Servetto S and Barrenechea G 2002 Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks Proc. 1st ACM Int. Workshop on Wireless Sensor Networks and Applications pp 12-21
89. Pastor-Satorras R and Vespignani A 2001 Epidemic spreading in scale-free networks Phys. Rev. Lett. 86 3200 (Pubitemid 32317894)
90. Cohen R, Erez K, ben Avraham D and Halvin S 2000 Resilience of the internet to random breakdowns Phys. Rev. Lett. 85 4626 (Pubitemid 32024907)
91. Newman M E J 2002 Spread of epidemic disease on networks Phys. Rev. E 66 016128 (Pubitemid 40599061)
92. Murray J D 1993 Mathematical Biology (Berlin: Springer)
93. Kephart J O and White S R 1991 Directed-graph epidemiological models of computer viruses Proc. IEEE Computer Society Symp. on Research in Security and Privacy pp 343-59
94. Moore C and Newman M E J 2000 Epidemic and percolation in small world networks Phys. Rev. E 61 5678
95. Eguiluz V M and Klemn K 2002 Epidemic threshold in structured scale-free networks Phys. Rev. Lett. 89 108701
96. Boguná M and Pastor-Satorra R 2002 Epidemic spreading in correlated complex networks Phys. Rev. E 66 047104 (Pubitemid 40606348)
97. Castellano C and Pastor-Satorras R 2010 Thresholds for epidemic spreading in networks Phys. Rev. Lett. 205 218701
98. Wang Y, Chakrabarti D, Wang C and Faloutsos C 2003 Epidemic spreading in real networks: an eigenvalue viewpoint Proc. 22nd Int. Symp. on Reliable Distributed Systems pp 25-34 (Pubitemid 41554102)
99. Chung F, Lu L and Vu V 2003 Spectra of random graphs with given expected degrees Proc. Natl Acad. Sci. USA 100 6313 (Pubitemid 36666578)
100. Boguná M, Pastor-Satorras R and Vespignani A 2004 Cut-offs and finite size effects in scale-free networks Eur. Phys. J. B 38 205-9
101. Ebel H, Mielsch L-I and Bornholdt S 2002 Scale-free topology of e-mail networks Phys. Rev. E 66 035103 (Pubitemid 40618287)
102. Lerner E J 2003 What's wrong with the electric grid? Ind. Phys. 9 8-13
103. Motter A E and Lai Y-C 2002 Cascade-based attacks on complex networks Phys. Rev. E 66 065102 (Pubitemid 40606037)
104. Moreno Y, Pastor-Satorras R, Vázquez A and Vespignani A 2003 Critical load and congestion instabilities in scale-free networks Europhys. Lett. 62 292 (Pubitemid 36507910)
105. Motter A E 2004 Cascade control and defense in complex networks Phys. Rev. Lett. 93 098701
106. Gao J, Buldyrev S V, Havlin S and Stanley H E 2011 Robustness of a networks of network Phys. Rev. Lett. 107 195701
107. Buldyrev S V, Parshani R, Paul G, Stanley H E and Havlin S 2010 Catastrophic cascade of failures in interdependent networks Nature 464 1025-8
108. Vespignani A 2010 Complex networks: the fragility of interdependency Nature 464 984-5
109. Rosato V, Issacharoff L, Tiriticco F, Meloni S, Porcellinis S D and Setola R 2008 Modelling interdependent infrastructures using interacting dynamical models Int. J. Crit. Infrastruct. 4 63-79
110. Gao J, Buldyrev S V, Stanley H E and Havlin S 2012 Networks formed from interdependent networks Nature Phys. 8 40-8
111. Newman M E J, Strogatz S H and Watts D J 2001 Random graphs with arbitrary degree distributions and their applications Phys. Rev. E 64 026118
112. Shao J, Buldyrev S V, Braunstein L, Havlin S and Stanley H E 2009 Structure of shells in complex networks Phys. Rev. E 80 036105
113. Parshani R, Buldyrev S V and Havlin S 2010 Interdependent networks: reducing the coupling strength lead to a change from a first to second order percolation transition Phys. Rev. Lett. 105 048701
114. Brummitt C D, D'Souza R M and Leicht E A 2012 Suppressing cascades of load in interdependent networks Proc. Natl Acad. Sci. 109 4345-6
115. Edwards S F and Andersen P W 1975 Theory of spin glasses J. Phys. F: Met. Phys. 5 965-74
116. Sherrington D and Kirkpatrick S 1975 Solvable model of a spin-glass Phys. Rev. Lett. 5 1792-6
117. Viana L and Bray A J 1985 Phase diagrams for dilute spin glasses J. Phys. C: Solid State Phys. 18 3037-51
118. Kim D-H, Rodgers G J, Kahng B and Kim D 2005 Spin-glass phase transition on scale-free networks Phys. Rev. E 71 056115 (Pubitemid 41481003)
119. Nikoletopoulos T, Coolen A C C, Castillo I P, Skantzos N S, Hatchett J P L and Wemmenhove B 2004 Replicated transfer matrix analysis of Ising spin models on 'small world' lattices J. Phys. A: Math. Gen. 37 6455-75 (Pubitemid 38882801)
120. Riihijärvi J, Petrova M and Mähönen P 2005 Frequency allocation for WLANS using graph colouring techniques Proc. 2nd Annu. Conf. on Wireless On-Demand Network Systems and Services pp 216-22
121. Wong K Y M and Saad D 2008 Minimizing unsatisfaction in colourful neighbourhoods J. Phys. A: Math. Theor. 41 324023
122. Appel K and Haken W 1977 Every planar map is four colorable: part I. Discharging Illinois J. Math. 21 429
123. Appel K, Haken W and Koch J 1977 Every planar map is four colorable: part II. Reducibility Illinois J. Math. 21 491
124. Wu F Y 1982 The Potts model Rev. Mod. Phys. 54 235-68
125. van Mourik J and Saad D 2002 Random graph coloring: statistical physics approach Phys. Rev. E 66 056120 (Pubitemid 40618551)
126. Braunstein A, Mulet R, Pagnani A, Weigt M and Zecchina R 2003 Polynomial iterative algorithms for coloring and analyzing random graphs Phys. Rev. E 68 036702
127. Zdeborová L and Krzakala F 2007 Phase transitions in the coloring of random graphs Phys. Rev. E 76 031103 (Pubitemid 47507691)
128. Mulet R, Pagnani A, Weigt M and Zecchina R 2002 Coloring random graph Phys. Rev. Lett. 89 268701
129. Mézard M and Parisi G 2001 The Bethe lattice spin glass revisited Eur. Phys. J. B 20 217
130. Mézard M and Zecchina R 2002 Random k-satisfiability problem: from an analytic solution to an efficient algorithm Phys. Rev. E 66 056126 (Pubitemid 40618557)
131. Krzakala F and Kurchan J 2007 Landscape analysis of constraint satisfaction problems Phys. Rev. E 76 021122 (Pubitemid 47358015)
132. Krzakala F, Montanari A, Ricci-Tersenghi F, Semerjian G and Zdeborova L 2007 Gibbs states and the set of solutions of random constraint satisfaction problems Proc. Natl Acad. Sci. 104 10318-23 (Pubitemid 47185663)
133. Raymond J and Wong K Y M 2012 Next nearest neighbour Ising models on random graphs J. Stat. Mech. P09007
134. Wong K Y M and Saad D 2006 Equilibration through local information exchange in networks Phys. Rev. E 74 010104 (Pubitemid 44091284)
135. Wong K Y M and Saad D 2007 Inference and optimization of real edges on sparse graphs: a statistical physics perspective Phys. Rev. E 76 011115 (Pubitemid 47169173)
136. Yeung C H and Wong K Y M 2009 Phase transitions in transportation networks with nonlinearities Phys. Rev. E 80 021102
137. Yeung C H and Wong K Y M 2010 Optimal location of sources in transportation networks J. Stat. Mech. P04017
138. Yeung C H and Wong K Y M 2009 Optimal resource allocation in random networks with transportation bandwidths J. Stat. Mech. P03029
139. Yeung C H and Wong K Y M 2010 Self-organization of balanced nodes in random networks with transportation bandwidths Eur. Phys. J. B 74 227-33
140. Dantzig G B and Ramser J H 1959 The truck dispatching problem Manag. Sci. 6 80-91
141. Garey M R and Johnson D S 1979 Computers and Intractability: A Guide to the Theory of NP-Completeness (New York: Freeman)
142. Marinari E and Semerjian G 2006 On the number of circuits in random graphs J. Stat. Mech. P06019
143. Marinari E and Monasson R 2004 Circuits in random graphs: from local trees to global loops J. Stat. Mech. P09004
144. Mézard M and Parisi G 1986 A replica analysis of the travelling salesman problem J. Phys. 47 1285
145. Krauth W and Mezard M 1989 The cavity method and the travelling-salesman problem Europhys. Lett. 8 213-8
146. Bianconi G, Caldarelli G and Capocci A 2005 Loops structure of the internet at the autonomous system level Phys. Rev. E 71 066116 (Pubitemid 41663831)
147. Nod J D 2008 Loop statistics in complex networks Eur. Phys. J. B 66 251-7
148. Marinari E, Semerjian G and Kerrebroeck V V 2007 Finding long cycles in graphs Phys. Rev. E 75 066708 (Pubitemid 47143684)
149. Graham R L and Hell P 1985 On the history of the minimum spanning tree problem Ann. Hist. Comput. 7 43-57
150. Jackson T S and Read N 2010 Theory of minimum spanning trees: I. Mean-field theory and strongly disordered spin-glass model Phys. Rev. E 81 021130
151. Bohn S and Magnasco M O 2007 Structure, scaling, and phase transition in the optimal transport network Phys. Rev. Lett. 98 088702
152. Wu Z, Braunstein L A, Havlin S and Stanley H E 2006 Transport in weighted networks: partition into superhighways and roads Phys. Rev. Lett. 96 148702
153. Karp R M 1972 Reducibility among combinatorial problems Complexity of Computer Computations ed R E Miller and J W Thatcher (New York: Plenum) pp 85-103
154. Bayati M, Borgs C, Braunstein A, Chayes J, Ramezanpour A and Zecchina R 2008 Statistical mechanics of Steiner trees Phys. Rev. Lett. 101 037208
155. Bayati M, Braunstein A and Zecchina R 2008 A rigorous analysis of the cavity equations for the minimum spanning tree J. Math. Phys. 49 125206
156. Newman C M and Stein D L 1994 Spin-glass model with dimension-dependent ground state multiplicity Phys. Rev. Lett. 74 2286
157. Aldous D and Percus A G 2003 Scaling and universality in continuous length combinatorial optimization Proc. Natl Acad. Sci. USA 100 11211-5 (Pubitemid 37205914)
158. Iba Y 1999 The Nishimori line and Bayesian statistics J. Phys. A: Math. Gen. 32 3875-88
159. Opper M and Saad D 2001 Advanced Mean Field Methods - Theory and Practice (Cambridge, MA: MIT Press)
160. Pearl J 1982 Reverend Bayes on inferenced engines: a distributed hierarchical approach Proc. 2nd National Conf. on Artificial Intelligence (Pittsburg, USA,) pp 133-6 (Pubitemid 13512137)
161. Winn J and Bishop C M 2005 Variational message passing J. Mach. Learn. Res. 6 661-94
162. Gallager R G 1963 Low-Density Parity-Check Codes (Research Monograph Series vol 21) (Cambridge, MA: MIT Press)
163. Kabashima Y and Saad D 1998 Belief propagation versus tap for decoding corrupted messages Europhys. Lett. 44 668-74
164. Yedidia J S, Freeman W T and Weiss Y 2005 Constructing free-energy approximations and generalized belief propagation algorithms IEEE Trans. Inf. Theory 51 2282-312 (Pubitemid 41136394)
165. An G 1988 A note on the cluster variation method J. Stat. Phys. 52 727
166. Richardson T and Urbanke R 2008 Modern Coding Theory (Cambridge: Cambridge University Press)
167. Crick C and Pfeffer A 2003 Loopy belief propagation as a basis for communication in sensor networks Proc. 19th Conf. Annu. Conf. on Uncertainty in Artificial Intelligence p 159
168. Ihler A T and Moses R L 2005 Nonparametric belief propagation for self-localization of sensor networks J. Sel. Areas Commun. 23 809 (Pubitemid 40519635)
169. Donoho D L, Maleki A and Montanari A 2009 Message-passing algorithms for compressed sensing Proc. Natl Acad. Sci. USA 106 18914-9
170. Murphy K P, Weiss Y and Jordan M I 1999 Loopy belief propagation for approximate inference: an empirical study Proc. 15th Conf. on Uncertainty in Artificial Intelligence pp 467-75
171. Bethe H A 1935 Statistical theory of superlattices Proc. R. Soc. Lond. A 150 552-75
172. Yedidia J S, Freeman W T and Weiss Y 2001 Bethe free energy, Kikuchi approximations, and belief propagation algorithms Mitsubishi Electronic Research Laboratories Technical Report TR2001-16
173. Tanaka K and Morita T 1995 Cluster variation method and image restoration problem Phys. Lett. A 203 122-8
174. Montanari A and Rizzo T 2005 How to compute loop corrections to the Bethe approximation J. Stat. Mech. P10011
175. Xiao J-Q and Zhou H 2011 Partition function loop series for a general graphical model: free-energy corrections and message-passing equations J. Phys. A: Math. Theor. 44 425001
176. Mézard M, Parisi G and Zecchina R 2002 Analytic and algorithmic solution of random satisfiability problems Science 297 812 (Pubitemid 34839626)
177. Braunstein A, Mézard M and Zecchina R 2005 Survey propagation: an algorithm for satisfiability Random Struct. Algorithm 27 201-26 (Pubitemid 41482546)
178. Coates M, Pointurier Y and Rabbat M 2007 Compressed network monitoring for ip and all-optical networks Proc. 7th ACM SIGCOMM Conf. on Internet Measurement pp 241-52
179. Kabashima Y, Wadayama T and Tanaka T 2009 A typical reconstruction limit for compressed sensing based on lp -norm minimization J. Stat. Mech. L09003
180. Ganguli S and Sompolinsky H 2010 Statistical mechanics of compressed sensing Phys. Rev. Lett. 104 188701
181. Krzakala F, Mézard M, Sausset F, Sun Y F and Zdeborová L 2012 Statistical-physics-based reconstruction in compressed sensing Phys. Rev. X 2 021005
182. Kanso M A and Rabbat M G 2009 Compressed rf tomography for wireless sensor networks: centralized and decentralized approaches Proc. 5th IEEE Int. Conf. on Distributed Computing in Sensor Systems pp 173-86
183. Nikitaki S and Taskalides P 2011 Localization in wireless networks based on jointly compressed sensing Proc. 19th European Signal Processing Conf. pp 1809-13
184. Zeng H-L, Aurell E, Alava M and Mahmoudi H 2011 Network inference using asynchronously updated kinetic Ising model Phys. Rev. E 83 041135
185. Mézard M and Sakellariou J 2011 Exact mean field inference in asymmetric kinetic Ising model J. Stat. Mech. L07001
186. Willinger W, Govindan R, Jamin S, Paxson V and Shenker S 2002 Scaling phenomena in the internet: critically examining criticality Proc. Natl Acad. Sci. USA 99 2573 (Pubitemid 34165068)
187. Song C, Havlin S and Makse H A 2005 Self-similarity of complex networks Nature 433 392 (Pubitemid 40203314)