Learning about knowledge: A complex network approach
Journal Article
·
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
- Instituto de Fisica de Sao Carlos. Universidade de Sao Paulo, Sao Carlos, SP, P.O. Box 369, 13560-970 (Brazil)
An approach to modeling knowledge acquisition in terms of walks along complex networks is described. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks--i.e., networks composed of successive interconnected layers--are related to compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks--i.e., unreachable nodes--the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barabasi-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaus of knowledge stagnation in the case of the preferential movement strategy in the presence of conditional edges.
- OSTI ID:
- 20860799
- Journal Information:
- Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, Journal Name: Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics Journal Issue: 2 Vol. 74; ISSN PLEEE8; ISSN 1063-651X
- Country of Publication:
- United States
- Language:
- English
Similar Records
Evolving network with different edges
Maximal planar networks with large clustering coefficient and power-law degree distribution
Markov chain-based numerical method for degree distributions of growing networks
Journal Article
·
Mon Oct 15 00:00:00 EDT 2007
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
·
OSTI ID:21076249
Maximal planar networks with large clustering coefficient and power-law degree distribution
Journal Article
·
Thu Mar 31 23:00:00 EST 2005
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
·
OSTI ID:20641420
Markov chain-based numerical method for degree distributions of growing networks
Journal Article
·
Mon Feb 28 23:00:00 EST 2005
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
·
OSTI ID:20641379