Skip to main content
Home
Department Of Physics text logo
  • Research
    • Our research
    • Our research groups
    • Our research in action
    • Research funding support
    • Summer internships for undergraduates
  • Study
    • Undergraduates
    • Postgraduates
  • Engage
    • For alumni
    • For business
    • For schools
    • For the public
Menu
Theoretical physicists working at a blackboard collaboration pod in the Beecroft building.
Credit: Jack Hobhouse

Ard Louis

Professor of Theoretical Physics

Research theme

  • Biological physics

Sub department

  • Rudolf Peierls Centre for Theoretical Physics

Research groups

  • Condensed Matter Theory
ard.louis@physics.ox.ac.uk
Louis Research Group members
Louis Research Group
  • About
  • Research
  • Publications on arXiv/bioRxiv
  • Publications

Generic predictions of output probability based on complexities of inputs and outputs

Scientific reports Nature Research 10:1 (2020) 4415

Authors:

Kamaludin Dingle, Guillermo Valle Pérez, Ard A Louis

Abstract:

For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random sampling of inputs than complex outputs are. Here, we derive probability bounds that are based on the complexities of the inputs as well as the outputs, rather than just on the complexities of the outputs. The more that outputs deviate from the coding theorem bound, the lower the complexity of their inputs. Since the number of low complexity inputs is limited, this behaviour leads to an effective lower bound on the probability. Our new bounds are tested for an RNA sequence to structure map, a finite state transducer and a perceptron. The success of these new methods opens avenues for AIT to be more widely used.
More details from the publisher
Details from ORA
More details
More details

Boolean Threshold Networks as Models of Genotype-Phenotype Maps

Springer Proceedings in Complexity (2020) 143-155

Authors:

CQ Camargo, AA Louis

Abstract:

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020. Boolean threshold networks (BTNs) are a class of mathematical models used to describe complex dynamics on networks. They have been used to study gene regulation, but also to model the brain, and are similar to artificial neural networks used in machine learning applications. In this paper we study BTNs from the perspective of genotype-phenotype maps, by treating the network’s set of nodes and connections as its genotype, and dynamic behaviour of the model as its phenotype. We show that these systems exhibit (1) Redundancy, that is many genotypes map to the same phenotypes; (2) Bias, the number of genotypes per phenotypes varies over many orders of magnitude; (3) Simplicity bias, simpler phenotypes are exponentially more likely to occur than complex ones; (4) Large robustness, many phenotypes are surprisingly robust to random perturbations in the parameters, and (5) this robustness correlates positively with the evolvability, the ability of the system to find other phenotypes by point mutations of the parameters. These properties should be relevant for the wide range of systems that can be modelled by BTNs.
More details from the publisher
More details

From genotypes to organisms: State-of-the-art and perspectives of a cornerstone in evolutionary dynamics

(2020)

Authors:

Susanna Manrubia, José A Cuesta, Jacobo Aguirre, Sebastian E Ahnert, Lee Altenberg, Alejandro V Cano, Pablo Catalán, Ramon Diaz-Uriarte, Santiago F Elena, Juan Antonio García-Martín, Paulien Hogeweg, Bhavin S Khatri, Joachim Krug, Ard A Louis, Nora S Martin, Joshua L Payne, Matthew J Tarnowski, Marcel Weiß
More details from the publisher

Complexity and modularity in a simple model of self-assembling polycubes

17th Annual Conference on Foundations of Nanoscience, FNANO 2020: Self-Assembled Architectures and Devices (2020) 138-139

Authors:

J Bohlin, AJ Turberfield, AA Louis

Generic predictions of output probability based on complexities of inputs and outputs

(2019)

Authors:

Kamaludin Dingle, Guillermo Valle Pérez, Ard A Louis
More details from the publisher

Pagination

  • First page First
  • Previous page Prev
  • …
  • Page 7
  • Page 8
  • Page 9
  • Page 10
  • Current page 11
  • Page 12
  • Page 13
  • Page 14
  • Page 15
  • …
  • Next page Next
  • Last page Last

Footer Menu

  • Contact us
  • Giving to the Dept of Physics
  • Work with us
  • Media

User account menu

  • Log in

Follow us

FIND US

Clarendon Laboratory,

Parks Road,

Oxford,

OX1 3PU

CONTACT US

Tel: +44(0)1865272200

University of Oxfrod logo Department Of Physics text logo
IOP Juno Champion logo Athena Swan Silver Award logo

© University of Oxford - Department of Physics

Cookies | Privacy policy | Accessibility statement

Built by: Versantus

  • Home
  • Research
  • Study
  • Engage
  • Our people
  • News & Comment
  • Events
  • Our facilities & services
  • About us
  • Current students
  • Staff intranet