scispace - formally typeset
Search or ask a question
Institution

Santa Fe Institute

NonprofitSanta Fe, New Mexico, United States
About: Santa Fe Institute is a nonprofit organization based out in Santa Fe, New Mexico, United States. It is known for research contribution in the topics: Population & Complex network. The organization has 558 authors who have published 4558 publications receiving 396015 citations. The organization is also known as: SFI.


Papers
More filters
Journal ArticleDOI
TL;DR: It is shown the rules of graph evolution seem to be largely responsible for the observed motif distribution, and several highly frequent network motifs appear to be a consequence of network heterogeneity and size, thus suggesting a somewhat less relevant role of functionality.
Abstract: Complex networks in both nature and technology have been shown to display characteristic, small subgraphs (so-called motifs) which appear to be related to their underlying functionality. All these networks share a common trait: they manipulate information at different scales in order to perform some kind of computation. Here we analyze a large set of software class diagrams and show that several highly frequent network motifs appear to be a consequence of network heterogeneity and size, thus suggesting a somewhat less relevant role of functionality. However, by using a simple model of network growth by duplication and rewiring, it is shown the rules of graph evolution seem to be largely responsible for the observed motif distribution.

128 citations

Journal ArticleDOI
TL;DR: It is found that young de novo genes have a different codon usage from the rest of the genome, and might have strain-specific functions, or no function, and would be difficult to detect using current genome annotation methods that rely on the sequence signature of purifying selection.
Abstract: New protein-coding genes can originate either through modification of existing genes or de novo. Recently, the importance of de novo origination has been recognized in eukaryotes, although eukaryotic genes originated de novo are relatively rare and difficult to identify. In contrast, viruses contain many de novo genes, namely those in which an existing gene has been “overprinted” by a new open reading frame, a process that generates a new protein-coding gene overlapping the ancestral gene. We analyzed the evolution of 12 experimentally validated viral genes that originated de novo and estimated their relative ages. We found that young de novo genes have a different codon usage from the rest of the genome. They evolve rapidly and are under positive or weak purifying selection. Thus, young de novo genes might have strain-specific functions, or no function, and would be difficult to detect using current genome annotation methods that rely on the sequence signature of purifying selection. In contrast to young de novo genes, older de novo genes have a codon usage that is similar to the rest of the genome. They evolve slowly and are under stronger purifying selection. Some of the oldest de novo genes evolve under stronger selection pressure than the ancestral gene they overlap, suggesting an evolutionary tug of war between the ancestral and the de novo gene.

127 citations

Journal ArticleDOI
TL;DR: For example, the authors showed that an economic model with all agents having preferences quasi-linear in some good has a trading-constraint structure isomorphic to the structure of physical systems with classical thermodynamic equations of state.

127 citations

Journal ArticleDOI
TL;DR: This work proposes to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances.
Abstract: While manufacturing limitations are imposing constraints on Moore's law, researchers are searching for novel computing architectures based on quantum-mechanical effects. However, it remains to be shown that quantum annealing techniques consistently outperform classical simulated annealing to minimize optimization problems.

127 citations

Journal ArticleDOI
TL;DR: To explore the robustness of the cooperation-promoting effect of costly punishment, besides the usual strategy adoption dynamics, strategy mutations are applied to study the evolution of cooperation in spatial public goods games with four competing strategies.
Abstract: We study the evolution of cooperation in spatial public goods games with four competing strategies: cooperators, defectors, punishing cooperators, and punishing defectors. To explore the robustness of the cooperation-promoting effect of costly punishment, besides the usual strategy adoption dynamics we also apply strategy mutations. As expected, frequent mutations create kind of well-mixed conditions, which support the spreading of defectors. However, when the mutation rate is small, the final stationary state does not significantly differ from the state of the mutation-free model, independently of the values of the punishment fine and cost. Nevertheless, the mutation rate affects the relaxation dynamics. Rare mutations can largely accelerate the spreading of costly punishment. This is due to the fact that the presence of defectors breaks the balance of power between both cooperative strategies, which leads to a different kind of dynamics.

127 citations


Authors

Showing all 606 results

NameH-indexPapersCitations
James Hone127637108193
James H. Brown12542372040
Alan S. Perelson11863266767
Mark Newman117348168598
Bette T. Korber11739249526
Marten Scheffer11135073789
Peter F. Stadler10390156813
Sanjay Jain10388146880
Henrik Jeldtoft Jensen102128648138
Dirk Helbing10164256810
Oliver G. Pybus10044745313
Andrew P. Dobson9832244211
Carel P. van Schaik9432926908
Seth Lloyd9249050159
Andrew W. Lo8537851440
Network Information
Related Institutions (5)
Massachusetts Institute of Technology
268K papers, 18.2M citations

90% related

University of Oxford
258.1K papers, 12.9M citations

90% related

Princeton University
146.7K papers, 9.1M citations

89% related

Max Planck Society
406.2K papers, 19.5M citations

89% related

University of California, Berkeley
265.6K papers, 16.8M citations

89% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202341
202241
2021297
2020309
2019263
2018231