<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1870-9044</journal-id>
<journal-title><![CDATA[Polibits]]></journal-title>
<abbrev-journal-title><![CDATA[Polibits]]></abbrev-journal-title>
<issn>1870-9044</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1870-90442016000100005</article-id>
<article-id pub-id-type="doi">10.17562/PB-53-1</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[On the Sufficiency of Using Degree Sequence of the Vertices to Generate Random Networks Corresponding to Real-World Networks]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Meghanathan]]></surname>
<given-names><![CDATA[Natarajan]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Jackson State University Department of Computer Science ]]></institution>
<addr-line><![CDATA[ MS]]></addr-line>
<country>USA</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<numero>53</numero>
<fpage>5</fpage>
<lpage>21</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1870-90442016000100005&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1870-90442016000100005&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1870-90442016000100005&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The focus of research in this paper is to investigate whether a random network whose degree sequence of the vertices is the same as the degree sequence of the vertices in a real-world network would exhibit values for other analysis metrics similar to those of the real-world network. We use the well-known Configuration Model to generate a random network on the basis of the degree sequence of the vertices in a real-world network wherein the degree sequence need not be Poisson-style. The extent of similarity between the vertices of the random network and real-world network with respect to a particular metric is evaluated in the form of the correlation coefficient of the values of the vertices for the metric. We involve a total of 24 real-world networks in this study, with the spectral radius ratio for node degree (measure of variation in node degree) ranging from 1.04 to 3.0 (i.e., from random networks to scale-free networks). We consider a suite of seven node-level metrics and three network-level metrics for our analysis and identify the metrics for which the degree sequence would be just sufficient to generate random networks that have a very strong correlation (correlation coefficient of 0.8 or above) with that of the vertices in the corresponding real-world networks.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Configuration model]]></kwd>
<kwd lng="en"><![CDATA[degree sequence]]></kwd>
<kwd lng="en"><![CDATA[correlation]]></kwd>
<kwd lng="en"><![CDATA[random network]]></kwd>
<kwd lng="en"><![CDATA[real-world network]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[On Random Graphs I.]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Erdos]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Renyi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Publicationes Mathematicae]]></source>
<year>1959</year>
<volume>6</volume>
<page-range>290-7</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ugarte]]></surname>
<given-names><![CDATA[M. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Militino]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Arnholt]]></surname>
<given-names><![CDATA[A. T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Probability and Statistics with R]]></source>
<year>2015</year>
<edition>2nd</edition>
<publisher-name><![CDATA[Chapman and Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meghanathan]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Spectral Radius as a Measure of Variation in Node Degree for Complex Network Graphs]]></source>
<year>2014</year>
<conf-name><![CDATA[ 3rdInternational Conference on Digital Contents and Applications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>30-3</page-range><publisher-loc><![CDATA[Hainan, China ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Emergence of Scaling in Random Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barabasi]]></surname>
<given-names><![CDATA[A-L.]]></given-names>
</name>
<name>
<surname><![CDATA[Albert]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Science]]></source>
<year>1999</year>
<volume>286</volume>
<numero>5439</numero>
<issue>5439</issue>
<page-range>509-12</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Newman]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Networks: An Introduction]]></source>
<year>2010</year>
<edition>1st</edition>
<publisher-name><![CDATA[Oxford University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Generating Simple Random Graphs with Prescribed Degree Distribution]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Britton]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Deijfen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Martin-Lof]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Statistical Physics]]></source>
<year>2006</year>
<volume>124</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>1377-97</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Power and Centrality: A Family of Measures]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bonacich]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[American Journal of Sociology]]></source>
<year>1987</year>
<volume>92</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1170-82</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Set of Measures of Centrality based on Betweenness]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Freeman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sociometry]]></source>
<year>1977</year>
<volume>40</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>35-41</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Centrality in Social Networks Conceptual Clarification]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Freeman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Social Networks]]></source>
<year>1979</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>215-39</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The Structure and Function of Complex Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Newman]]></surname>
<given-names><![CDATA[M. E. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[SIAM Review]]></source>
<year>2003</year>
<volume>45</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>167-256</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Community Detection based on Network Communicability]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Estrada]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Chaos]]></source>
<year>2011</year>
<volume>21</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>016103</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Distribution of Maximal Clique Size of the Vertices for Theoretical Small-World Networks and Real-World Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meghanathan]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Computer Networks and Communications]]></source>
<year>2015</year>
<volume>7</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>21-41</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Assortative Mixing in Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Newman]]></surname>
<given-names><![CDATA[M. E. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Physical Review Letters]]></source>
<year>2002</year>
<volume>89</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Triola]]></surname>
<given-names><![CDATA[M. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Elementary Statistics]]></source>
<year>2012</year>
<edition>12th</edition>
<publisher-loc><![CDATA[NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Pearson]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lay]]></surname>
<given-names><![CDATA[D. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Lay]]></surname>
<given-names><![CDATA[S. R.]]></given-names>
</name>
<name>
<surname><![CDATA[McDonald]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear Algebra and its Applications]]></source>
<year>2015</year>
<edition>5th</edition>
<publisher-name><![CDATA[Pearson Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cormen]]></surname>
<given-names><![CDATA[T. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Leiserson]]></surname>
<given-names><![CDATA[C. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rivest]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Stein]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Algorithms]]></source>
<year>2009</year>
<edition>3rd</edition>
<publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<collab>JAMA</collab>
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="">
<article-title xml:lang=""><![CDATA[Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pattabiraman]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Patwary]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gebremedhin]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Liao]]></surname>
<given-names><![CDATA[W. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Choudhary]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph: Lecture Notes in Computer Science]]></source>
<year>2013</year>
<volume>8305</volume>
<page-range>156-69</page-range><publisher-loc><![CDATA[Cambridge, MA, USA ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Lower Bounds for the Spectral Radius of a Matrix]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Horne]]></surname>
<given-names><![CDATA[B. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear Algebra and its Applications]]></source>
<year>1997</year>
<volume>263</volume>
<page-range>261-73</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chung]]></surname>
<given-names><![CDATA[F. R. K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Spectral Graph Theory]]></source>
<year>1996</year>
<edition>1st</edition>
<publisher-name><![CDATA[American Mathematical Society]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Old and New Results on Algebraic Connectivity of Graphs]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abreu]]></surname>
<given-names><![CDATA[N. M. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear Algebra and its Applications]]></source>
<year>2007</year>
<volume>423</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>53-73</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Algebraic Connectivity of Graphs]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fiedler]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Czechoslovak Mathematical Journal]]></source>
<year>1973</year>
<volume>23</volume>
<numero>98</numero>
<issue>98</issue>
<page-range>298-305</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Evans]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Straightforward Statistics for the Behavioral Sciences]]></source>
<year>1995</year>
<edition>1st</edition>
<publisher-name><![CDATA[Brooks Cole Publishing Company]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[Diachronic Changes in the Dominance Relations of Adult Female Japanese Monkeys of the Arashiyama B Group]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Takahata]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Monkeys of Arashiyama]]></source>
<year>1991</year>
<page-range>124-39</page-range><publisher-loc><![CDATA[Albany ]]></publisher-loc>
<publisher-name><![CDATA[State University of New York Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Informant Accuracy in Social Network Data IV: A Comparison of Clique-level Structure in Behavioral and Cognitive Network Data]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bernard]]></surname>
<given-names><![CDATA[H. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Killworth]]></surname>
<given-names><![CDATA[P. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sailer]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Social Networks]]></source>
<year>1980</year>
<volume>2</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>191-218</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[What's in a Crowd? Analysis of Face-to-Face Behavioral Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Isella]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Stehle]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Barrat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cattuto]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Pinton]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Broeck]]></surname>
<given-names><![CDATA[W. Van den]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Theoretical Biology]]></source>
<year>2011</year>
<volume>271</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>166-80</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moreno]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Sociometry Reader]]></source>
<year>1960</year>
<page-range>534-47</page-range><publisher-loc><![CDATA[Glencoe, IL, USA ]]></publisher-loc>
<publisher-name><![CDATA[The Free Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Labor Dispute Reconciliation in a Forest Products Manufacturing Facility]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michael]]></surname>
<given-names><![CDATA[J. H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Forest Products Journal]]></source>
<year>1997</year>
<volume>47</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>41-5</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Mitigation of Infectious Disease at School: Targeted Class Closure vs. School Closure]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gemmetto]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Barrat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cattuto]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[BMC Infectious Diseases]]></source>
<year>2014</year>
<volume>14</volume>
<numero>695</numero>
<issue>695</issue>
<page-range>1-10</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The Political Network in Mexico]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gil-Mendieta]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Schmidt]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Social Networks]]></source>
<year>1996</year>
<volume>18</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>355-81</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Exploring Social Structure using Dynamic Three-Dimensional Color Images]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Freeman]]></surname>
<given-names><![CDATA[L. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Webster]]></surname>
<given-names><![CDATA[C. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kirke]]></surname>
<given-names><![CDATA[D. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Social Networks]]></source>
<year>1998</year>
<volume>20</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>109-18</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Fuzzy Communities and the Concept of Bridgeness in Complex Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nepusz]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Petroczi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Negyessy]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Bazso]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Physical Review E]]></source>
<year>2008</year>
<volume>77</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Structure and Dynamics of the Global Economy: Network Analysis of International Trade 1965-1980]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
<name>
<surname><![CDATA[White]]></surname>
<given-names><![CDATA[D. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Social Forces]]></source>
<year>1992</year>
<volume>70</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>857-93</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Community Structure in Jazz]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geiser]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Danon]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Complex Systems]]></source>
<year>2003</year>
<volume>6</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>563-73</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An Information Flow Model for Conflict and Fission in Small Groups]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zachary]]></surname>
<given-names><![CDATA[W. W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Anthropological Research]]></source>
<year>1977</year>
<volume>33</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>452-73</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Literary Playground: Literary Criticism and Balance Theory]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nooy]]></surname>
<given-names><![CDATA[W. de]]></given-names>
</name>
</person-group>
<source><![CDATA[Poetics]]></source>
<year>1999</year>
<volume>26</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>385-404</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Bayesian Hierarchical Topic Mode for Political Texts: Measuring Expressed Agendas in Senate Press Releases]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grimmer]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Political Analysis]]></source>
<year>2010</year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-35</page-range></nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carlson]]></surname>
<given-names><![CDATA[R. O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Adoption of Educational Innovations]]></source>
<year>1971</year>
<publisher-name><![CDATA[Center for Advanced Study of Educational Admin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The Structure of the Nervous System of the Nematode Caenorhabditis Elegans]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[White]]></surname>
<given-names><![CDATA[J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Southgate]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Thomson]]></surname>
<given-names><![CDATA[J. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Brenner]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Philosophical Transactions B]]></source>
<year>1986</year>
<volume>314</volume>
<numero>1165</numero>
<issue>1165</issue>
<page-range>1-340</page-range></nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Finding Community Structure in Networks using the Eigenvectors of Matrices]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Newman]]></surname>
<given-names><![CDATA[M. E. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Physical Review E]]></source>
<year>2006</year>
<volume>74</volume>
<numero>3</numero>
<issue>3</issue>
</nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Knuth]]></surname>
<given-names><![CDATA[D. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Stanford GraphBase: A Platform for Combinatorial Computing]]></source>
<year>1993</year>
<edition>1st</edition>
<publisher-loc><![CDATA[Reading, MA ]]></publisher-loc>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="">
<collab>UFL Datasets</collab>
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Analyzing the Structure of the Centrality-Productivity Literature Created between 1948 and 1979]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hummon]]></surname>
<given-names><![CDATA[N. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Doreian]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Freeman]]></surname>
<given-names><![CDATA[L. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Science Communication]]></source>
<year>1990</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>459-80</page-range></nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biedl]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Franz]]></surname>
<given-names><![CDATA[B. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph-Drawing Contest Report]]></source>
<year>2001</year>
<conf-name><![CDATA[ 9thInternational Symposium on Graph Drawing]]></conf-name>
<conf-loc> </conf-loc>
<page-range>513-21</page-range></nlm-citation>
</ref>
<ref id="B45">
<nlm-citation citation-type="">
<collab>Pajek</collab>
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B46">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Markov Chain Monte Carlo Method for Generating Random (0, 1)-Matrices with given Signals]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[A. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Jana]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bandyopadhyay]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sankhya: The Indian Journal of Statistics]]></source>
<year>1996</year>
<volume>58</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>225-42</page-range></nlm-citation>
</ref>
<ref id="B47">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Viger]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Latapy]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence]]></source>
<year>2005</year>
<conf-name><![CDATA[ 11thAnnual International Conference on Computing and Combinatorics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>440-9</page-range><publisher-loc><![CDATA[Kunming, China ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B48">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Random Graph Models of Social Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Newman]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Watts]]></surname>
<given-names><![CDATA[D. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Strogatz]]></surname>
<given-names><![CDATA[S. H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of the National Academy of Sciences USA]]></source>
<year>2002</year>
<volume>99</volume>
<page-range>2566-72</page-range></nlm-citation>
</ref>
<ref id="B49">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Quantifying Randomness in Real Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Orsini]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Dankulov]]></surname>
<given-names><![CDATA[M. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Colomer-de-Simon]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Jamakovic]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahadevan]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Vahdat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bassler]]></surname>
<given-names><![CDATA[K. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Toroczkai]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Boguna]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Caldarelli]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Fortunato]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Krioukov]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nature Communications]]></source>
<year>2015</year>
<volume>6</volume>
<numero>8627</numero>
<issue>8627</issue>
<page-range>1-10</page-range></nlm-citation>
</ref>
<ref id="B50">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Identification of Influential Spreaders in Complex Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kitsak]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Gallos]]></surname>
<given-names><![CDATA[L. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Havlin]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Liljeros]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Muchnik]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Stanley]]></surname>
<given-names><![CDATA[H. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Makse]]></surname>
<given-names><![CDATA[H. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nature Physics]]></source>
<year>2010</year>
<volume>6</volume>
<page-range>888-93</page-range></nlm-citation>
</ref>
<ref id="B51">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miorandi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Pellegrini]]></surname>
<given-names><![CDATA[F. De]]></given-names>
</name>
</person-group>
<source><![CDATA[K-Shell Decomposition for Dynamic Complex Networks]]></source>
<year>2010</year>
<conf-name><![CDATA[ 8thInternational Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks]]></conf-name>
<conf-loc> </conf-loc>
<page-range>488-96</page-range><publisher-loc><![CDATA[Avignon, France ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B52">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Elsasser]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Neubert]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Toward Proper Random Graph Models for Real World Networks]]></source>
<year>2010</year>
<conf-name><![CDATA[ 9thInternational Conference on Networks]]></conf-name>
<conf-loc> </conf-loc>
<page-range>306-15</page-range><publisher-loc><![CDATA[Menuires, France ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B53">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Subgraphs in Random Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Itzkovitz]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Milo]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kashtan]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Ziv]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Alon]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<source><![CDATA[Physical Review E]]></source>
<year>2003</year>
<volume>68</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B54">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Effect of Correlations on Network Controllability]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Posfai]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y-Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Slotine]]></surname>
<given-names><![CDATA[J-J.]]></given-names>
</name>
<name>
<surname><![CDATA[Barabasi]]></surname>
<given-names><![CDATA[A-L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Scientific Reports]]></source>
<year>2013</year>
<volume>3</volume>
<numero>1067</numero>
<issue>1067</issue>
<page-range>1-21</page-range></nlm-citation>
</ref>
<ref id="B55">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Control Centrality and Hierarchical Structure in Complex Networks]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y-Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Slotine]]></surname>
<given-names><![CDATA[J-J.]]></given-names>
</name>
<name>
<surname><![CDATA[Barabasi]]></surname>
<given-names><![CDATA[A-L.]]></given-names>
</name>
</person-group>
<source><![CDATA[PLoS One]]></source>
<year>2012</year>
<volume>7</volume>
<numero>9</numero>
<issue>9</issue>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
