Improving dynamics of integer-order small-world network models under fractional-order PD control

2019 ◽  
Vol 63 (1) ◽  
Author(s):  
Huaifei Wang ◽  
Min Xiao ◽  
Binbin Tao ◽  
Fengyu Xu ◽  
Zhengxin Wang ◽  
...  
2021 ◽  
Vol 1 (1) ◽  
Author(s):  
Alexander P. Christensen ◽  

The nature of associations between variables is important for constructing theory about psychological phenomena. In the last decade, this topic has received renewed interest with the introduction of psychometric network models. In psychology, network models are often contrasted with latent variable (e.g., factor) models. Recent research has shown that differences between the two tend to be more substantive than statistical. One recently developed algorithm called the Loadings Comparison Test (LCT) was developed to predict whether data were generated from a factor or small-world network model. A significant limitation of the current LCT implementation is that it's based on heuristics that were derived from descriptive statistics. In the present study, we used artificial neural networks to replace these heuristics and develop a more robust and generalizable algorithm. We performed a Monte Carlo simulation study that compared neural networks to the original LCT algorithm as well as logistic regression models that were trained on the same data. We found that the neural networks performed as well as or better than both methods for predicting whether data were generated from a factor, small-world network, or random network model. Although the neural networks were trained on small-world networks, we show that they can reliably predict the data-generating model of random networks, demonstrating generalizability beyond the trained data. We echo the call for more formal theories about the relations between variables and discuss the role of the LCT in this process.


2009 ◽  
Vol 178 (1) ◽  
pp. 173-200 ◽  
Author(s):  
I. T. Vieira ◽  
R. C. H. Cheng ◽  
P. R. Harper ◽  
V. de Senna

2017 ◽  
Vol 354 (17) ◽  
pp. 7643-7667 ◽  
Author(s):  
Min Xiao ◽  
Wei Xing Zheng ◽  
Jinxing Lin ◽  
Guoping Jiang ◽  
Lindu Zhao ◽  
...  

2014 ◽  
Vol 28 (27) ◽  
pp. 1450211 ◽  
Author(s):  
Hao Zhang ◽  
Di-Yi Chen ◽  
Bei-Bei Xu ◽  
Run-Fan Zhang

This paper is a step forward to generalize the fundamentals of the conventional controllability in fractional-order complex networks. First, we discuss the existence of controllability theory of fractional-order complex networks. Furthermore, we propose stringent mathematical expression and controllable proof of fractional complex networks. Finally, three typical examples from the simplest network, the chain fractional-order network, to the Small-World network are presented to validate the correctness of the above theorem.


Sign in / Sign up

Export Citation Format

Share Document