• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • 1
    CommentGo Back
Download
 
Starants II
M.R.Pinheiro
1
Abstract
Building on the work of Comellas et al. regarding Deterministic Small-World Networks and extending the results of Pinheiro’s work, we getto give scientific reasons both for and against the Six Degree of Separa-tion Theory. In this paper, we prove that in considering people, alongwith their circle of acquaintances, as mathematical objects there mightbe, for
n 
people, either a connection so strong as to be mathematicallytreated as
3 
degrees of separation or so weak as to be mathematicallytreated as
3(n-1)
degrees of separation. As a plus, we re-word thesection on notation and definitions, as well as the introduction, fromour paper with the AMC journal in order to eliminate mathematicalimperfections.Key-words: Small-world, communication networks, networks, combi-natorial problems.AMS: 05C12.
1 Introduction
Deterministic small-world communication networks have been introduced byComellas, Ozon and Peters in [1]. They are supposed to have strong localclustering ( nodes have many neighbors in common ), small diameter ( largestof the shortest distances between nodes must be small ) and would be locatedbetween Regular Lattices
2
, which are highly clustered, large worlds, wherethe diameter, or characteristic path length, grows linearly with the numberof nodes, and Random Networks, which are poorly clustered, small worlds,where the diameter grows logarithmically with the number of nodes.
1
E-mail: mrpprofessional@yahoo.com. Address: Po Box 12396, A’Beckett st, Mel-bourne, VIC, AU, 8006. Obs.: The research results contained in this paper were obtainedin full by the year of 2004.
2
It is obviously the case that this concept of lattice must be a more graphical concept,having to do with something else, other than Algebra, once the algebraic concept, welldescribed in [3], does not have much to do with what Comellas writes about. On the otherhand, [4] brings a broader sense, obviously allowed in language, which must be the onereferred to by Comellas.
1
 
Circulant graphs are frequently found associated to the deterministic small-world communication networks, once they, so far, seem to serve better thedescriptive needs of those networks than the other sort of graphs do.In this paper, we want to contribute to Duncan et al.’s findings ([10]) byproposing mathematical analytical tools which are suitable to deal with theirtheory and their new results or to at least measure their accuracy. Our previ-ous results ([9]) brought constraints and mathematical symbology to Comel-las et al.’s work, which we mention partially in the next subsection.Our sequence of presentation will be:
•
Notation & some definitions which are currently found in the specializedliterature;
•
Quick remarks on connectivity, accessibility, and spreadability, refer-ring to the text [2];
•
Application of the theory for cycles to our theory;
•
Definitions introduced by this paper along with justification for theircreation;
•
New results;
•
Remarks of weight regarding Duncan et al.’s works;
•
Conclusion;
•
References.
1.1 Notation & some definitions
1.
C 
n,δ
- circulant graph of 
n
nodes and
δ
( degree ) links per node suchthat each node
i
is adjacent to nodes (
i
±
1), (
i
±
2)
,...,
(
i
±
δ
2
(
mod n
)).This graph has got diameter
D
=
nδ
.2. Star graph - rooted tree containing
n
nodes, one of them located in thecenter of the tree ( root ) and having degree
(n-1)
, and all other nodesbeing connected solely to the root in the tree.3. Complete graph on
n 
nodes - graph where every node has got degree
(n-1)
.2
 
4. Hub - graph added to a previous graph structure in order to connectit with another graph structure. As a rule, whenever we use the word‘hub’ we actually mean one
K 
2
graph in this paper.5.
S 
C n,δ
- string of 
n
circulant graphs connected by means of 
K 
2
graphs,inserted exactly
δ
times for each circulant graph added ( taking awaythe first and the last graph on the string which will use
K 
2
graphsexactly
δ
2
times to make the connections ). No root ever appears asa vertex of a hub in this sort of graph. The first connection we makeby means of a
K 
2
graph should depart from the most extreme vertexin each graph in relation to the last chosen hub, as for each circulantgraph added. If there are two most extreme vertices to choose from,as it will happen in case our
n
is an odd number, we choose the mostaesthetical option regarding regularity.6.
C 
C n,δ
- circle of 
n
circulant graphs connected by means of 
K 
2
graphsinserted exactly
δ
times for each graph added. No root ever appearsas a vertex of a hub in this sort of graph.The first connection we makeby means of a
K 
2
graph should depart from the most extreme vertexin each graph in relation to the last chosen hub, as for each circulantgraph added. If there are two most extreme vertices to choose from,as it will happen in case our
n
is an odd number, we choose the mostaesthetical option regarding regularity.7.
S 
C n
- string of 
n
circulant graphs connected by means of 
K 
2
graphsinserted as many times as we like for each circulant graph added. Noroot ever appears as a vertex of a hub in this sort of graph. The firstconnection we make by means of a
K 
2
graph should depart from themost extreme vertex in each graph in relation to the last chosen hub, asfor each circulant graph added. If there are two most extreme verticesto choose from, as it will happen in case our
n
is an odd number, wechoose the most aesthetical option regarding regularity.8.
C 
C n
- circle of 
n
circulant graphs connected by means of 
K 
2
graphsinserted as many times as we like for each circulant graph added. Noroot ever appears as a vertex of a hub in this sort of graph. The firstconnection we make by means of a
K 
2
graph should depart from themost extreme vertex in each graph in relation to the last chosen hub, asfor each circulant graph added. If there are two most extreme vertices3
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...

uploaded a new revision for this document (#8)

11 / 06 / 2009
You must be to leave a comment.
Submit
Characters: ...