01720nas a2200241   4500008004100000022001400041245009300055210006900148300001100217490000800228520098300236653002901219653001401248653002001262653001801282100002001300700002901320700002101349700001801370700001901388700002301407856004801430       2019                        eng d  a0378-437100aRank-frequency distribution of natural languages: A difference of probabilities approach0 aRankfrequency distribution of natural languages A difference of   a1217950 v5323 aIn this paper we investigate the time variation of the rank k of words for six Indo-European languages using the Google Books N-gram Dataset. Based on numerical evidence, we regard k as a random variable whose dynamics may be described by a Fokker–Planck equation which we solve analytically. For low ranks the distinct languages behave differently, maybe due to the syntax rules, whereas for k>50 the law of large numbers predominates. We analyze the frequency distribution of words using the data and their adjustment in terms of time-dependent probability density distributions. We find small differences between the data and the fits due to conflicting dynamic mechanisms, but the data show a consistent behavior with our general approach. For the lower ranks the behavior of the data changes among languages presumably, again, due to distinct dynamic mechanisms. We discuss a possible origin of these differences and assess the novel features and limitations of our work.10aFokker–Planck equation10aLanguages10aMaster equation10aRank dynamics1 aCocho, Germinal1 aRodríguez, Rosalío, F.1 aSánchez, Sergio1 aFlores, Jorge1 aPineda, Carlos1 aGershenson, Carlos  uhttps://doi.org/10.1016/j.physa.2019.12179502275nas a2200157   4500008004100000020001400041245008100055210006900136520174800205100002501953700002601978700002302004700002302027700002002050856004702070       2019                        eng d  a1868-514500aA robustness approach to the distributed management of traffic intersections0 arobustness approach to the distributed management of traffic int3 aNowadays, the development of autonomous vehicles has emerged as an approach to considerably improve the traffic management in urban zones. Thanks to automation in vehicles as well as in other sectors, the probability of errors, typically due to repetitive tasks, has been drastically reduced. Therefore, technological aids in current driving systems are aimed to avoid or reduce human errors like imprudences or distractions. According to this, it is possible to tackle complex scenarios such as the automation of the vehicles traffic at intersections, as this is one of the points with the highest probability of accidents. In this sense, the coordination of autonomous vehicles at intersections is a trending topic. In the last few years, several approaches have been proposed using centralized solutions. However, centralized systems for traffic coordination have a limited fault-tolerance. This paper proposes a distributed coordination management system for intersections of autonomous vehicles through the employment of some well-defined rules to be followed by vehicles. To validate our proposal, we have developed different experiments in order to compare our proposal with other centralized approaches. Furthermore, we have incorporated the management of communication faults during the execution in our proposal. This improvement has also been tested in front of centralized or semi-centralized solutions. The introduction of failures in the communication process demonstrates the sensitivity of the system to possible disturbances, providing a satisfactory coordination of vehicles during the intersection. As final result, our proposal is kept with a suitable flow of autonomous vehicles still with a high communication fails rate.1 aGonzález, Cesar, L.1 aZapotecatl, Jorge, L.1 aGershenson, Carlos1 aAlberola, Juan, M.1 aJulian, Vicente  uhttps://doi.org/10.1007/s12652-019-01424-w01973nas a2200229   4500008004100000022001400041245005100055210005100106300000700157490000600164520131800170100002301488700001701511700002101528700002801549700001901577700002201596700002001618700001801638700002301656856006401679       2018                        eng d  a2296-424X00aRank Dynamics of Word Usage at Multiple Scales0 aRank Dynamics of Word Usage at Multiple Scales  a450 v63 aThe recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail, such as the growth and diversification of language. In particular, it provides statistical tools to explore whether word use is similar across languages, and if so, whether these generic features appear at different scales of language structure. Here we use the Google Books $N$-grams dataset to analyze the temporal evolution of word usage in several languages. We apply measures proposed recently to study rank dynamics, such as the diversity of $N$-grams in a given rank, the probability that an $N$-gram changes rank between successive time intervals, the rank entropy, and the rank complexity. Using different methods, results show that there are generic properties for different languages at different scales, such as a core of words necessary to minimally understand a language. We also propose a null model to explore the relevance of linguistic structure across multiple scales, concluding that $N$-gram statistics cannot be reduced to word statistics. We expect our results to be useful in improving text prediction algorithms, as well as in shedding light on the large-scale features of language use, beyond linguistic and cultural differences across human populations.1 aMorales, José, A.1 aColman, Ewan1 aSánchez, Sergio1 aSánchez-Puig, Fernanda1 aPineda, Carlos1 aIñiguez, Gerardo1 aCocho, Germinal1 aFlores, Jorge1 aGershenson, Carlos  uhttps://www.frontiersin.org/article/10.3389/fphy.2018.0004501729nas a2200181   4500008004100000245007900041210006900120260003400189300001300223490000700236520115000243100002001393700001801413700002301431700001901454700002101473856005301494       2015                        eng d00aRank Diversity of Languages: Generic Behavior in Computational Linguistics0 aRank Diversity of Languages Generic Behavior in Computational Li  bPublic Library of Sciencec04  ae01218980 v103 a<p>Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: “heads” consist of words which almost do not change their rank in time, “bodies” are words of general use, while “tails” are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied.</p>
1 aCocho, Germinal1 aFlores, Jorge1 aGershenson, Carlos1 aPineda, Carlos1 aSánchez, Sergio  uhttp://dx.doi.org/10.1371%2Fjournal.pone.012189800356nas a2200109   4500008004100000245005800041210005500099300001400154490000700168100002300175856004800198       2015                        eng d00aRequisite Variety, Autopoiesis, and Self-organization0 aRequisite Variety Autopoiesis and Selforganization  a866–8730 v441 aGershenson, Carlos  uhttp://turing.iimas.unam.mx/sos/?q=node/15900486nas a2200109   4500008004100000245015900041210006900200300001200269490000700281100002300288856006500311       2011                        eng d00aReviving the Living: Meaning Making in Living Systems. Yair Neuman. (2008, Elsevier, Studies in Multidisciplinarity, Vol. 6). $197 (hardbound), 320 pages.0 aReviving the Living Meaning Making in Living Systems Yair Neuman  a145-1460 v171 aGershenson, Carlos  uhttp://www.mitpressjournals.org/doi/abs/10.1162/artl_a_0002600457nas a2200109   4500008004100000245011900041210006900160300001200229490000700241100002300248856007600271       2009                        eng d00aReinventing the Sacred: A New View of Science, Reason, and Religion. Stuart A. Kauffman. (2008, Basic Books.) $27.0 aReinventing the Sacred A New View of Science Reason and Religion  a485-4870 v151 aGershenson, Carlos  uhttp://www.mitpressjournals.org/doi/abs/10.1162/artl.2009.Gershenson.B601643nas a2200217   4500008004100000245007400041210006800115260001400183300001200197520099000209100002301199700002501222700002101247700001801268700001901286700001801305700001701323700002201340700001901362856004401381       2006                        eng d00aThe Role of Redundancy in the Robustness of Random {Boolean} Networks0 aRole of Redundancy in the Robustness of Random Boolean Networks  bMIT Press  a35–423 aEvolution depends on the possibility of successfully exploring fitness landscapes via mutation and recombination. With these search procedures, exploration is difficult in "rugged" fitness landscapes, where small mutations can drastically change functionalities in an organism. Random Boolean networks (RBNs), being general models, can be used to explore theories of how evolution can take place in rugged landscapes; or even change the landscapes. In this paper, we study the effect that redundant nodes have on the robustness of RBNs. Using computer simulations, we have found that the addition of redundant nodes to RBNs increases their robustness. We conjecture that redundancy is a way of "smoothening" fitness landscapes. Therefore, redundancy can facilitate evolutionary searches. However, too much redundancy could reduce the rate of adaptation of an evolutionary process. Our results also provide supporting evidence in favour of Kauffman's conjecture (Kauffman, 2000, p.195).1 aGershenson, Carlos1 aKauffman, Stuart, A.1 aShmulevich, Ilya1 aRocha, L., M.1 aYaeger, L., S.1 aBedau, M., A.1 aFloreano, D.1 aGoldstone, R., L.1 aVespignani, A.  uhttp://uk.arxiv.org/abs/nlin.AO/0511018