Skip to main content

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)

Exploring the topological sources of robustness against invasion in biological and technological networks

  • Alcalde Cuesta, Fernando
  • González Sequeiros, Pablo
  • Lozano Rojo, Álvaro
For a network, the accomplishment of its functions despite perturbations is called robustness. Although this property has been extensively studied, in most cases, the network is modified by removing nodes. In our approach, it is no longer perturbed by site percolation, but evolves after site invasion. The process transforming resident/healthy nodes into invader/mutant/diseased nodes is described by the Moran model. We explore the sources of robustness (or its counterpart, the propensity to spread favourable innovations) of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome. We compare them to three modular and non-modular benchmark networks, and samples of one thousand random networks with the same degree distribution. It is found that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. While community detection techniques are able to detect the existence of a central core in Internet2, they are not effective in detecting hierarchical structures whose topological complexity arises from the repetition of a few rules. Box counting dimension and Rent’s rule are applied to show a subtle trade-off between topological and wiring complexity
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Exploring the topological sources of robustness against invasion in biological and technological networks

  • Alcalde Cuesta, F.
  • González Sequeiros, P.
  • Lozano Rojo, Á.
For a network, the accomplishment of its functions despite perturbations is called robustness. Although this property has been extensively studied, in most cases, the network is modified by removing nodes. In our approach, it is no longer perturbed by site percolation, but evolves after site invasion. The process transforming resident/healthy nodes into invader/mutant/diseased nodes is described by the Moran model. We explore the sources of robustness (or its counterpart, the propensity to spread favourable innovations) of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome. We compare them to three modular and non-modular benchmark networks, and samples of one thousand random networks with the same degree distribution. It is found that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. While community detection techniques are able to detect the existence of a central core in Internet2, they are not effective in detecting hierarchical structures whose topological complexity arises from the repetition of a few rules. Box counting dimension and Rent''s rule are applied to show a subtle trade-off between topological and wiring complexity.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Control strategies of 3-cell Central Pattern Generator via global stimuli

  • Lozano, A.
  • Rodriguez, M.
  • Barrio, R.
The study of the synchronization patterns of small neuron networks that control several biological processes has become an interesting growing discipline. Some of these synchronization patterns of individual neurons are related to some undesirable neurological diseases, and they are believed to play a crucial role in the emergence of pathological rhythmic brain activity in different diseases, like Parkinson''s disease. We show how, with a suitable combination of short and weak global inhibitory and excitatory stimuli over the whole network, we can switch between different stable bursting patterns in small neuron networks (in our case a 3-neuron network). We develop a systematic study showing and explaining the effects of applying the pulses at different moments. Moreover, we compare the technique on a completely symmetric network and on a slightly perturbed one (a much more realistic situation). The present approach of using global stimuli may allow to avoid undesirable synchronization patterns with nonaggressive stimuli.
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)

Banchoff’s sphere and branched covers over the trefoil

  • Lozano Rojo, Á.
  • Vigara, R.
A filling Dehn surface in a 3-manifold M is a generically immersed surface in M that induces a cellular decomposition of M. Given a tame link L in M, there is a filling Dehn sphere of M that “trivializes” (diametrically splits) it. This allows to construct filling Dehn surfaces in the coverings of M branched over L. It is shown that one of the simplest filling Dehn spheres of S3 (Banchoff’s sphere) diametrically splits the trefoil knot. Filling Dehn spheres, and their Johansson diagrams, are constructed for the coverings of S3 branched over the trefoil. The construction is explained in detail. Johansson diagrams for generic cyclic coverings and for the simplest locally cyclic and irregular ones are constructed explicitly, providing new proofs of known results about cyclic coverings and the 3-fold irregular covering over the trefoil.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

An accurate database of the fixation probabilities for all undirected graphs of order 10 or less

  • Alcalde Cuesta, Fernando
  • González Sequeiros, Pablo
  • Lozano Rojo, Álvaro
  • Vigara Benito, Rubén
We present a extremely precise database of the fixation probabilities of mutant individuals in a non-homogeneous population which are spatially arranged on a small graph. We explore what features of a graph increase the chances of a beneficial allele of a gene to spread over a structured population.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Insertion-tolerance and repetitiveness of random graphs

  • Alcalde Cuesta, F.
  • Lozano Rojo, Á.
  • Vázquez Martínez, A.C.
Bond percolation on Cayley graphs provides examples of random graphs. Other examples arise from the dynamical study of proper repetitive subgraphs of Cayley graphs. In this paper we demonstrate that these two families have mutually singular laws as a corollary of a general lemma about countable Borel equivalence relations on first countable Hausdorff spaces.
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)

Organisational structure and performance of consensus decisions through mutual influences: A computer simulation approach

  • Salas-Fumás, V.
  • Sáenz-Royo, C.
  • Lozano-Rojo, Á.
This paper models and simulates the formation of consensus through information sharing and social influences among bounded rational individuals connected through a communication network, who collectively decide whether to adopt a new project, policy or idea (innovation in short) or not. Next we examine the sensitivity of group fallibility in the collective adoption decision and the time spent on reaching consensus to parameters of the model such as the economic value of the innovation, the connectivity and size of the network and the degree of social influences. We find that group consensus decisions reduce the probability of commission errors to negligible values (adopting value-destroying innovations), but the probability of omission errors (rejecting value-creating ones) and the time to reach consensus are sensitive to the exogenous parameters with some trade-offs: higher average connectivity of communication networks increases the likelihood of making omission errors in adoption but reduces the time to reach consensus. The results of this research are relevant to managerial decisions affecting the performance of consensus by mutual influences on decision making in the expanding production and exchange systems of information-intensive networks of empowered workers.