<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article  article-type="research-article"        dtd-version="1.4">
            <front>

                <journal-meta>
                                    <journal-id></journal-id>
            <journal-title-group>
                                                                                    <journal-title>Mugla Journal of Science and Technology</journal-title>
            </journal-title-group>
                            <issn pub-type="ppub">2149-3596</issn>
                                                                                                        <publisher>
                    <publisher-name>Mugla Sitki Kocman University</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id pub-id-type="doi">10.22531/muglajsci.348054</article-id>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Engineering</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Mühendislik</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                        <trans-title-group xml:lang="tr">
                                    <trans-title>BORSA AĞLARININ TOPLULUKLARI İÇİN YENİ BİR TOPOLOJİK ÖLÇÜM</trans-title>
                                </trans-title-group>
                                                                                                                                                                                                <article-title>A NEW TOPOLOGICAL MEASURE FOR THE COMMUNITIES OF STOCK MARKET NETWORKS</article-title>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                <name>
                                    <surname>Akgüller</surname>
                                    <given-names>Ömer</given-names>
                                </name>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                <name>
                                    <surname>Öcal</surname>
                                    <given-names>Sinem</given-names>
                                </name>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                <name>
                                    <surname>Balcı</surname>
                                    <given-names>Mehmet Ali</given-names>
                                </name>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20171224">
                    <day>12</day>
                    <month>24</month>
                    <year>2017</year>
                </pub-date>
                                        <volume>3</volume>
                                        <issue>2</issue>
                                        <fpage>104</fpage>
                                        <lpage>109</lpage>
                        
                        <history>
                                    <date date-type="received" iso-8601-date="20171031">
                        <day>10</day>
                        <month>31</month>
                        <year>2017</year>
                    </date>
                                                    <date date-type="accepted" iso-8601-date="20171117">
                        <day>11</day>
                        <month>17</month>
                        <year>2017</year>
                    </date>
                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2015, Mugla Journal of Science and Technology</copyright-statement>
                    <copyright-year>2015</copyright-year>
                    <copyright-holder>Mugla Journal of Science and Technology</copyright-holder>
                </permissions>
            
                                                                                                <trans-abstract xml:lang="tr">
                            <p>Gıda ağları, bilimsel alıntılar, sosyal ağlar,haberleşme ağları, Internet ve borsa ağları gibi interaktif aktörleri içerensistemler, karmaşık sistemlerin içeriği kapsamı altında pek çok araştırmacıtarafından incelenmiştir. Bu tür sistemler ağırlıklı ağlar tarafından temsiledilir. Aktörler arasındaki yoğun bağlantılar ve ilişkiler, tahmin veya riskanalizinde önemli bir rol oynamaktadır. Bu çalışmada, aktif küresel borsaağının hiyerarşik yapısını ölçmek için yeni bir yaklaşım önerilmiştir.Önerdiğimiz bu yaklaşımda, 21 farklı dünya borsa piyasalarının birbirleriyleilişkisi Pearson ilişkileri tarafından belirlenmektedir. İlgili hisse senediağı belli bir eşik değerine dayanmaktadır. Aynı zamanda, borsa graftopluluklarının tepelerinin etkileşimini karakterize etmek için yeni birtopolojik ölçüm kullanılmaktadır ve bu ölçü 2008 yılı küresel ekonomik krizinzaman dilimleri için incelenmektedir.</p></trans-abstract>
                                                                                                                                    <abstract><p>Systems involving interactive actors such asfood networks, scientific quotations, social networks, communications networks,the Internet and stock exchange networks have long been studied by manyresearchers under the concept of complex systems. Such systems are representedby weighted networks. The intensive connections and relationships betweenactors play a crucial role in forecasting or risk analysis. In this study; wepropose a new approach to measure the hierarchical structure of the globallyactive stock market network. In this approach we propose, the relationship of21 different world stock exchange markets to each other is determined byPearson&#039;s correlations. Relevant stock network is based on a certain thresholdvalue. At the same time, a new topological measure is used to characterize theinteraction of the nodes of the graphical communities of the stock market, andthis measure is examined for the time periods of 2008 global economic crisis.</p></abstract>
                                                            
            
                                                                                        <kwd-group>
                                                    <kwd>Correlation Networks</kwd>
                                                    <kwd>  Network Construction</kwd>
                                                    <kwd>  Minimum Spanning Tree</kwd>
                                                    <kwd>  Topological Measure</kwd>
                                            </kwd-group>
                            
                                                <kwd-group xml:lang="tr">
                                                    <kwd>Korelasyon Ağları</kwd>
                                                    <kwd>  Ağ Yapılandırması</kwd>
                                                    <kwd>  Minimum Geren Ağaç</kwd>
                                                    <kwd>  Topolojik Ölçüm</kwd>
                                            </kwd-group>
                                                                                                                                        </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">Agarwal, G. and Kempe, D., “Modularity-maximizing graph communities via mathematical programming”. The European Physical Journal B, 66, 3, 409-418, 2008.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">Balci, M. A. “Fractional virus epidemic model on financial networks”, Open Mathematics, 14, 1, 1074-1086 2016.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">Balci, M. A. “Hierarchies in Communities of Borsa Istanbul Stock Exchange”, Hacettepe Journal of Mathematics and Statistics, In Press, DOI:10.15672/hjms.201614520777.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">Bankevich, A. V. “Bounds of the number of leaves of spanning trees in graphs without triangles”. Journal of Mathematical Sciences, 184, 5, 557-563, 2012.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">Bollobas, B. Graph theory: an introductory course. Vol. 63. Springer Science &amp; Business Media, 2012.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">Centola, D. and van de Rijt, A. “Choosing your network: Social preferences in an online health community”. Social science &amp; medicine, 125, 19-31, 2015.</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">Chan, T. F., S. Osher, and Shen,J. &quot;The Digital TV Filter and Nonlinear Denoising.&quot; 	IEEE 	Transactions on Image Processing, 10, 2, 231-241, 2001.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">Chug, F. R. K. Spectral Graph Theory, American Mathematical Society (1997).</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">Evans, T.S., “Clique graphs and overlapping communities”, Journal of Statistical Mechanics: Theory and Experiment, 12, P12037, 2009.</mixed-citation>
                    </ref>
                                    <ref id="ref10">
                        <label>10</label>
                        <mixed-citation publication-type="journal">Everett, M.G. and Borgatti, S.P., “Analyzing clique overlap”, Connections, 21, 1, 49-61., 1998.</mixed-citation>
                    </ref>
                                    <ref id="ref11">
                        <label>11</label>
                        <mixed-citation publication-type="journal">Gross, J. L., and Yellen J., eds. Handbook of graph theory. CRC press, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref12">
                        <label>12</label>
                        <mixed-citation publication-type="journal">Guler, H., Dundar, P., and Balci, M. A.“Solitude Number at Graphs”, IJ Pure and Applied Mathematics, 66, 3, 355-364, 2011.</mixed-citation>
                    </ref>
                                    <ref id="ref13">
                        <label>13</label>
                        <mixed-citation publication-type="journal">Hur, S-W. and Lillis, J., &quot;Relaxation and Clustering in a Local Search Framework: 	Application to Linear Placement.&quot;, Proceedings - Design Automation Conference, 1999, 360-366.</mixed-citation>
                    </ref>
                                    <ref id="ref14">
                        <label>14</label>
                        <mixed-citation publication-type="journal">Jang, W., Lee, J., and Chang, W. “Currency crises and the evolution of foreign exchange market: evidence from minimum spanning tree”, Physica A, 390, 707–718, 2011.</mixed-citation>
                    </ref>
                                    <ref id="ref15">
                        <label>15</label>
                        <mixed-citation publication-type="journal">Lancichinetti, A., Santo F., and Kertész, J. &quot;Detecting the overlapping and hierarchical community structure in complex networks.&quot; New Journal of Physics 11, no. 3, 033015, 2009.</mixed-citation>
                    </ref>
                                    <ref id="ref16">
                        <label>16</label>
                        <mixed-citation publication-type="journal">Morel, B. and Ramanujam, R., &quot;Through the Looking Glass of Complexity: The Dynamicsof Organizations as Adaptive and Evolving Systems.&quot; Organization Science, 10 , 3,  278-293, 1999.</mixed-citation>
                    </ref>
                                    <ref id="ref17">
                        <label>17</label>
                        <mixed-citation publication-type="journal">Newman, M.E.,”Detecting community structure in networks.” The European PhysicalJournal B-Condensed Matter and Complex Systems, 38,2, 321-330, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref18">
                        <label>18</label>
                        <mixed-citation publication-type="journal">Newman, M.E.,”Fast algorithm for detecting community structure in networks.” Physicalreview E, 69, 6 066133, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref19">
                        <label>19</label>
                        <mixed-citation publication-type="journal">Newman, M.E. and Girvan, M., “Finding and evaluating community structure in networks”. Physical review E, 69, 2, p.026113, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref20">
                        <label>20</label>
                        <mixed-citation publication-type="journal">Newman, M. E. “The structure and function of complex networks”, SIAM review, 45, 2, 167-256, 2003.</mixed-citation>
                    </ref>
                                    <ref id="ref21">
                        <label>21</label>
                        <mixed-citation publication-type="journal">Onnela, J.-P., Chakraborti, A., and Kaski, K. “Dynamic asset trees and portfolio analysis”, The European Physical Journal B, 30, 285–288, 2002.</mixed-citation>
                    </ref>
                                    <ref id="ref22">
                        <label>22</label>
                        <mixed-citation publication-type="journal">Onnela, J.-P., Chakraborti, A. and Kaski, K. “Dynamics of market correlations: taxonomy and portfolio analysis”, Physical Review E, 68, 056110, 2003.</mixed-citation>
                    </ref>
                                    <ref id="ref23">
                        <label>23</label>
                        <mixed-citation publication-type="journal">Ozkanlar, A. and Clark, A. E., &quot;ChemNetworks: A Complex Network Analysis Tool for 	Chemical Systems.&quot; Journal of Computational Chemistry 35, 6, 495-505, 2014.</mixed-citation>
                    </ref>
                                    <ref id="ref24">
                        <label>24</label>
                        <mixed-citation publication-type="journal">West, D. B.,Introduction to graph theory. Vol. 2. Upper Saddle River: Prentice hall, 2001.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
