نتایج جستجو برای: generating random variables
تعداد نتایج: 666238 فیلتر نتایج به سال:
Using an averaged generating function for coloured hard-dimers, some random variables of interest are studied. The main result lies in the fact that all their probability distributions obey a central limit theorem.
Abstract: In this paper a non-repairable multi-state system with imprecise probabilities and performance rates are taken, representing imprecise probabilities by interval valued probabilities. These intervals are evaluated by computing bound of interval valued ordinary differential equation of the system. For imprecise performance rates random fuzzy variables are introduced. The proposed method...
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the mi...
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...
let $g$ be a molecular graph with vertex set $v(g)$, $d_g(u, v)$ the topological distance between vertices $u$ and $v$ in $g$. the hosoya polynomial $h(g, x)$ of $g$ is a polynomial $sumlimits_{{u, v}subseteq v(g)}x^{d_g(u, v)}$ in variable $x$. in this paper, we obtain an explicit analytical expression for the expected value of the hosoya polynomial of a random benzenoid chain with $n$ hexagon...
Let (Xn) be a sequence of independent and identically distributed random variables, with common absolutely continuous distribution F . An observation Xn is a near-record if Xn ∈ (Mn−1 − a, Mn−1], where Mn = max{X1, . . . , Xn} and a > 0 is a parameter. We analyze the point process η on [0,∞) of near-record values from (Xn), showing that it is a Poisson cluster process. We derive the probability...
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning tree of G chosen uniformly at random among the spanning trees of G. The expected running time is O(n logn) per generated tree for almost all graphs, and O(n3) for the worst graphs. Previously known deterministic algorithms and much more complicated and require O(n3) ti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید