The London Institute’s papers are the official record of our discoveries. They allow others to build on and apply our work. Each one is the result of many months of research, so we strive to make them clear, inspiring and beautiful, and publish them in leading journals.

  • Date
  • Subject
  • Theme
  • Journal
  • Citations
  • Altmetric
  • SNIP
  • Author
x1
  • J. WangJ. Wang
  • J. TanJ. Tan
  • E. SobkoE. Sobko
  • O. GamayunO. Gamayun
  • T. FinkT. Fink
  • V. LysovV. Lysov
  • A. StepanenkoA. Stepanenko
  • Y. HeY. He
  • G. CaldarelliG. Caldarelli
  • M. BurtsevM. Burtsev
  • A. V. KosyakA. V. Kosyak
  • F. SheldonF. Sheldon
  • F. CaravelliF. Caravelli
  • I. ShkredovI. Shkredov
  • A. SarikyanA. Sarikyan
  • A. EsterovA. Esterov
  • A. OchirovA. Ochirov
  • M. ReevesM. Reeves
  • R. HannamR. Hannam
  • O. DahlstenO. Dahlsten
  • A. MozeikaA. Mozeika
  • M. BardosciaM. Bardoscia
  • P. BaruccaP. Barucca
  • M. RowleyM. Rowley
  • I. TeimouriI. Teimouri
  • F. AntenucciF. Antenucci
  • A. ScalaA. Scala
  • R. FarrR. Farr
  • S. SebastioS. Sebastio
  • B. BollobásB. Bollobás
  • F. LafondF. Lafond
  • D. FarmerD. Farmer
  • C. PickardC. Pickard
  • T. ReevesT. Reeves
  • J. BlundellJ. Blundell
  • A. GallagherA. Gallagher
  • M. PrzykuckiM. Przykucki
  • P. SmithP. Smith
  • L. PietroneroL. Pietronero
  • Eigenvalues of neutral networks: interpolating between hypercubes

    Graph theory

    TRT. ReevesRFR. FarrJBJ. BlundellAGA. GallagherTFT. Fink Discrete Mathematics

    Eigenvalues of neutral networks

    The principal eigenvalue of small neutral networks determines their robustness, and is bounded by the logarithm of the number of vertices.