English

Topological transition in disordered planar matching: combinatorial arcs expansion

Statistical Mechanics 2015-06-22 v2 Disordered Systems and Neural Networks Combinatorics

Abstract

In this paper, we investigate analytically the properties of the disordered Bernoulli model of planar matching. This model is characterized by a topological phase transition, yielding complete planar matching solutions only above a critical density threshold. We develop a combinatorial procedure of arcs expansion that explicitly takes into account the contribution of short arcs, and allows to obtain an accurate analytical estimation of the critical value by reducing the global constrained problem to a set of local ones. As an application to a toy representation of the RNA secondary structures, we suggest generalized models that incorporate a one-to-one correspondence between the contact matrix and the RNA-type sequence, thus giving sense to the notion of effective non-integer alphabets.

Keywords

Cite

@article{arxiv.1406.5537,
  title  = {Topological transition in disordered planar matching: combinatorial arcs expansion},
  author = {Andrey Y. Lokhov and Olga V. Valba and Sergei K. Nechaev and Mikhail V. Tamm},
  journal= {arXiv preprint arXiv:1406.5537},
  year   = {2015}
}

Comments

28 pages, 6 figures, published version

R2 v1 2026-06-22T04:43:45.501Z