Enumeration of RNA complexes via random matrix theory
J{\o}rgen E. Andersen, Leonid O. Chekhov, R. C. Penner, Christian M., Reidys, Piotr Su{\l}kowski

TL;DR
This paper reviews how random matrix theory, specifically the hermitian matrix model and topological recursion, can be used to enumerate RNA complexes of arbitrary topology, linking biological structures with mathematical topology.
Contribution
It introduces a novel application of topological recursion in random matrix theory to count RNA complexes and connect biological data with mathematical topology.
Findings
Derived the enumeration formulas for RNA complexes of arbitrary topology.
Linked RNA complex enumeration to chord diagrams and moduli spaces.
Demonstrated the effectiveness of topological recursion in biological enumeration problems.
Abstract
We review a derivation of the numbers of RNA complexes of an arbitrary topology. These numbers are encoded in the free energy of the hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), where s and t are respective generating parameters for the number of RNA molecules and hydrogen bonds in a given complex. The free energies of this matrix model are computed using the so-called topological recursion, which is a powerful new formalism arising from random matrix theory. These numbers of RNA complexes also have profound meaning in mathematics: they provide the number of chord diagrams of fixed genus with specified numbers of backbones and chords as well as the number of cells in Riemann's moduli spaces for bordered surfaces of fixed topological type.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
