Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: stochastic graph

Sortuj według:

Ogranicz wyniki do:

Stochastic Bounded Diameter Minimum Spanning Tree Problem

Torkestani J. A.

Fundamenta Informaticae

2015

Vol. 140, nr 2

205--219

In this paper, a learning automata-based algorithm is proposed for approximating a near optimal solution to the bounded diameter minimum spanning tree (BDMST) problem in stochastic graphs. A stochastic graph is a graph in which the weight associated with each edge is a random variable. Stochastic BDMST problem seeks for finding the BDMST in a stochastic graph. To the best of our knowledge, no work has been done on solving the stochastic BDMST problem, where the weight associated with the graph edge is random variable. In this study, we assume that the probability distribution of the edges random weight is unknown a priori. This makes the stochastic BDMST problem incredibly hard-to-solve. To show the efficiency of the proposed algorithm, its results are compared with those of the standard sampling method (SSM). Numerical results show the superiority of the proposed sampling algorithm over the SSM both in terms of the sampling rate and convergence rate.

A stochastic graph as a specific tool of mathematization and argumentation

Krech I.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

2011

Vol. 16

245--248

The article presents a stochastic graph as a tool enabling us to show the equality of the event probability without calculating the probability as such. A very important factor here is that the discussed events come from different probabilistic spaces being models of specific Markov chains.

Stochastic graphs and their applications

Tlustý P., Rost P.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

2007

Vol. 12

435-440

The article deals with one example of so called stochastic graph. The paper demonstrates some of possible applications of stochastic graphs in practice using the well known example about seven bridges of the town of Königsberg.