scholarly journals Organizational and Formational Structures of Networks in the Mental Lexicon: A State-Of-The-Art through Systematic Review

Languages ◽  
2019 ◽  
Vol 5 (1) ◽  
pp. 1
Author(s):  
Luke McCarthy ◽  
Imma Miralpeix

This state-of-the-art presents a systematic exploration on the use of network patterns in global research efforts to understand, organize and represent the mental lexicon. Results have shown an increase over recent years in the usage of complex, small-world and scale-free network patterns within the literature. With the increasing complexity of network patterns, we see more potential in the inter-disciplinary exploration of the mental lexicon through universal and mathematically-describable, behavioral patterns in small-world and scale-free networks. A systematic review of 36 items of methodologically-selected literature serve as a means to explore how the greater literary body understands network structures within the mental lexicon. Network-based approaches are discriminated between three contrasting varieties. These include: ‘simple networks’, characterized by arbitrarily organized graph patterns of metaphorical importance; ‘connectionist networks’, a broad category of networks which explore the structural features of a system through the analysis of emergent properties; and lastly ‘complex networks’, distinguished as small-world, scale-free networks which follow a strict and mathematically-describable structure in agreement with the Barabási–Albert model. Each network approach is explored in terms of their discernible differences which relate to their parameters and affect their implications. A final evaluation of observed patterns within the selected literature is offered, as well as an elaboration on the sense of trajectory beheld in the research in order to offer insight and orientation for future research.

2008 ◽  
Vol 22 (05) ◽  
pp. 553-560 ◽  
Author(s):  
WU-JIE YUAN ◽  
XIAO-SHU LUO ◽  
PIN-QUN JIANG ◽  
BING-HONG WANG ◽  
JIN-QING FANG

When being constructed, complex dynamical networks can lose stability in the sense of Lyapunov (i. s. L.) due to positive feedback. Thus, there is much important worthiness in the theory and applications of complex dynamical networks to study the stability. In this paper, according to dissipative system criteria, we give the stability condition in general complex dynamical networks, especially, in NW small-world and BA scale-free networks. The results of theoretical analysis and numerical simulation show that the stability i. s. L. depends on the maximal connectivity of the network. Finally, we show a numerical example to verify our theoretical results.


2018 ◽  
Vol 8 (5) ◽  
pp. 529-546
Author(s):  
Christofer Laurell ◽  
Sten Soderman

PurposeThe purpose of this paper is to provide a systematic review of articles on sport published in leading business studies journals within marketing, organisational studies and strategy.Design/methodology/approachBased on a review of 38 identified articles within the subfields of marketing, strategy and organisation studies published between 2000 and 2015, the articles’ topical, theoretical and methodological orientation within the studied subfields were analysed followed by a cross-subfield analysis.FindingsThe authors identify considerable differences in topical, theoretical and methodological orientation among the studied subfields’ associated articles. Overall, the authors also find that articles across all subfields tend to be focussed on contributing to mature theory, even though the subfield of marketing in particular exhibits contributions to nascent theory in contrast to organisation studies and strategy.Originality/valueThis paper contributes by illustrating the current state of research that is devoted or related to the phenomenon of sport within three subfields in business studies. Furthermore, the authors discuss the role played by leading business studies journalsvis-à-vissport sector-specific journals and offer avenues for future research.


2021 ◽  
Vol 17 (1) ◽  
pp. 97-122
Author(s):  
Mohamed Hassan Mohamed Ali ◽  
Said Fathalla ◽  
Mohamed Kholief ◽  
Yasser Fouad Hassan

Ontologies, as semantic knowledge representation, have a crucial role in various information systems. The main pitfall of manually building ontologies is effort and time-consuming. Ontology learning is a key solution. Learning Non-Taxonomic Relationships of Ontologies (LNTRO) is the process of automatic/semi-automatic extraction of all possible relationships between concepts in a specific domain, except the hierarchal relations. Most of the research works focused on the extraction of concepts and taxonomic relations in the ontology learning process. This article presents the results of a systematic review of the state-of-the-art approaches for LNTRO. Sixteen approaches have been described and qualitatively analyzed. The solutions they provide are discussed along with their respective positive and negative aspects. The goal is to provide researchers in this area a comprehensive understanding of the drawbacks of the existing work, thereby encouraging further improvement of the research work in this area. Furthermore, this article proposes a set of recommendations for future research.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 76541-76567 ◽  
Author(s):  
Muktar Yahuza ◽  
Mohd Yamani Idna Bin Idris ◽  
Ainuddin Wahid Bin Abdul Wahab ◽  
Anthony T. S. Ho ◽  
Suleman Khan ◽  
...  

2006 ◽  
Vol 20 (27) ◽  
pp. 1755-1761 ◽  
Author(s):  
BAIBAI FU ◽  
ZIYOU GAO ◽  
FASHENG LIU ◽  
XIANJUAN KONG

An express highway itself is not a scale-free network, while the Express Passenger Transport System (EPTS) on the express highway network has the properties of a small-world and scale-free network. Data analysis based on the observation of the EPTS in Shandong province, China, shows that the EPTS has the properties of scale-free networks and the power exponent λ of the distribution is equal to about 2.1. Based on the scale-free network topology structure of the EPTS network, the construction of the EPTS network will be more efficient and robust.


Author(s):  
P. A. Whigham ◽  
G. Dick ◽  
M. Parry

Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440–442. ( doi:10.1038/30918 )). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.


2015 ◽  
Vol 26 (05) ◽  
pp. 1550052 ◽  
Author(s):  
Lei Wang ◽  
Ping Wang

In this paper, we attempt to understand the propagation and stability feature of large-scale complex software from the perspective of complex networks. Specifically, we introduced the concept of "propagation scope" to investigate the problem of change propagation in complex software. Although many complex software networks exhibit clear "small-world" and "scale-free" features, we found that the propagation scope of complex software networks is much lower than that of small-world networks and scale-free networks. Furthermore, because the design of complex software always obeys the principles of software engineering, we introduced the concept of "edge instability" to quantify the structural difference among complex software networks, small-world networks and scale-free networks. We discovered that the edge instability distribution of complex software networks is different from that of small-world networks and scale-free networks. We also found a typical structure that contributes to the edge instability distribution of complex software networks. Finally, we uncovered the correlation between propagation scope and edge instability in complex networks by eliminating the edges with different instability ranges.


Author(s):  
Graziano Vernizzi ◽  
Henri Orland

This article deals with complex networks, and in particular small world and scale free networks. Various networks exhibit the small world phenomenon, including social networks and gene expression networks. The local ordering property of small world networks is typically associated with regular networks such as a 2D square lattice. The small world phenomenon can be observed in most scale free networks, but few small world networks are scale free. The article first provides a brief background on small world networks and two models of scale free graphs before describing the replica method and how it can be applied to calculate the spectral densities of the adjacency matrix and Laplacian matrix of a scale free network. It then shows how the effective medium approximation can be used to treat networks with finite mean degree and concludes with a discussion of the local properties of random matrices associated with complex networks.


Sign in / Sign up

Export Citation Format

Share Document