A new small world lattice

Authors:
Abhishek Parakh;Subhash Kak
Affiliations:
College of Information Science and Technology, University of Nebraska at Omaha, Omaha, NE;Computer Science Department, Oklahoma State University, Stillwater, OK
Venue:
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Year:
2011

Citing 5
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
MEK: Using spatial-temporal information to improve social networks and knowledge dissemination

Information Sciences: an International Journal
The SocialTrust framework for trusted social information management: Architecture and algorithms

Information Sciences: an International Journal
Minimizing the expected complete influence time of a social network

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.