You are here

Home » Content

SÜRÜCÜ DÜĞÜMLERIN ORANLARI IÇIN IKI HIPOTEZIN TEST EDILMESI

TESTING TWO HYPOTHESES FOR THE FRACTIONS OF DRIVER NODES

Journal Name:

  • Uluslararası Hakemli Akademik Sosyal Bilimler Dergisi

Publication Year:

  • 2017

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
Networks are used to represent complex systems in the real world. Recently, the focus of interest in the area of network science has shifted to the controllability of complex networks. In this context, the new concept of a subset of nodes called "driver nodes" is becoming pronounced in the network world. Driver nodes belong to the intersection of network science and the control theory of engineering. The growing interest in this field has resulted in an opportunity for scientists to explain how to control the dynamics of complex systems. The scope of this study is to directly test (1) the fractions of driver nodes' distributions of real networks and fully randomized networks and (2) the statistically significant difference in the mean fractions of driver nodes between natural and manmade networks and plus between natural and fully randomized networks. On the basis of the sample results, it is found that whereas real networks follow a largest extreme value distribution, fully randomized networks follow a gamma distribution. In addition, whereas a statistically significant difference was found between natural and manmade networks, no difference was found between natural and fully randomized networks.
Bookmark/Search this post with
Abstract (Original Language): 
Ağlar gerçek dünyadaki karmaşık sistemlerin temsil edilmesinde kullanılır. Yakın dönemde ağ bilimi alanındaki ilgi odağı karmaşık ağların kontrol edilebilirliğine yöneldi. Bu çerçevede, ağ dünyasında yeni bir kavram düğümlerin alt kümesi olarak adlandırılan "sürücü düğümler" telaffuz edilmeye başlandı. Sürücü düğümler ağ bilimi ve mühendisliğin kontrol teorisi ile ilgilidir. Bu alana artan ilgi bilim adamlarına karmaşık dinamik sistemlerin nasıl kontrol edileceğinin izah edilmesine olanak tanıdı. Bu çalışmanın kapsamı (1) gerçek ağların ve tam rassallaşmış ağların sürücü düğümlerinin oranlarının dağılımlarının ve (2) doğal ve insan yapımı ağlar arasında ve ayrıca doğal ve tam rassallaşmış ağlar arasında sürücü düğümlerin ortalama oranlarının istatistiksel anlamlı farklılığının doğrudan test edilmesidir. Örneklem sonuçlarına göre, gerçek ağlar en büyük ekstrem değer dağılımı izlerken, tam rassallaşmış ağlar bir gama dağılımı izlemektedir. Ayrıca, doğal ve insan yapısı ağlar arasında istatistiksel bir anlamlı farklılık bulunurken, doğal ve tam rassallaşmış ağlar arasında bir fark bulunmamıştır.
FULL TEXT (PDF): 
PDF icon arastirmax-surucu-dugumlerin-oranlari-icin-iki-hipotezin-test-edilmesi.pdf
  • 59
221
234
  • Turkish

REFERENCES

References: 

Asgari Yazdan, Ali Salehzadeh-Yazdi, Falk Schreiber and Ali Masoudi-Nejad, (2013),
"Controllability in Cancer Metabolic Networks According to Drug Targets as Driver
Nodes", PLOS ONE, Vol. 8, Issue 11, pp. 1-12. Banerjee Abhijit, Arun G. Chandrasekhar, Esther Duflo and Matthew O. Jackson, (2014),
"Gossip: Identifying Central Individuals in a Social Network", MIT Department of
Economics Working Paper, No. 14-15, pp. 1-30. Banerjee Soumya Jyoti and Soumen Roy, (2012), "Key to Network Controllability",
(Accessed on 22 th of June 2015 via http://arxiv.org/pdf/1209.3737.pdf). Bayer Web Site, , (Accessed on 25 th of June 2015 via http://www.bayer.com/). Delpini Danilo, Stefano Battiston, Massimo Riccaboni, Giampaolo Gabbi, Fabio Pammolli
and Guido Caldarelli, (2013), "Evolution of Controllability in Interbank Networks",
Scientific Reports, 3: 1626. Gao Jianxi, Yang-Yu Liu, Raissa M. D'souza and Albert Laszlo Barabari, (2014), "Target
control of complex networks", Nature Communications, Vol. 5, No. 5415, pp. 1-8. Inside-R web (Accessed on 22 th of June 2015 vie http://www.inside-r.org/). Jia Tao and Barabasi, (2013), "Control Capacity and A Random Sampling Method in
Exploring Controllability of Complex Networks", Scientific Reports 3, No. 2354, pp.
1-6.
Khazanchi Rohan, (2014), "On Identifying and Analyzing Significant Nodes in Protein-Protein Interaction Networks", Washington University Undergraduate Research
Digest, Vol. 9, Issue 2, pp. 17-28.
Kumar Arvind, Ioannis Vlachos, Ad Aertsen and Clemens Boucsein, (2013), "Challenges of
understanding brain function by selective modulation of neuronal subpopulations",
Trends Neurosci, Vol. 36, No. 10, pp. 579-586. Liu Yang Yu, (2014), "Theoretical progress and practical challenges in controlling complex
networks", National Science Review, Vol. 1, No. 3, pp. 341-343. Liu Yang Yu, Jean-Jacques Slotine and Albert Laszlo Barabasi, (2011), "Controllability of
complex networks", NATURE, Vol. 473, pp. 167-173. Subelj Lovro and Marko Bajec's, (2012), Software Systems through Complex Networks
Science: Review, Analysis and Applications, (Accessed on 22 th of June 2015 via
http://arxiv.org/abs/1208.2518).
233
AKADEMİK BAKIŞ DERGiSi
Sayı: 59 Ocak - Şubat 2017 Uluslararası Hakemli Sosyal Bilimler E-Dergisi
ISSN:1694-528X İktisat ve Girişimcilik Üniversitesi, Türk Dünyası
Kırgız - Türk Sosyal Bilimler Enstitüsü, Celalabat - KIRGIZİSTAN
http://www.akademikbakis.org
Mahia Ram Niwash, Deepak Fulwani and Mahaveer Singh, (2014), Characterization of Driver Nodes of Anti-Stable Networks, (Accessed on 22 th of June 2015 via http://arxiv.org/pdf/1410.3251v1.pdf).
Menichetti Giulia, Luca Dall'Asta and Ginestra Bianconi, (2014), "Network Controllability Is Determined by the Density of Low In-Degree and Out-Degree Nodes", Phys. Rev. Lett., Vol 113, Issue 7, 078701, pp.1-5.
Mones Enys, Lilla Vicsek and Tamas Vicsek, (2012), "Hierarch Measure for Complex Networks", PLOS ONE, Vol. 7, Issue 3, pp. 1-10.
Nikolopoulos Stavros D. and Leonidas Palios, (2005), "Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching". In Editors Panayiotis Bozanis and Elias N. Houtis, Advances in Informatics, 10 th Panhellenic Conference on Informatics, PCI 2005 Volos, Greece, November 2005 Proceedings, Springer, pp. 68-79.
Rathore Tapish, Siva Pratheek, Srikanth M. and Ganesh Bagler, (2015), "Study on Controllability of Complex Networks", Simon Fraser University, Report (Accessed on 22 th of June 2015 via http://www.sfu.ca/~smuralid/papers/Report.pdf).
Sabattini Lorenzo, Cristian Secchi and Cesare Fantuzzi, (2014), "Controllability and Observability Preservation for Networked Systems with Time Varying Topologies", Preprints of the 19th World Congress, The International Federation of Automatic Control, Cape Town, South Africa, August 24-25, pp. 1837-1842.
Trafton Anne, (2011), "How to control complex networks: New algorithm offers ability to influence systems such as living cells or social networks", MIT News Office. (Accessed on 22 th of June 2015 via http://newsoffice.mit.edu/2011/network-control-0512).
Wang Bingbo, Lin Gao and Yong Gao, (2012), "Control range: a controllability-based index for node significance in directed networks", Journal of Statistical Mechanics: Theory
and Experiment, P04011, pp. 1-22.
Yazıcıoğlu A. Yasin
an
d Magnus Egerstedt, (2013), "Leader Selection and Network Assembly for Controllability of Leader-Follower Networks", American Control Conference (ACC), Washington, DC, USA, June 17-19, pp. 3802-3807.
Yuan Zhengzhong, Chen Zhao, Zengru Dİ, Wen-Xu Wang and Ying-Cheng Lai, (2013), "Exact controllability of complex networks", Nature Communications, Vol. 4, No.
2447, pp. 1-9.
Zhang Xizhe, Tianyang Lv, Xue Ying Yang and Bin Zhang, (2014), "Structural Controllability of Complex Networks Based on Preferential Matching", PLOS ONE, Vol. 9, Issue 11, pp. 1-8.
234

Thank you for copying data from http://www.arastirmax.com