On cycles in functional graphs of circulant type gene networks with threshold functions
Prikladnaya Diskretnaya Matematika. Supplement, no. 7 (2014), pp. 122-124
Cet article a éte moissonné depuis la source Math-Net.Ru
In this paper, the functioning of circulant type gene networks with threshold function are studied. All states of a system are classified according to the length of $0$-series and $1$-series. It is shown that all cycles of a functional graph are divided into two groups: cycles composed of states with long series and cycles composed of states with short series. Some lower estimate of the number of cycles in a functional graph is obtained. A construction for building cycles composed of states with short series is given.
Keywords:
gene network, threshold functions, functional graph, cycles of functional graph, states with long series, states with short series.
@article{PDMA_2014_7_a51,
author = {I. S. Bykov},
title = {On cycles in functional graphs of circulant type gene networks with threshold functions},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {122--124},
year = {2014},
number = {7},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2014_7_a51/}
}
I. S. Bykov. On cycles in functional graphs of circulant type gene networks with threshold functions. Prikladnaya Diskretnaya Matematika. Supplement, no. 7 (2014), pp. 122-124. http://geodesic.mathdoc.fr/item/PDMA_2014_7_a51/
[1] Evdokimov A. A., Likhovidova E. O., “Diskretnaya model gennoi seti tsirkulyantnogo tipa s porogovymi funktsiyami”, Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaya tekhnika i informatika, 2008, no. 2, 18–21
[2] Bykov I. S., “Funktsionirovanie diskretnykh modelei gennykh setei tsirkulyantnogo tipa s porogovymi funktsiyami”, Materialy IX molodezhnoi nauchn. shkoly po diskretnoi matematike i eë prilozheniyam, MGU, 2013, 26–31