1 May 2019 in Operations Research
There is a growing interest in the analysis of networks found in the World Wide Web and in social networks. A common feature of these networks is that the finite-state Markov chain modeling the influence relation between nodes typically has several (nearly) ergodic classes. This paper introduces a new decomposition algorithm for Markov chains that allows to split the graph of the Markov chain into subgraphs such that the connectivity of the chain—measured by the Kemeny constant—is maximally decreased. In other words, we show how the structure dormant in a nearly decomposable chain can be brought to light. We present applications to influence ranking in social networks, decomposition of a social network into subnetworks, and cluster analysis.
4 January 2023 in Computers & Operations Research
22 October 2024 in Computers & Industrial Engineering
17 August 2017 in Queueing Systems
Jackson networks are versatile models for analyzing complex networks. In this paper we study generalized Jackson networks with single-server stations, where nodes may have an infinite supply of work. We allow simultaneous breakdown of servers and consider group repair strategies. We establish the existence of a steady-state distribution of the queue-length vector at stable nodes for different types of failure regimes. In steady state the distribution of the failure/repair regime and of the queue-length vector at stable nodes decouples in a product-form way. We provide closed-form solutions for the classical performance measures such as throughput or mean sojourn time at a station.
27 May 2017 in Discrete Event Dynamic Systems