Skip to main content

DINAMICA DE GRUPOS, GRAFOS Y FOLIACIONES

MTM2016-77642-C2-2-P

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDADE DE SANTIAGO DE COMPOSTELA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Suppressors of selection

  • Alcalde Cuesta, Fernando
  • González Sequeiros, Pablo
  • Lozano Rojo, Álvaro
Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present examples of undirected structures acting as suppressors of selection for any fitness value r > 1. This means that the average fixation probability of an advantageous mutant or invader individual placed at some node is strictly less than that of this individual placed in a well-mixed population. This leads the way to study more robust structures less prone to invasion, contrary to what happens with the amplifiers of selection where the fixation probability is increased on average for advantageous invader individuals. A few families of amplifiers are known, although some effort was required to prove it. Here, we use computer aided techniques to find an exact analytical expression of the fixation probability for some graphs of small order (equal to 6, 8 and 10) proving that selection is effectively reduced for r > 1. Some numerical experiments using Monte Carlo methods are also performed for larger graphs and some variants.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Evolutionary regime transitions in structured populations

  • Alcalde Cuesta, Fernando
  • González Sequeiros, Pablo
  • Lozano Rojo, Álvaro
The evolutionary dynamics of a finite population where resident individuals are replaced by mutant ones depends on its spatial structure. Usually, the population adopts the form of an undirected graph where the place occupied by each individual is represented by a vertex and it is bidirectionally linked to the places that can be occupied by its offspring. There are undirected graph structures that act as amplifiers of selection increasing the probability that the offspring of an advantageous mutant spreads through the graph reaching any vertex. But there also are undirected graph structures acting as suppressors of selection where this probability is less than that of the same individual placed in a homogeneous population. Here, firstly, we present the distribution of these evolutionary regimes for all undirected graphs with N ≤ 10 vertices. Some of them exhibit transitions between different regimes when the mutant fitness increases. In particular, as it has been already observed for small-order random graphs, we show that most graphs of order N ≤ 10 are amplifiers of selection. Secondly, we describe examples of amplifiers of order 7 that become suppressors from some critical value. In fact, for graphs of order N ≤ 7, we apply computer-aided techniques to symbolically compute their fixation probability and then their evolutionary regime, as well as the critical values for which they change their regime. Thirdly, the same technique is applied to some families of highly symmetrical graphs as a mean to explore methods of suppressing selection. The existence of suppression mechanisms that reverse an amplification regime when fitness increases could have a great interest in biology and network science. Finally, the analysis of all graphs from order 8 to order 10 reveals a complex and rich evolutionary dynamics, with multiple transitions between different regimes, which have not been examined in detail until now
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A method for validating Rent's rule for technological and biological networks

  • Alcalde Cuesta, Fernando
  • González Sequeiros, Pablo
  • Lozano Rojo, Álvaro
Rent’s rule is empirical power law introduced in an effort to describe and optimize the wiring complexity of computer logic graphs. It is known that brain and neuronal networks also obey Rent’s rule, which is consistent with the idea that wiring costs play a fundamental role in brain evolution and development. Here we propose a method to validate this power law for a certain range of network partitions. This method is based on the bifurcation phenomenon that appears when the network is subjected to random alterations preserving its degree distribution. It has been tested on a set of VLSI circuits and real networks, including biological and technological ones. We also analyzed the effect of different types of random alterations on the Rentian scaling in order to test the influence of the degree distribution. There are network architectures quite sensitive to these randomization procedures with significant increases in the values of the Rent exponents.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Suppressors of selection

  • Alcalde Cuesta, Fernando
  • González Sequeiros, Pablo
  • Lozano Rojo, Álvaro
Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present examples of undirected structures acting as suppressors of selection for any fitness value r > 1. This means that the average fixation probability of an advantageous mutant or invader individual placed at some node is strictly less than that of this individual placed in a well-mixed population. This leads the way to study more robust structures less prone to invasion, contrary to what happens with the amplifiers of selection where the fixation probability is increased on average for advantageous invader individuals. A few families of amplifiers are known, although some effort was required to prove it. Here, we use computer aided techniques to find an exact analytical expression of the fixation probability for some graphs of small order (equal to 6, 8 and 10) proving that selection is effectively reduced for r > 1. Some numerical experiments using Monte Carlo methods are also performed for larger graphs and some variants.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Functional Representation of the Intentional Bounded Rationality of Decision-Makers: A Laboratory to Study the Decisions a Priori

  • Saenz-Royo, Carlos
  • Chiclana, Francisco
  • Herrera-Viedma, Enrique
The judgments of decision-makers are frequently the best way to process the information on complex alternatives. However, the performances of the alternatives are often not observable in their entirety, which prevents researchers from conducting controlled empirical studies. This paper justifies a functional representation that, due to its good predictive results, has been widely used ad hoc in studies in different branches of knowledge; it formalizes aspects of the human mental structure that influence the ability of people to decide and the intentional bounded rationality, and it subsequently analyzes how the reliability of decision-makers is affected by the difficulty of the problem and the expertise and beliefs of the decision-maker. The main research objective of this paper is to derive explicitly a general functional form that represents the behavior of a decision-maker linked to their way of thinking. This functional form allows a laboratory to be created to study a priori the performance of human decisions, i.e., the probability of choosing each of the alternatives, once the returns of the alternatives, the level of expertise, and the initial beliefs of the decision-maker are known exogenously. This laboratory will allow (1) the evaluation of decision support techniques; (2) the creation of agent-based models that anticipate group performances due to individual interactions; and (3) the development of other investigations based on statistical simulations.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Routes to tripod gait movement in hexapods

  • Barrio, R.
  • Lozano, A.
  • Martínez, M.A.
  • Rodríguez, M.
  • Serrano. S.
The use of hierarchical networks in motor pattern generation in hexapod robots and in insect movement provides ways to understand and control both systems. In this paper we consider the Central Pattern Generator (CPG) of insect movement consisting of six coupled neurons developed by Ghigliazza and Holmes (2004) that produces the global leg coordination pattern. We provide a detailed study of the possible gaits generated by the CPG through different numerical techniques recently developed for the study of small networks, which allow us to consider the complete model without any simplification. We combine the analysis of isolated neurons (using several three dimensional parameter spaces) to give a roadmap of the dynamics of the neurons involved, lateral phase lag plots to show the convergence and transitions towards particular patterns and a quasi-Monte Carlo sweeping method to describe different pattern routes in the parametric phase space. In all of our studies we have found the same final result: most of the observed patterns follow routes that lead to the stable tripod gait. We obtain several routes made of symmetrical patterns, but despite considering mainly a symmetric leg CPG we detect non-symmetrical patterns that provide (minor) routes present in the model. The bifurcations of the main pattern routes detected in the parameter space are studied in detail using continuation techniques. This study reveals the bifurcations that create and destroy the different routes and how for large values of some parameters only the tripod gait is present. Based on the symmetric case, a preliminary study of asymmetric configurations is done revealing the robustness of the already located patterns and routes. Due to the relevance of the tripod gait, and since more parameters are included in this study, we introduce an algorithm to locate the limit of the tripod gait in the parameter space, which shows that there is a large three parametric region where the tripod pattern is ubiquitous and highly dominant in rapidly moving insect regimes.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Numerical detection of patterns in CPGs: Gait patterns in insect movement

  • Barrio, R.
  • Lozano, Á.
  • Rodríguez, M.
  • Serrano, S.
The study of the synchronization patterns of small neuron networks that control different biological processes has become a growing discipline. This paper is focused on numerical techniques to detect patterns in Central Pattern Generators (CPGs). We develop two techniques that can be used directly in general CPG models: a lateral phase lag analysis based on a graphic representation of some Poincaré maps, and a quasi-Monte Carlo sweeping with an optimized classification of the different patterns. As test example we consider a CPG of insect movement consisting of six coupled neurons following the model developed by Ghigliazza and Holmes (2004) for motoneurons in cockroaches. Previous studies in literature analyzed reduced models of dimension two obtained using phase resetting curves and averaging theory. This approach introduces a lot of simplifications that do not cover numerous non-symmetric patterns. We present an analysis of the complete model developed by combining the two proposed techniques, showing symmetric and non-symmetric patterns coexisting for different parameter values, and how the dominant patterns evolve to the tripod movement.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

The Triple-Point Spectrum of Closed Orientable 3-Manifolds

  • Lozano Rojo, Á.
  • Vigara, R.
The triple-point numbers and the triple-point spectrum of a closed 3-manifold are topological invariants that give a measure of the complexity of the 3-manifold using the number of triple points of minimal filling Dehn surfaces. Basic properties of these invariants are presented, and the triple-point spectra of S2 × S1 and S3 are computed.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Authority and consensus in group decision making with fallible individuals

  • Sáenz-Royo, C.
  • Salas-Fumás, V.
  • Lozano-Rojo, Á.
This paper compares the performance, in terms of expected opportunity loss of mistakes, of group decision making with fallible members, under different organization structures. These structures result from combining the decision mechanisms of authority and consensus with the communication networks of star, tree, and full network. Simulation results from Agent Based Modeling show that the authority (consensus) is preferred when the time to reach a group decision matters (not matters), and in organizational environments of high (low) risk and high (low) prospects of growth. Additionally, the results of the paper recommend that organizations that want to migrate from authority to consensus decision making, as defined here, should switch from the low-density tree like connecting network, common in hierarchical structures, to a high-density full network.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Evolutionary regime transitions in structured populations

  • Lozano Rojo, Álvaro
  • González Sequeiros, Pablo
  • Alcalde Cuesta, Fernando
The evolutionary dynamics of a finite population where resident individuals are replaced by mutant ones depends on its spatial structure. Usually, the population adopts the form of an undirected graph where the place occupied by each individual is represented by a vertex and it is bidirectionally linked to the places that can be occupied by its offspring. There are undirected graph structures that act as amplifiers of selection increasing the probability that the offspring of an advantageous mutant spreads through the graph reaching any vertex. But there also are undirected graph structures acting as suppressors of selection where this probability is less than that of the same individual placed in a homogeneous population. Here, firstly, we present the distribution of these evolutionary regimes for all undirected graphs with N ≤ 10 vertices. Some of them exhibit transitions between different regimes when the mutant fitness increases. In particular, as it has been already observed for small-order random graphs, we show that most graphs of order N ≤ 10 are amplifiers of selection. Secondly, we describe examples of amplifiers of order 7 that become suppressors from some critical value. In fact, for graphs of order N ≤ 7, we apply computer-aided techniques to symbolically compute their fixation probability and then their evolutionary regime, as well as the critical values for which they change their regime. Thirdly, the same technique is applied to some families of highly symmetrical graphs as a mean to explore methods of suppressing selection. The existence of suppression mechanisms that reverse an amplification regime when fitness increases could have a great interest in biology and network science. Finally, the analysis of all graphs from order 8 to order 10 reveals a complex and rich evolutionary dynamics, with multiple transitions between different regimes, which have not been examined in detail until now.