Relation between node to other nodes in a graph

Question

I am simulating a system and in this system there are number of variables that affect each other. Despite what or how the effect is, I am presenting this as an undirected, weighted graph where vertices represent these variables and the edges have weights which represent the level of relation between two variables (higher value means higher relation). In my simulation, I want to choose a node at random (say v ), and check the level of relation between node v and other predefined nodes (say u1, u2, and u3 ) in the network. For instance, if node v is strongly associated with all of the predefined nodes, then it will get a higher score than the one which is less associated with them. My question is, if I got the level of association between node v and each node from the predefined nodes ( u1 , u2 , and u3 ) individually and then sum them up. ie if function f calculates the level of association:

AssociationOf(v) = f(v,u1) + f(v, u2) + f(v, u3)

Do you think that this is the right way to do it, given that it is important that the score should reflect the level of association between node v and all predefined nodes TOGETHER? And by together I mean the score needs to reflect the association between node v wrt u1 AND u2 AND u3 (and not u1 OR u2 OR u3).

I hope that it was clear Thank you

Answer 1

从您的解释“权重代表两个变量之间的关系级别（较高的值表示较高的关系）”，我认为您的函数已经满足了该约束。根据您的拓扑和约束，我看不到任何问题。