Reach Us +44-1522-440391
Calculation of Flows Intensities Transformations in Acyclic Directed Networks
ISSN: 2155-6180

Journal of Biometrics & Biostatistics
Open Access

Like us on:

Our Group organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations
700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Calculation of Flows Intensities Transformations in Acyclic Directed Networks

Guram Tsitsiashvili*
Institute of Applied Mathematics Feb RAS, Far Eastern Federal University, Russia
*Corresponding Author: Guram Tsitsiashvili, Institute of Applied Mathematics Feb RAS, Far Eastern Federal University, Russia, Tel: +7 423 243-34-72, Email: [email protected]

Received Date: Nov 02, 2017 / Accepted Date: Nov 15, 2017 / Published Date: Nov 27, 2017

In this paper, a problem of calculation of signals or matters flows intensities in acyclic network is considered and sequential algorithm of its solution is suggesting.

The problem considered in this paper is discussing last year’s sufficiently intensively in different biological journals [1-3]. In Tsitsiashvili [4] a problem of a decomposition of balance equations for flows intensities in queuing networks is solving. Such problem is connecting with calculation of flows intensities of proteins networks. Main idea of this procedure is to find clusters with cyclically equivalent nodes and order them by their maximal distance from input clusters so that direct edges may be only from clusters with smaller to clusters with larger distances. Therefore, it is possible to divide all nodes into sets A0,A1,…,Ap so that every edge of the graph is only from node iAt to node jAq, t<q. Then a solution of balance equations system is dividing into solutions of sub systems for clusters with cyclically equivalent nodes so that these sub systems may be solving sequentially in accordance with their ordering by maximal distances.

However, in queuing theory this problem is connecting with flows of identical customers while in protein networks there are complex transformations of different matters and signals flows. Then at any step of calculations, it is possible to describe in every node j=0,1,…,m, of the network transformation of input signals and/or matters flows intensities Equation into output signals and/ or matters flows intensities Equation. Here the node j=0 is as source so drain. This transformation is defining by some vector function Equation. In simplest cases, this function may be defined using stoichiometric coefficients of some chemical reaction and the principle of limiting factors [5].

Suggesting procedure creates acyclic directed graph nodes, which are clusters of initial directed graph with cyclically equivalent nodes. If we deal with customers (signals) in queuing networks and know input flow intensity then it is possible to calculate output flows intensities for all nodes by solution of a system of linear algebraic equations. These systems of equations are to be solving in accordance with ordering of clusters. However, if we deal with acyclic network then these calculations are very simple to find the distribution of the input stream between network nodes in accordance with routing matrix Equation.

Assume that in our network with finite number of nodes, 0,1,…,m, flows 1,…,n migrate and each kind i of flows moves along acyclic network in accordance with the route matrix Equation so that if node jAq then Equation. Denote Equation proportions of signals or matters flows describing interaction (reaction) between signals or matters at node Equation. Then the function Equation, defining this interaction (reaction), has the form Equation where we put formally Equation. It is necessary to remark that parts of flowsEquation are removed from the network (are directed to the node 0). At the node, 0 we know input flows intensities Equation. In conclusion, it is worthy to say that in this paper ordering of different network nodes is connecting with calculation of flows transformation in single node based on limiting factor. Last procedure may be considering in form that is more complicated.

To realize this procedure it is necessary to use sufficiently developed database of protein networks and sufficiently powerful computer.

The author thanks Bulgakov VP for useful recommendations.


Citation: Tsitsiashvili G (2017) Calculation of Flows Intensities Transformations in Acyclic Directed Networks. J Biom Biostat 8: 379. DOI: 10.4172/2155-6180.1000379

Copyright: © 2017 Tsitsiashvili G. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Select your language of interest to view the total content in your interested language

Post Your Comment Citation
Share This Article
Relevant Topics
Article Usage
  • Total views: 1193
  • [From(publication date): 0-2017 - Dec 07, 2019]
  • Breakdown by view type
  • HTML page views: 1140
  • PDF downloads: 53