# Eigenvalues of neutral networks: Interpolating between hypercubes

T. Reeves, R. Farr, J. Blundell, A. Gallagher, T. Fink

*Discrete Mathematics* 339, 1283 (2016)

#spectraltheory#biomathematics#discretemath

The first 16 ‘‘bricklayer’s graphs’’ and the principal eigenvalue of their adjacency matrices.

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 interpolate pointwise between hypercube graphs of consecutive dimension (the point, line, line and point in the square, square, square and point in the cube, and so on). We prove that the principal eigenvalue of the adjacency matrix of these graphs is bounded by the logarithm of the number of vertices, and we conjecture an analogous result for Hamming graphs of alphabet size greater than two.

#### Phase transition creates the geometry of the continuum from discrete space

R. Farr, T. Fink

*Physical Review E*

#### The statistical physics of real-world networks

G. Cimini, T. Squartini, F. Saracco, D. Garlaschelli, A. Gabrielli, G. Caldarelli

*Nature Reviews Physics*

#### On defining the Hamiltonian beyond quantum theory

D. Branford, O. Dahlsten, A. Garner

*Foundations of Physics*

#### Reconstructing grain-shape statistics from electron back-scatter diffraction microscopy

R. Farr, Z. Vukmanovic, M. Holness, E. Griffiths

*Physical Review Materials*

#### Tackling information asymmetry in networks: a new entropy-based ranking index

P. Barucca, G. Caldarelli, T. Squartini

*Journal of Statistical Physics*

#### Eigenvalues of subgraphs of the cube

B. Bollobás, J. Lee, S. Letzter

*European Journal of Combinatorics*

#### Maximum one-shot dissipated work from Rényi divergences

N. Halpern, A. Garner, O. Dahlsten, V. Vedral

*Physical Review E *

123 / 123 papers