Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
AAllen_Honors_paper.pdf (1005.13 KB)
ETD Abstract Container
Abstract Header
Average Shortest Path Length in a Novel Small-World Network
Author Info
Allen, Andrea J,
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1516362622694547
Abstract Details
Year and Degree
2017, BA, Oberlin College, Mathematics.
Abstract
We study a novel model of random graph which exhibits the structural characteristics of the Watts- Strogatz small-world network. The small-world network is characterized by a high level of local clustering while also having a relatively small graph diameter. The same behavior that makes the Watts-Strogatz model behave like this also makes it difficult to analyze. Our model addresses this issue, closely mimicking the same structure experimentally while following a constructive process that makes it easier to analyze mathematically. We present a bound on the average shortest path length in our new model, which we approach by looking at the two key geometric components.
Committee
Elizabeth L. Wilmer (Advisor)
Pages
21 p.
Subject Headings
Mathematics
Keywords
graph theory
;
random graph
;
network
;
small world network
;
watts-strogatz
;
shortest path
;
graph diameter
;
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Allen, , A. J. (2017).
Average Shortest Path Length in a Novel Small-World Network
[Undergraduate thesis, Oberlin College]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1516362622694547
APA Style (7th edition)
Allen, , Andrea.
Average Shortest Path Length in a Novel Small-World Network.
2017. Oberlin College, Undergraduate thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1516362622694547.
MLA Style (8th edition)
Allen, , Andrea. "Average Shortest Path Length in a Novel Small-World Network." Undergraduate thesis, Oberlin College, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1516362622694547
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
oberlin1516362622694547
Download Count:
3,034
Copyright Info
© 2017, all rights reserved.
This open access ETD is published by Oberlin College Honors Theses and OhioLINK.
Release 3.2.12