Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Fink, T. M."'
Autor:
Fink, T. M. A.
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their recursive
Externí odkaz:
http://arxiv.org/abs/2307.16691
Autor:
Fink, T. M. A.
We recently introduced the recursive divisor function $\kappa_x(n)$, a recursive analogue of the usual divisor function. Here we calculate its Dirichlet series, which is ${\zeta(s-x)}/(2 - \zeta(s))$. We show that $\kappa_x(n)$ is related to the ordi
Externí odkaz:
http://arxiv.org/abs/2307.09140
Autor:
Fink, T. M. A., Sheldon, F. C.
The Kauffman model is the archetypal model of genetic computation. It highlights the importance of criticality, at which many biological systems seem poised. In a series of advances, researchers have honed in on how the number of attractors in the cr
Externí odkaz:
http://arxiv.org/abs/2306.01629
Autor:
Sheldon, F. C., Fink, T. M. A.
The Kauffman model of genetic computation highlights the importance of criticality at the border of order and chaos. The model with connectivity one is of special interest because it is exactly solvable. But our understanding of its behavior is incom
Externí odkaz:
http://arxiv.org/abs/2303.02079
Autor:
Fink, T. M. A.
The critical Kauffman model with connectivity one is the simplest class of critical Boolean networks. Nevertheless, it exhibits intricate behavior at the boundary of order and chaos. We introduce a formalism for expressing the dynamics of multiple lo
Externí odkaz:
http://arxiv.org/abs/2302.05314
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Innovation is to organizations what evolution is to organisms: it is how organisations adapt to changes in the environment and improve. Governments, institutions and firms that innovate are more likely to prosper and stand the test of time; those tha
Externí odkaz:
http://arxiv.org/abs/1608.01900
A neutral network is a subgraph of a Hamming graph, and its principal eigenvalue determines its robustness: the ability of a population evolving on it to withstand errors. Here we consider the most robust small neutral networks: the graphs that inter
Externí odkaz:
http://arxiv.org/abs/1504.03065
Autor:
Fink, T. M. A.
This dissertation is composed of three parts: inverse protein folding, hierarchical optimisation and tie knots. Chapters 2 - 7 describe inverse folding, the design of proteins which quickly and stably fold to specified target conformations. In Chapte
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.599025
We study the relative importance of "top-speed" (long-term growth rate) and "acceleration" (how quickly the long-term growth rate can be reached) in the evolutionary race to increase population size. We observe that fitness alone does not capture gro
Externí odkaz:
http://arxiv.org/abs/1202.0063