A new small world lattice

Abhishek Parakh, Subhash Kak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationAdvanced Computing, Networking and Security - International Conference, ADCONS 2011, Revised Selected Papers
Pages1-8
Number of pages8
DOIs
StatePublished - Apr 16 2012
EventInternational Conference on Advanced Computing, Networking and Security, ADCONS 2011 - Surathkal, India
Duration: Dec 16 2011Dec 18 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7135 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Advanced Computing, Networking and Security, ADCONS 2011
CountryIndia
CitySurathkal
Period12/16/1112/18/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A new small world lattice'. Together they form a unique fingerprint.

  • Cite this

    Parakh, A., & Kak, S. (2012). A new small world lattice. In Advanced Computing, Networking and Security - International Conference, ADCONS 2011, Revised Selected Papers (pp. 1-8). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7135 LNCS). https://doi.org/10.1007/978-3-642-29280-4_1