Modeling discrete combinatorial systems as alphabetic bipartite networks: Theory and applications - Laboratoire Jean-Alexandre Dieudonné Accéder directement au contenu
Article Dans Une Revue Physical Review E : Statistical, Nonlinear, and Soft Matter Physics Année : 2010

Modeling discrete combinatorial systems as alphabetic bipartite networks: Theory and applications

Résumé

Genes and human languages 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 DCSs can be represented as an alphabetic bipartite network (ABN) where there are two kinds of nodes, one type represents the elementary units while the other type represents their combinations. Here, we extend and generalize recent analytical findings for ABNs derived in [ Peruani et al. Europhys. Lett. 79 28001 (2007)] and empirically investigate two real world systems in terms of ABNs, the codon gene and the phoneme-language network. The one-mode projections onto the elementary basic units are also studied theoretically as well as in real world ABNs. We propose the use of ABNs as a means for inferring the mechanisms underlying the growth of real world DCSs.
Fichier principal
Vignette du fichier
0811.0499.pdf (625.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00905226 , version 1 (17-11-2013)

Identifiants

Citer

Monojit Choudhury, Niloy Ganguly, Abyayananda Maiti, Animesh Mukherjee, Lutz Brusch, et al.. Modeling discrete combinatorial systems as alphabetic bipartite networks: Theory and applications. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, 2010, 81 (3), pp.036103. ⟨10.1103/PhysRevE.81.036103⟩. ⟨hal-00905226⟩
115 Consultations
180 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More