Random networks for communication: From statistical physics to information systems

Random Networks for Communication: From Statistical Physics to Information Systems

Volumn , Issue , 2008, Pages 1-196

  Franceschetti, Massimo ^a   Meester, Ronald ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84926098135     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511619632     Document Type: Book

References (92)

1. Aizenman, M., J. Chayes, L. Chayes, J. Frölich, L. Russo (1983). On a sharp transition from area law to perimeter law in a system of random surfaces. Communications in Mathematical Physics 92, 19-69.
2. Aizenman, M., H. Kesten, C. Newman (1987). Uniqueness of the infinite cluster and continuity of connectivity functions for short- and log-range percolation. Communications in Mathematical Physics 111, 505-32.
3. Alexander, K. (1991). Finite clusters in high density continuum percolation: compression and sphericality. Probability Theory and Related Fields 97, 35-63.
4. Angel, O., I. Benjamini, E. Ofek, U. Wieder (2005). Routing complexity of faulty networks. Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 209-17.
5. Antal, P., A. Pisztora (1996). On the chemical distance for supercritical Bernoulli percolation. Annals of Probability 24(2), 1036-48.
6. Arratia, R., L. Goldstein, L. Gordon (1989). Two moments suffice for Poisson approximations: the Chen-Stein method. Annals of Probability 17(1), 9-25.
7. Balister, P., B. Bollobás, A. Sarkar, M. Walters (2005). Connectivity of random k-nearest neighbour graphs. Advances in Applied Probability 37(1), 1-24.
8. Balister, P., B. Bollobás, M. Walters (2004). Continuum percolation with steps in an annulus. Annals of Applied Probabilty 14(4), 1869-79.
9. Barbour, A. D., L. Holst, S. Janson (1992). Poisson Approximation. Oxford: Clarendon Press.
10. Barlow, R., F. Proschan (1965). Mathematical Theory of Reliability. New York: John Wiley & Sons.
11. Berg, van den, R., H. Kesten (1985). Inequalities with applications to percolation and reliability. Journal of Applied Probability 22, 556-69.
12. Bollobás, B. (2001). Random Graphs. Cambridge: Cambridge University Press.
13. Bollobás, B., F. Chung (1988). The diameter of a cycle plus a random matching. SIAM Journal of Discrete Mathematics 1(3), 328-33.
14. Bollobás, B., O. Riordan (2006). Percolation. Cambridge: Cambridge University Press.
15. Booth, L., J. Bruck, M. Franceschetti, R. Meester (2003). Covering algorithms, continuum percolation, and the geometry of wireless networks. Annals of Applied Probability 13(2), 722-31.
16. Broadbent, S. R., J. M. Hammersley (1957). Percolation processes I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society, 53, 629-41.
17. Brug, van de, T. (2003). The Poisson random connection model: construction, central limit theorem and asymptotic connectivity. Master thesis, Vrije Universiteit Amsterdam.
18. Burton, R., M. Keane (1989). Density and uniqueness in percolation. Communications in Mathematical Physics 121, 501-5.
19. Camia, F., C. Newman (2007). Critical percolation exploration path and SLE6: a proof of convergence. Probability Theory and Related Fields. In press.
20. Chen, L. H. Y. (1975). Poisson approximation for dependent trials. Annals of Probability 3, 534-45.
21. Coppersmith, D., D. Gamarnik, M. Sviridenko (2002). The diameter of a long range percolation graph. Random Structures and Algorithms, 21(1), 1-13.
22. Cover, T., J. Thomas (2006). Elements of Information Theory. New York: John Wiley & Sons.
23. Cox, J., R. Durrett (1988). Limit theorems for spread out of epidemics and forest fires. Stochastic Processes and Their Applications 30, 171-91.
24. Daley, D., D. Vere-Jones (1988). An Introduction to the Theory of Point Processes. Berlin: Springer Verlag.
25. Dousse, O. (2005). Asymptotic properties of wireless multi-hop networks. Ph.D. thesis, École Polytechnique Fédérale de Lausanne.
26. Dousse, O., F. Baccelli, P. Thiran (2005). Impact of interferences on connectivity in ad-hoc networks. IEEE/ACM Transactions on Networking, 13(2), 425-36.
27. Dousse, O., M. Franceschetti, N. Macris, R. Meester, P. Thiran (2006). Percolation in the signal to interference ratio graph. Journal of Applied Probability 43(2), 552-62.
28. Dousse, O., M. Franceschetti, P. Thiran (2006). On the throughput scaling of wireless relay networks. IEEE Transactions on Information Theory 52(6), 2756-61.
29. Durrett, R. (2007). Random Graph Dynamics. Cambridge: Cambridge University Press.
30. Erdös, P., A. Rényi (1959). On random graphs. Publicationes Mathematicae Debrecen 6, 290-7.
31. Erdös, P., A. Rényi (1960). On the evolution of random graphs. Tudományos Akadémia Matematikai Kutató Intézetének Közleményei 5, 17-71.
32. Erdös, P., A. Rényi (1961). On the strength of connectedness of a random graph. Acta Mathematica Academiae Scientiarum Hungaricum 12, 261-7.
33. Fortuin, C., C. Kasteleyn, J. Ginibre (1971). Correlation inequalities on some partially ordered sets. Communications in Mathematical Physics 22, 89-103.
34. Franceschetti, M. (2007). A note on Lévéque and Telatar’s upper bound on the capacity of wireless ad-hoc networks. IEEE Transactions on Information Theory 53(9), 3207-11.
35. Franceschetti, M., L. Booth, M. Cook, R. Meester, J. Bruck (2005). Continuum percolation with unreliable and spread-out connections. Journal of Statistical Physics 118(3-4), 719-31.
36. Franceschetti, M., O. Dousse, D. Tse, P. Thiran (2007). Closing the gap in the capacity of wireless networks via percolation theory. IEEE Transactions on Information Theory 53(3), 1009-18.
37. Franceschetti, M., R. Meester (2006a). Critical node lifetimes in random networks via the Chen-Stein method. IEEE Transactions on Information Theory 52(6), 2831-7.
38. Franceschetti, M., R. Meester (2006b). Navigation in small world networks, a continuum, scale-free model. Journal of Applied Probability 43(4), 1173-80.
39. Friedgut, E., G. Kalai (1996). Every monotone graph property has a sharp threshold. Proceedings of the American Mathematical Society 124, 2993-3002.
40. Ganesh, A., M. Draief (2006). Efficient routing in Poisson small-world networks. Journal of Applied Probability 43(3), 678-86.
41. Gilbert, E. N. (1961). Random plane networks. Journal of SIAM 9, 533-43.
42. Goel, A., S. Rai, B. Krishnamachari (2005). Monotone properties of random geometric graphs have sharp thresholds. Annals of Applied Probability 15(4), 2535-52.
43. Gonzáles-Barrios, J. M., A. J. Quiroz (2003). A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree. Statistics and Probability Letters 62, 23-34.
44. Grimmett, G. (1999). Percolation. Berlin: Springer Verlag.
45. Grimmett, G., A. Stacey (1998). Critical probabilities for site and bond percolation models. Annals of Probability 26(4), 1788-1812.
46. Grimmett, G., D. Stirzaker (1992). Probability and Random Processes. Oxford: Oxford University Press.
47. Gupta, P., P. R. Kumar (1998). Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, eds. W. M. McEneaney, G. Yin, Q. Zhang. Boston: Birkhäuser, pp. 547-67.
48. Gupta, P., P. R. Kumar (2000). The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388-404.
49. Häggström, O., R. Meester (1996). Nearest neighbor and hard sphere models in continuum percolation. Random Structures and Algorithms 9(3), 295-315.
50. Harris, T. (1960). A lower bound on the critical probability of a certain percolation process. Proceedings of the Cambridge Philosophical Society 56, 13-20.
51. Harris, T. (1963). The Theory of Branching Processes. New York: Dover.
52. Kaklamanis, C., A. Karlin, F. Leighton, et al. (1990). Asymptotically tight bounds for computing with faulty arrays of processors. Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, 285-96.
53. Kesten, H. (1980). The critical probability of bond percolation on the square lattice equals 1/2. Communications in Mathematical Physics 74, 41-59.
54. Kesten, H. (1982). Percolation Theory for Mathematicians. Boston: Birkhäuser.
55. Kingman, J. (1992). Poisson Processes. Oxford: Clarendon Press.
56. Kleinberg, J. (2000). The small-world phenomenon: an algorithmic perspective. Proceedings of the 32nd ACM Symposium on the Theory of Computing, 163-70.
57. Lévêque, O., E. Telatar (2005). Information theoretic upper bounds on the capacity of large extended ad hoc wireless networks. IEEE Transactions on Information Theory 51(3), 858-65.
58. Liggett, T. M., R. H. Schonmann, A. M. Stacey (1997). Domination by product measures. Annals of Probability 25(1), 71-95.
59. McEliece, R. J. (2004). The Theory of Information and Coding. Cambridge: Cambridge University Press.
60. Meester, R., T. van de Brug (2004). On central limit theorems in the random connection model. Physica A 332, 263-78.
61. Meester, R., M. D. Penrose, A. Sarkar (1997). The random connection model in high dimensions. Statistics and Probability Letters 35, 145-53.
62. Meester, R., R. Roy (1994). Uniqueness of unbounded and vacant components in boolean models. Advances in Applied Probability 4(3), 933-51.
63. Meester, R., R. Roy (1996). Continuum Percolation. Cambridge: Cambridge University Press.
64. Moore, E., C. Shannon (1956). Reliable circuits using less reliable relays I, II. Journal of the Franklin Institute 262, 191-208, 281-97.
65. Nyquist, H. (1924). Certain factors affecting telegraph speed. Bell Systems Technical Journal 3, 324.
66. Özgür, A., O. Lévêque, D. Tse (2007). Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks. IEEE Transactions on Information Theory, 53(10), 3549-72.
67. Peierls, R. (1936). On Ising’s model of ferromagnetism. Proceedings of the Cambridge Philosophical Society 36, 477-81.
68. Penrose, M. D. (1991). On a continuum percolation model. Advances in Applied Probability 23(3), 536-56.
69. Penrose, M. D. (1993). On the spread-out limit for bond and continuum percolation. Annals of Applied Probability 3(1), 253-76.
70. Penrose, M. D. (1997). The longest edge of the random minimal spanning tree. Annals of Applied Probability 7(2), 340-61.
71. Penrose, M. D. (2003). Random Geometric Graphs. Oxford: Oxford University Press.
72. Penrose, M. D., A. Pisztora (1996). Large deviations for discrete and continuous percolation. Advances in Applied Probability 28(1), 29-52.
73. Roy, R., A. Sarkar (2003). High density asymptotics of the Poisson random connection model. Physica A 318, 230-42.
74. Russo, L. (1978). A note on percolation. Zeitschrift für Wahrscheinlichkeitstheorie Verwandte Gebiete 43, 39-48.
75. Russo, L. (1981). On the critical probabilities. Zeitschrift für Wahrscheinlichkeitstheorie Verwandte Gebiete 56, 229-37.
76. Russo, L. (1982). An approximate zero-one law. Zeitschrift für Wahrscheinlichkeitstheorie Verwandte Gebiete 61, 129-39.
77. Seymour, P. D., D. J. A. Welsh (1978). Percolation probabilities on the square lattice. In Advances in Graph Theory. Vol. 3 of Annals of Discrete Mathematics, ed. B. Bollobás. Amsterdam: North Holland, pp. 227-45.
78. Shannon, C. (1948). A mathematical theory of communication. Bell Systems Technical Journal 27, 379-423, 623-56. Reprinted as: The Mathematical Theory of Communication. Champaign: University of Illinois Press.
79. Smirnov, S. (2001). Critical percolation in the plane: conformal invariance, Cardy’s formula, scaling limits. Les Comptes Rendus de l’Académie des Sciences, Série I, Mathematique 333(3), 239-44.
80. Smirnov, S., W. Werner (2001). Critical exponents for two-dimensional percolation. Mathematical Research Letters 8, 729-44.
81. Stein, C. (1978). Asymptotic evaluation of the number of latin rectangles. Journal of Combinatorial Theory A 25, 38-49.
82. Talagrand, M. (1994). On Russo’s approximate zero-one law. Annals of Probability 22(3), 1576-87.
83. Telatar, E. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications 10(6), 585-95.
84. Watson, H., F. Galton (1874). On the probability of extinction of families. Journal of the Anthropology Institute of Great Britain and Ireland 4, 138-44.
85. Watts, D. J., S. H. Strogatz (1998). Collective dynamics of small-world networks. Nature 393, 440-2.
86. Wilson, R. J. (1979). Introduction to Graph Theory. London: Longman.
87. Xie, L. L., P. R. Kumar (2004). A network information theory for wireless communication: scaling laws and optimal operation. IEEE Transactions on Information Theory 50(5), 748-67.
88. Xue, F., P. R. Kumar (2004). The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10, 169-81.
89. Xue, F., L. L. Xie, P. R. Kumar (2005). The transport capacity of wireless networks over fading channels. IEEE Transactions on Information Theory, 51(3), 834-47.
90. Yukich, J. E. (2006). Ultra-small scale-free geometric networks. Journal of Applied Probability 43(3), 665-77.
91. Zhang, Y. (1988). Proof of Lemma 11.12. In G. Grimmett (1999), Percolation. Berlin: Springer Verlag.
92. Zong, C. (1998). The kissing number of convex bodies. A brief survey. Bulletin of the London Mathematical Society 30(1), 1-10.