Modeling Discrete Combinatorial Systems as Alphabetic Bipartite Networks: Theory and Applications
Monojit Choudhury, Niloy Ganguly, Abyayananda Maiti, Animesh, Mukherjee, Lutz Brusch, Andreas Deutsch, Fernando Peruani

TL;DR
This paper models discrete combinatorial systems like DNA and language as alphabetic bipartite networks, deriving their growth dynamics and degree distributions, and applies the theory to real-world genetic and linguistic data.
Contribution
It extends analytical models of alphabetic bipartite networks and empirically investigates their application to genetic and linguistic systems.
Findings
Degree distributions follow beta distributions asymptotically.
Theoretical predictions match real-world data.
Growth mechanisms can be inferred from degree distributions.
Abstract
Life and language are discrete combinatorial systems (DCSs) in which the basic building blocks are finite sets of elementary units: nucleotides or codons in a DNA sequence and letters or words in a language. Different combinations of these finite units give rise to potentially infinite numbers of genes or sentences. This type of DCS can be represented as an Alphabetic Bipartite Network (-BiN) where there are two kinds of nodes, one type represents the elementary units while the other type represents their combinations. There is an edge between a node corresponding to an elementary unit and a node corresponding to a particular combination if is present in . Naturally, the partition consisting of the nodes representing elementary units is fixed, while the other partition is allowed to grow unboundedly. Here, we extend recently analytical findings for -BiNs…
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.
