Pasar al contenido principal

Resultados relacionados

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

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación 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
Publicación 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
Publicación 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
Publicación 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.