<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462017000200325</article-id>
<article-id pub-id-type="doi">10.13053/cys-21-2-2722</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Estudio comparativo entre el algoritmo de Kleinberg y el algoritmo Biased Selection para la construcción de redes small world]]></article-title>
<article-title xml:lang="en"><![CDATA[Comparative Study between Kleinberg Algorithm and Biased Selection Algorithm for Small World Networks Construction]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Arcos-Argudo]]></surname>
<given-names><![CDATA[Miguel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Politécnica Salesiana del Ecuador  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Ecuador</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<volume>21</volume>
<numero>2</numero>
<fpage>325</fpage>
<lpage>336</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462017000200325&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462017000200325&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462017000200325&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: Actualmente las redes de tipo small world constituyen un tema muy importante en nuestro entorno, pues están presentes en varios fenómenos naturales y artificiales. Un objetivo de muchos algoritmos desarrollados para tratamiento de grafos es conseguir que un nodo cualquiera logre establecer una conexión directa con otro nodo del grafo seleccionado al azar obteniendo un &#8220;vecino lejano&#8221;. Este trabajo muestra un estudio comparativo entre dos algoritmos que logran este objetivo: Kleinberg y Biased Selection. Se demuestra por medio de experimentos que los dos algoritmos son capaces de obtener la distribución de Kleinberg. Se concluye que el algoritmo de Kleinberg obtiene una distribución de muestreo que es directamente proporcional a la distancia Euclidiana, y Biased Selection, a pesar de que también obtiene una distribución directamente proporcional a la distancia Euclidiana, permite que un nodo lejano pueda ser determinado como vecino lejano con mayor frecuencia.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Actually Small-World Networks is a very important topic, it is present in a lot of applications in our environment. A target of many algorithms is to establish methods to get that any node in a graph can establish a direct connection with a randomly &#8220;long-range neighbor&#8221;. This work is comparative study between two algorithms that get this target (Kleinberg and Biased Selection), I demonstrate by my experiments that both get the Kleinberg&#8217;s distribution. I conclude that the Kleinberg&#8217;s algorithm distribution maintains a probability directly proportional to Euclidian distance, and Biased Selection, although also maintains a probability directly proportional to Euclidian distance, allows that a node can get a farther node as &#8220;long-range neighbor&#8221; more frequently.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Biased Selection]]></kwd>
<kwd lng="es"><![CDATA[cadenas de Markov]]></kwd>
<kwd lng="es"><![CDATA[grafos]]></kwd>
<kwd lng="es"><![CDATA[Kleinberg]]></kwd>
<kwd lng="es"><![CDATA[paseos aleatorios]]></kwd>
<kwd lng="es"><![CDATA[small world]]></kwd>
<kwd lng="en"><![CDATA[Biased selection]]></kwd>
<kwd lng="en"><![CDATA[graph]]></kwd>
<kwd lng="en"><![CDATA[Kleinberg]]></kwd>
<kwd lng="en"><![CDATA[Markov chains]]></kwd>
<kwd lng="en"><![CDATA[random walks]]></kwd>
<kwd lng="en"><![CDATA[small worlds]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<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>
<article-title xml:lang=""><![CDATA[Collective dynamics of &#8220;small-world&#8221; networks]]></article-title>
<source><![CDATA[Nature]]></source>
<year>1998</year>
<volume>393</volume>
<numero>6684</numero>
<issue>6684</issue>
<page-range>440&#8211;442</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barbour]]></surname>
<given-names><![CDATA[A. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Reinert]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Small worlds]]></source>
<year>2000</year>
<publisher-name><![CDATA[arXiv]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barrière]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fraigniaud]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kranakis]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Krizanc]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient routing in networks with long range contacts]]></article-title>
<source><![CDATA[International Symposium on Distributed Computing]]></source>
<year>2001</year>
<page-range>270&#8211;284</page-range><publisher-loc><![CDATA[Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bertier]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bonnet]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Kermarrec]]></surname>
<given-names><![CDATA[A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Leroy]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Peri]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Raynal]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[D2HT: the best of both worlds, Integrating RPS and DHT]]></article-title>
<source><![CDATA[European Dependable Computing Conference (EDCC)]]></source>
<year>2010</year>
<page-range>135&#8211;144</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bonnet]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Kermarrec]]></surname>
<given-names><![CDATA[A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Raynal]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Small-world networks: From theoretical bounds to practical systems]]></article-title>
<source><![CDATA[International Conference on Principles of Distributed Systems]]></source>
<year>2007</year>
<page-range>372&#8211;385</page-range><publisher-loc><![CDATA[Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sevilla]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mozo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lorenzo]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[López-Presa]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Manzano]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Anta]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Biased selection for building small-world networks]]></article-title>
<source><![CDATA[Principles of Distributed Systems]]></source>
<year>2010</year>
<page-range>32&#8211;47</page-range><publisher-loc><![CDATA[Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kleinberg]]></surname>
<given-names><![CDATA[J. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Navigation in a small world]]></article-title>
<source><![CDATA[Nature]]></source>
<year>2000</year>
<volume>406</volume>
<numero>6798</numero>
<issue>6798</issue>
<page-range>845&#8211;845</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Chiang]]></surname>
<given-names><![CDATA[L. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[C. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[R. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Power saving protocol based on rectangular grid quorums for IEEE 802.11 ad hoc networks]]></source>
<year>2015</year>
<conf-name><![CDATA[ 11International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness]]></conf-name>
<conf-loc> </conf-loc>
<page-range>370&#8211;374</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rainy]]></surname>
<given-names><![CDATA[J. M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Nesasudha]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Neighbor discovery in ad-hoc networks using dual band scheme]]></source>
<year>2015</year>
<conf-name><![CDATA[ International Conference on Electronics and Communication Systems (ICECS)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1216&#8211; 1219</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Romanchukov]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Berestneva]]></surname>
<given-names><![CDATA[E. V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Issues of Application Design for Social Studies]]></source>
<year>2016</year>
<conf-name><![CDATA[ The European Proceedings of Social &amp; Behavioural Sciences (EpSBS)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>88&#8211;94</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Opsahl]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Vernet]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Alnuaimi]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[George]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Revisiting the Small-World Phenomenon: Efficiency Variation and Classification of Small-World Networks]]></article-title>
<source><![CDATA[Organizational Research Methods]]></source>
<year>2017</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>149&#8211;173</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sevilla]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mozo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Anta]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Node sampling using random centrifugal walks]]></article-title>
<source><![CDATA[Journal of Computational Science]]></source>
<year>2015</year>
<volume>11</volume>
<page-range>34&#8211;45</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malkov]]></surname>
<given-names><![CDATA[Y. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Yashunin]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs]]></source>
<year>2016</year>
<publisher-name><![CDATA[arXiv]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
