FURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES

On the convergence of uncertain random sequences

In this paper, a useful inequality for central moment of uncertain random variables is proved. Based on this inequality, a convergence theorem for sum of uncertain random variables is derived. A Borel–Cantelli lemma for chance measure is obtained based on the continuity assumption of uncertain measure. Finally, several convergence theorems for uncertain random sequences are established.

SOME RESULTS OF MOMENTS OF UNCERTAIN RANDOM VARIABLES

Chance theory is a mathematical methodology for dealing with indeterminatephenomena including uncertainty and randomness.Consequently, uncertain random variable is developed to describe the phenomena which involveuncertainty and randomness.Thus, uncertain random variable is a fundamental concept in chance theory.This paper provides some practical quantities to describe uncertain random variable...

Convergence of complex uncertain sequences

Complex uncertain variables are measurable functions from an uncertainty space to the set of complex numbers and are used to model complex uncertain quantities. This paper introduces the convergence concepts of complex uncertain sequences: convergence almost surely (a.s.), convergence in measure, convergence in mean, convergence in distribution and convergence uniformly almost surely. In additi...

Further results on $L$-ordered fuzzifying convergence spaces

In this paper,  it is shown that the category of $L$-ordered fuzzifying convergence spaces contains the category of pretopological $L$-ordered fuzzifying convergence spaces as a bireflective subcategory and the latter contains the category of topological $L$-ordered fuzzifying convergence spaces as a bireflective subcategory. Also, it is proved that the category of $L$-ordered fuzzifying conver...

On the convergence of uncertain sequences

Further Results on Betweenness Centrality of Graphs

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.