activity
20102024
most citedCorrelation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks

75 citations · 93 across the 8 of their papers we have counts for

collaborators

9 papers

cs.IT2024★ 1 cited

Simplicity bias, algorithmic probability, and the random logistic map

Boumediene Hamzi, Kamaludin Dingle

Simplicity bias is an intriguing phenomenon prevalent in various input-output maps, characterized by a preference for simpler, more regular, or symmetric outputs. Notably, these ma…

cs.LG2022★ 5 cited

Multiclass classification utilising an estimated algorithmic probability prior

Kamaludin Dingle, Pau Batlle, Houman Owhadi

Methods of pattern recognition and machine learning are applied extensively in science, technology, and society. Hence, any advances in related theory may translate into large-scal…

math.OC2022

Optima and Simplicity in Nature

Kamaludin Dingle

Why are simple, regular, and symmetric shapes common in nature? Many natural shapes arise as solutions to energy minimisation or other optimisation problems, but is there a general…

cs.CC2022★ 1 cited

Low complexity, low probability patterns and consequences for algorithmic probability applications

Mohamed Alaskandarani, Kamaludin Dingle

Developing new ways to estimate probabilities can be valuable for science, statistics, and engineering. By considering the information content of different output patterns, recent…

physics.data-an2022★ 11 cited

A Note on A Priori Forecasting and Simplicity Bias in Time Series

Kamaludin Dingle, Rafiq Kamal, Boumediene Hamzi

To what extent can we forecast a time series without fitting to historical data? Can universal patterns of probability help in this task? Deep relations between pattern Kolmogorov…

physics.data-an2019

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

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

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…

q-bio.PE2015

The structure of the genotype-phenotype map strongly constrains the evolution of non-coding RNA

Kamaludin Dingle, Steffen Schaper, Ard A. Louis

The prevalence of neutral mutations implies that biological systems typically have many more genotypes than phenotypes. But can the way that genotypes are distributed over phenotyp…

cs.IT2013★ 75 cited

Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks

Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle +1

We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empiric…

math.DS2010

Knudsen's law and random billiards in irrational triangles

Joan-Andreu Lazaro-Cami, Kamaludin Dingle, Jeroen Lamb

We prove Knudsen's law for a gas of particles bouncing freely in a two dimensional pipeline with serrated walls consisting of irrational triangles. Dynamics are randomly perturbed…