Dependence Relations and Grade Fuzzy Set

With the aim of developing the recent theory of dependence relations, we elaborate a procedure to measure the strength of the influence of an element on another with respect to a given dependence relation on a finite set. We call this measure the degree of influence. Its definition is based on a partial hyperoperation and a directed graph which we associate with any dependence relation. We compute the degree of influence in various examples and prove some general properties. Among these properties, we find symmetries that have the potential to be applied in the realization of effective algorithms for the computations.