Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
1Activity

Table Of Contents

1.1 Discrete network models
1.1.1 The random tree
1.1.2 The random grid
1.2 Continuum network models
1.2.1 Poisson processes
1.2.2 Nearest neighbours networks
1.2.3 Poisson random connection networks
1.2.4 Boolean model networks
1.2.5 Interference limited networks
1.3 Information-theoretic networks
1.4 Historical notes and further reading
Phase transitions in infinite networks
2.1 The random tree; infinite growth
2.2 The random grid; discrete percolation
2.3 Dependencies
2.4 Nearest neighbours; continuum percolation
2.5 Random connection model
2.6 Boolean model
2.7 Interference limited networks
2.7.1 Mapping on a square lattice
2.7.2 Percolation on the square lattice
2.7.3 Percolation of the interference model
2.7.4 Bound on the percolation region
2.8 Historical notes and further reading
Connectivity of finite networks
3.2 The random grid
3.2.1 Almost connectivity
3.2.2 Full connectivity
3.3 Boolean model
3.3.1 Almost connectivity
3.3.2 Full connectivity
3.4 Nearest neighbours; full connectivity
3.5 Critical node lifetimes
3.6 A central limit theorem
3.7 Historical notes and further reading
More on phase transitions
4.1 Preliminaries: Harris-FKG Inequality
4.2 Uniqueness of the infinite cluster
4.3 Cluster size distribution and crossing paths
4.4 Threshold behaviour of fixed size networks
4.5 Historical notes and further reading
Information flow in random networks
5.1 Information-theoretical preliminaries
5.1.1 Channel capacity
5.1.2 Additive Gaussian channel
5.1.4 Information theoretic random networks
5.2 Scaling limits; single source-destination pair
5.3 Multiple source-destination pairs; lower bound
5.3.1 The highway
5.3.2 Capacity of the highway
5.3.3 Routing protocol
5.4.1 Exponential attenuation case
5.4.2 Power law attenuation case
5.5 Historical notes and further reading
Navigation in random networks
6.1 Highway discovery
6.2 Discrete short range percolation (large worlds)
6.3 Discrete long range percolation (small worlds)
0 of .
Results for:
No results containing your search query
P. 1
Random Networks for Communication

Random Networks for Communication

Ratings: (0)|Views: 757|Likes:
Published by Changliang Xie

More info:

Published by: Changliang Xie on Nov 28, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/28/2011

pdf

text

original

You're Reading a Free Preview
Pages 5 to 114 are not shown in this preview.
You're Reading a Free Preview
Pages 119 to 136 are not shown in this preview.
You're Reading a Free Preview
Pages 141 to 162 are not shown in this preview.
You're Reading a Free Preview
Pages 167 to 168 are not shown in this preview.
You're Reading a Free Preview
Pages 173 to 246 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->