No abstract

Recently, Yager has established that the notion of q-rung orthopair fuzzy set (q-ROFS) is more accomplished than pythagorean fuzzy set (PyFS) and intuitionistic fuzzy set (IFS) to cope with awkward and complicated information in real decision theory. This notion works with yes-, no- and refusal-type fuzzy information. The constraint of q-ROFS is that the sum of n-power of the truth grade and the n-power of the falsity grade is bounded to unit interval. Generalized dice similarity measures are complimentary concepts quantifying the difference and closeness of q-ROFSs. In this paper, we suggested a number of novel dice similarity measures (DSMs) in the surroundings of the q-ROFS, and we examined some prevailing dice similarity measures and their limitations. In addition, we took the DSMs broad view to some globalized dice similarity measures (GDSMs), and we examined some of their particular cases. We employed the novel suggested GDSMs to the best selections of items on identification problems, and we analyzed their acquired consequences. There is a development of novel work in which many situations are evaluated, and from this perspective, the suggested work is changed into already prevailing work. This study also examines the merits of novel DSMs and the limitations for DSMs of IFSs and PyFSs. The comparison between established measures with existing measures is explored and their graphical interpretations are also discussed to show the reliability and effectiveness of the explored measures.

No abstract

Many networks generated by nature have two generic properties: they are formed in the process of preferential attachment and they are scale-free. Considering these features, by interfering with mechanism of the preferential attachment, we propose a generalisation of the Barabási–Albert model—the ’Fractional Preferential Attachment’ (FPA) scale-free network model—that generates networks with time-independent degree distributions p ( k ) ∼ k − γ with degree exponent 2 < γ ≤ 3 (where γ = 3 corresponds to the typical value of the BA model). In the FPA model, the element controlling the network properties is the f parameter, where f ∈ ( 0 , 1 ⟩ . Depending on the different values of f parameter, we study the statistical properties of the numerically generated networks. We investigate the topological properties of FPA networks such as degree distribution, degree correlation (network assortativity), clustering coefficient, average node degree, network diameter, average shortest path length and features of fractality. We compare the obtained values with the results for various synthetic and real-world networks. It is found that, depending on f, the FPA model generates networks with parameters similar to the real-world networks. Furthermore, it is shown that f parameter has a significant impact on, among others, degree distribution and degree correlation of generated networks. Therefore, the FPA scale-free network model can be an interesting alternative to existing network models. In addition, it turns out that, regardless of the value of f, FPA networks are not fractal.