A new small world lattice

Abhishek Parakh; Subhash Kak

doi:10.1007/978-3-642-29280-4_1

A new small world lattice

Abhishek Parakh, Subhash Kak

Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Advanced Computing, Networking and Security - International Conference, ADCONS 2011, Revised Selected Papers
Pages	1-8
Number of pages	8
DOIs	https://doi.org/10.1007/978-3-642-29280-4_1
State	Published - 2012
Event	International Conference on Advanced Computing, Networking and Security, ADCONS 2011 - Surathkal, India Duration: Dec 16 2011 → Dec 18 2011

Publication series

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

Conference

Conference	International Conference on Advanced Computing, Networking and Security, ADCONS 2011
Country	India
City	Surathkal
Period	12/16/11 → 12/18/11

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-29280-4_1

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

A new small world lattice. / Parakh, Abhishek; Kak, Subhash.

Advanced Computing, Networking and Security - International Conference, ADCONS 2011, Revised Selected Papers. 2012. p. 1-8 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7135 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

@inproceedings{2180a7d6adae491a8b1c883630723da8,

title = "A new small world lattice",

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.",

author = "Abhishek Parakh and Subhash Kak",

year = "2012",

doi = "10.1007/978-3-642-29280-4_1",

language = "English (US)",

isbn = "9783642292798",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1--8",

booktitle = "Advanced Computing, Networking and Security - International Conference, ADCONS 2011, Revised Selected Papers",

note = "International Conference on Advanced Computing, Networking and Security, ADCONS 2011 ; Conference date: 16-12-2011 Through 18-12-2011",

}

TY - GEN

T1 - A new small world lattice

AU - Parakh, Abhishek

AU - Kak, Subhash

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84859585351&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859585351&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-29280-4_1

DO - 10.1007/978-3-642-29280-4_1

M3 - Conference contribution

AN - SCOPUS:84859585351

SN - 9783642292798

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 8

BT - Advanced Computing, Networking and Security - International Conference, ADCONS 2011, Revised Selected Papers

T2 - International Conference on Advanced Computing, Networking and Security, ADCONS 2011

Y2 - 16 December 2011 through 18 December 2011

ER -