Entropy and Energy of Substructures Obtained by Vertex Cutting in Regular Trees
|
 |
|
Post a Comment
|
|
|
|
|
CONTRIBUTORS:
|
|
|
CONFERENCE NAME:
|
|
|
CONF. LOCATION:
|
Plovdiv, Bulgaria
|
|
CONFERENCE YEAR:
|
2008
|
|
PUB TYPE:
|
Conference Presentation
|
|
SUBJECT(S):
|
informatics - applied; mathematics - modeling; mathematics - number theory; mathematics - statistics
|
|
DISCIPLINE:
|
Mathematics
|
|
HTTP:
|
http://lori.academicdirect.org/works/?f=197
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-445-897
(Last edited on
2008/10/17 02:42:24 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
The entropy (a quantitative measure of disorder in a system) and informational energy (informational disorder) of substructures obtained by cutting the vertex in regular trees was investigated and is presented. In a regular tree every vertex has the same number of children and leafs had no children at all. The information energy was defined as Energy = Ópi2, where pi = the probability of apparition of a substructure of i size. The entropy was defined as Entropy = pilog2pi, where pi has the signification described above. Regarding the entropy the following remarks can be done: (a) the entropy decrease with ramification; (b) the entropy increase with increasing of the number of levels; and (c) the decreasing with ramification is more accentuate compared with the increasing of the number of levels.
Regarding the information energy a decrease with the decrease of ramification and with the increase of number of levels was observed.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
3
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/200
|
|
|
|
|
|
|
| Prev |
Next |
|