Graphs and Stochastic Automata Networks 1
نویسنده
چکیده
We show how some graph theoretical arguments may be used to reduce the complexity of the computation of the steady-state distribution of Markov chain. We consider the directed graph associated to a Markov chain derived from a Stochastic Automata Network (SAN). The structural properties of the automata are used to establish new various results. First, we establish the complexity of the resolution for Stochastic Automata Networks with a sparse matrix representation of the automata. This results are used to compare simple SAN (i.e. without functions) with methods which generates a sparse representation of Markov chains (i.e. Markovian Petri Nets for instance) on some examples. Then, we show how to apply state reduction techniques on a chain associated to a SAN. We present an algorithm to solve the steady-state equations and we prove its complexity. Finally, we extend our algorithm to allow the semi-parametric analysis of Stochastic Automata Networks.
منابع مشابه
Stochastic graph as a model for social networks
Social networks are usually modeled and represented as deterministic graphs with a set of nodes as users and edges as connection between users of networks. Due to the uncertain and dynamic nature of user behavior and human activities in social networks, their structural and behavioral parameters are time varying parameters and for this reason using deterministic graphs for modeling and analysis...
متن کاملFinding Minimum Vertex Covering in Stochastic Graphs: A Learning Automata Approach
Structural and behavioral parameters of many real networks such as social networks are unpredictable, uncertain and time varying parameters and for these reasons deterministic graphs for modeling such networks are too restrictive to solve most of the real network problems. It seems that stochastic graphs, in which weights associated to the vertices are random variable, may be a better graph mod...
متن کاملSampling algorithms for stochastic graphs: A learning automata approach
Recently, there has been growing interest in social network analysis. Graph models for social network analysis are usually assumed to be a deterministic graph with fixed weights for its edges or nodes. As activities of users in online social networks are changed with time, however, this assumption is too restrictive because of uncertainty, unpredictability and the time-varying nature of such re...
متن کاملFinding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
Because of unpredictable, uncertain and time-varying nature of real networks it seems that stochastic graphs, in which weights associated to the edges are random variables, may be a better candidate as a graph model for real world networks. Once the graph model is chosen to be a stochastic graph, every feature of the graph such as path, clique, spanning tree and dominating set, to mention a few...
متن کاملLearning Automata-Based Algorithms for Finding Minimum Weakly Connected Dominating Set in Stochastic Graphs
A weakly connected dominating set (WCDS) of graph is a subset of so that the vertex set of the given subset and all vertices with at least one endpoint in the subset induce a connected sub‐graph of . Finding the WCDS is a new promising approach for clustering the wireless networks. The minimum WCDS (MWCDS) problem is known to be NP‐hard, and several approximation algo...
متن کامل