A New Small World Lattice
This paper considers a scalable lattice that may be used to generate models of random small world networks. We describe its properties and investigate its robustness to random node failures. We also define group and reachability coefficients to characterize the properties of the network. Simulation results are presented that show that the new coefficients well describe a social network.
KeywordsSocial Network Random Network Small World Small World Network Link Failure
Unable to display preview. Download preview PDF.
- 4.Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)Google Scholar
- 7.Parakh, A., Kak, S.: A key distribution scheme for sensor networks using structured graphs. In: International Conference on Emerging Trends in Electronic and Photonic Devices Systems, ELECTRO 2009, pp. 10–13 (December 2009)Google Scholar
- 8.Parakh, A., Kak, S.: Efficient key management in sensor networks. In: 2010 IEEE GLOBECOM Workshops (GC Wkshps), pp. 1539–1544 (December 2010)Google Scholar