We study bounds on the rate of convergence to the stationary distribution in monotone separable networks which are represented in terms of stochastic recursive sequences. Monotonicity properties of this subclass of Markov chains allow us to formulate conditions in terms of marginal network characteristics. Two particular examples, generalized Jackson networks and multiserver queues, are conside...

Inferring Hidden Trust Relationships in Social Networks for Encouraging Collaboration and Cooperation among Individuals Edeilson Milhomem Silva, Diego Oliveira Rodrigues, Jackson Gomes De Souza, Parcilene Fernandes De Brito, Ana Carolina Salgado, Silvio Romero Lemos Meira and José Alfredo F. Costa Providing Awareness, Understanding and Control of Personalized Stream Filtering in a P2P Social Ne...

We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply the stronger logarithmic limit than that in Glasserman and Kou(1995) when several nodes have the same maximal load.

This note presents a self-contained and streamlined exposition of chemical-network results due to Feinberg, Horn, and Jackson. As an application, it shows the global asymptotic stability to equilibria of McKeithan’s kinetic proofreading model for T-cell receptor signal transduction.

There is a critical need for data-mining methods that can identify SNPs that predict among individual variation in a phenotype of interest and reverse-engineer the biological network of relationships between SNPs, phenotypes, and other factors. This problem is both challenging and important in light of the large number of SNPs in many genes of interest and across the human genome. A potentially...

We consider a variant of the two node tandem Jackson network where the upstream server reduces its service rate when the downstream queue exceeds some prespecified threshold. The rare event of interest is the overflow of the downstream queue. Based on a game/subsolution approach, we rigorously identify the exponential decay rate of the rare event probabilities and construct asymptotically optim...