Skip to main content

Resultados relacionados

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

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

Human behavior in prisoner's dilemma experiments suppresses network reciprocity

  • Gracia-Lázaro, Carlos
  • Cuesta, José A.
  • Sánchez, Angel
  • Moreno, Yamir
During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks, the observed level of cooperation is the same. We thus show that when human subjects interact in a heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population., J. A. C. and A. S. acknowledge grants MOSAICO, PRODIEVO and Complexity-NET RESINEE (Ministerio de Ciencia e Innovación, Spain) and MODELICO-CM (Comunidad de Madrid, Spain). Y. M. was partially supported by Spanish MICINN (Ministerio de Ciencia e Innovación) projects FIS2008-01240 and FIS2009-13364-C02-01, by the FET-Open project DYNANETS (grant no. 233847) funded by the European Commission and by Comunidad de Aragón (Spain) through the project FMI22/10.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

Human behavior in prisoner's dilemma experiments suppresses network reciprocity

  • Gracia-Lázaro, Carlos
  • Cuesta, José A.
  • Sánchez, Angel
  • Moreno, Yamir
During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks, the observed level of cooperation is the same. We thus show that when human subjects interact in a heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population., J. A. C. and A. S. acknowledge grants MOSAICO, PRODIEVO and Complexity-NET RESINEE (Ministerio de Ciencia e Innovación, Spain) and MODELICO-CM (Comunidad de Madrid, Spain). Y. M. was partially supported by Spanish MICINN (Ministerio de Ciencia e Innovación) projects FIS2008-01240 and FIS2009-13364-C02-01, by the FET-Open project DYNANETS (grant no. 233847) funded by the European Commission and by Comunidad de Aragón (Spain) through the project FMI22/10., Publicado
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Promoter sequence determines the relationship between expression level and noise

  • Carey, Lucas, 1980-
  • Dijk, David van
  • Sloot, Peter MA
  • Kaandorp, Jaap A.
  • Segal, Eran
The ability of cells to accurately control gene expression levels in response to extracellular cues is limited by the inherently stochastic nature of transcriptional regulation. A change in transcription factor (TF) activity results in changes in the expression of its targets, but the way in which cell-to-cell variability in expression (noise) changes as a function of TF activity, and whether targets of the same TF behave similarly, is not known. Here, we measure expression and noise as a function of TF activity for 16 native targets of the transcription factor Zap1 that are regulated by it through diverse mechanisms. For most activated and repressed Zap1 targets, noise decreases as expression increases. Kinetic modeling suggests that this is due to two distinct Zap1-mediated mechanisms that both change the frequency of transcriptional bursts. Notably, we found that another mechanism of repression by Zap1, which is encoded in the promoter DNA, likely decreases the size of transcriptional bursts, producing a unique transcriptional state characterized by low expression and low noise. In addition, we find that further reduction in noise is achieved when a single TF both activates and represses a single target gene. Our results suggest a global principle whereby at low TF concentrations, the dominant source of differences in expression between promoters stems from differences in burst frequency, whereas at high TF concentrations differences in burst size dominate. Taken together, we show that the precise amount by which noise changes with expression is specific to the regulatory mechanism of transcription and translation that acts at each gene., This work was supported by grants from the European Research Council (ERC) and The US National Institutes of Health (NIH) to ES. ES is the incumbent of the Soretta and Henry Shapiro Career Development Chair. PMAS and DD were supported by FP7 FET Open project ‘DynaNets’ (EU Grant Agreement no. 233847), and ‘ViroLab’ (EU project no: IST-027446). PMAS acknowledges the Complexity Program at NTU, Singapore and the financial support from the FET-Proactive grant TOPDRIM, number FP7-ICT-318121. DD was also supported by an EMBO Short-Term Fellowship and a travel grant from the BioRange program of the Netherlands Bioinformatics Centre (NBIC) and Netherlands Genomics Initiative (NGI). JK was supported by the FP7 collaborative project BioPreDyn (contract no. 289434). LBC was supported by a Weizmann Institute postdoctoral fellowship
Dipòsit Digital de la UB
Publication Artículo científico (JournalArticle)

Exploring complex networks by means of adaptive walkers

  • Prignano, Luce
  • Moreno, Yamir
  • Díaz Guilera, Albert
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise no data are retrieved. Consequently, at each time step, the walkers, with some probability, have the choice to either go backward approaching their home or go farther away. We show that there is an optimal solution to this problem in terms of the average information retrieved and the degree of the home nodes and design an adaptive strategy based on the behavior of the random walker. Finally, we compare different strategies that emerge from the model in the context of network reconstruction. Our results could be useful for the discovery of unknown connections in large-scale networks.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Promoter sequence determines the relationship between expression level and noise

  • Carey, Lucas, 1980-
  • Dijk, David van
  • Sloot, Peter MA
  • Kaandorp, Jaap A.
  • Segal, Eran
The ability of cells to accurately control gene expression levels in response to extracellular cues is limited by the inherently stochastic nature of transcriptional regulation. A change in transcription factor (TF) activity results in changes in the expression of its targets, but the way in which cell-to-cell variability in expression (noise) changes as a function of TF activity, and whether targets of the same TF behave similarly, is not known. Here, we measure expression and noise as a function of TF activity for 16 native targets of the transcription factor Zap1 that are regulated by it through diverse mechanisms. For most activated and repressed Zap1 targets, noise decreases as expression increases. Kinetic modeling suggests that this is due to two distinct Zap1-mediated mechanisms that both change the frequency of transcriptional bursts. Notably, we found that another mechanism of repression by Zap1, which is encoded in the promoter DNA, likely decreases the size of transcriptional bursts, producing a unique transcriptional state characterized by low expression and low noise. In addition, we find that further reduction in noise is achieved when a single TF both activates and represses a single target gene. Our results suggest a global principle whereby at low TF concentrations, the dominant source of differences in expression between promoters stems from differences in burst frequency, whereas at high TF concentrations differences in burst size dominate. Taken together, we show that the precise amount by which noise changes with expression is specific to the regulatory mechanism of transcription and translation that acts at each gene., This work was supported by grants from the European Research Council (ERC) and The US National Institutes of Health (NIH) to ES. ES is the incumbent of the Soretta and Henry Shapiro Career Development Chair. PMAS and DD were supported by FP7 FET Open project ‘DynaNets’ (EU Grant Agreement no. 233847), and ‘ViroLab’ (EU project no: IST-027446). PMAS acknowledges the Complexity Program at NTU, Singapore and the financial support from the FET-Proactive grant TOPDRIM, number FP7-ICT-318121. DD was also supported by an EMBO Short-Term Fellowship and a travel grant from the BioRange program of the Netherlands Bioinformatics Centre (NBIC) and Netherlands Genomics Initiative (NGI). JK was supported by the FP7 collaborative project BioPreDyn (contract no. 289434). LBC was supported by a Weizmann Institute postdoctoral fellowship
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Exploring complex networks by means of adaptive walkers

  • Prignano, Luce
  • Moreno, Yamir
  • Díaz Guilera, Albert
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise no data are retrieved. Consequently, at each time step, the walkers, with some probability, have the choice to either go backward approaching their home or go farther away. We show that there is an optimal solution to this problem in terms of the average information retrieved and the degree of the home nodes and design an adaptive strategy based on the behavior of the random walker. Finally, we compare different strategies that emerge from the model in the context of network reconstruction. Our results could be useful for the discovery of unknown connections in large-scale networks.