Advisors
Now showing items 1-5 of 5
-
Analysis of large Markov chains using stochastic automata networks
(Bilkent University, 2001-07)This work contributes to the existing research in the area of analysis of finite Markov chains (MCs) modeled as stochastic automata networks (SANs). First, this thesis extends the near complete decomposability concept of ... -
Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
(Bilkent University, 2007)This thesis extends two approximative fixed–point iterative methods based on decomposition for closed queueing networks (QNs) with Coxian service distributions and arbitrary buffer sizes from the literature to include ... -
Kronecker-based infinite level-dependent QBDS : matrix analytic solution versus simulation
(Bilkent University, 2011)Markovian systems with multiple interacting subsystems under the influence of a control unit are considered. The state spaces of the subsystems are countably in- finite, whereas that of the control unit is finite. A ... -
On the numerical analysis of infinite multi-dimensional Markov chains
(Bilkent University, 2017-07)A system with multiple interacting subsystems that exhibits the Markov property can be represented as a multi-dimensional Markov chain (MC). Usually the reachable state space of this MC is a proper subset of its product ... -
Steady-state analysis of Google-like stochastic matrices
(Bilkent University, 2007)Many search engines use a two-step process to retrieve from the web pages related to a user’s query. In the first step, traditional text processing is performed to find all pages matching the given query terms. Due to ...
