Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A key task in analyzing social networks and other complex networks is role analysis: describing and categorizing nodes by how they interact with other nodes. Two nodes have the same role if they interact with equivalent sets of neighbors. The most fundamental role equivalence is automorphic equivalence. Unfortunately, the fastest algorithm known for graph automorphism is nonpolynomial. Moreover, since exact equivalence is rare, a more meaningful task is measuring the role similarity beten any two nodes. This task is closely related to the link-based similarity problem that SimRank addresses. Hover, SimRank and other existing simliarity measures are not sufficient because they do not guarantee to recognize automorphically or structurally equivalent nodes.  makes two contributions. First,  present and justify several axiomatic properties necessary for a role similarity measure or metric. Second,  present RoleSim, a role similarity metric which satisfies these axioms and which can be computed with a simple iterative algorithm.  rigorously prove that RoleSim satisfies all the axiomatic properties and demonstrate its superior interpretative por on both synthetic and real datasets.
['Ruoming Jin', 'Victor E. Lee', 'Hui Hong']
I am writing a research paper on a idea Axiomatic ranking of network role similarity
[{"from": "human", "value": "I am writing a research paper on a idea Axiomatic ranking of network role similarity"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A key task in analyzing social networks and other complex networks is role analysis: describing and categorizing nodes by how they interact with other nodes. Two nodes have the same role if they interact with equivalent sets of neighbors. The most fundamental role equivalence is automorphic equivalence. Unfortunately, the fastest algorithm known for graph automorphism is nonpolynomial. Moreover, since exact equivalence is rare, a more meaningful task is measuring the role similarity beten any two nodes. This task is closely related to the link-based similarity problem that SimRank addresses. Hover, SimRank and other existing simliarity measures are not sufficient because they do not guarantee to recognize automorphically or structurally equivalent nodes.  makes two contributions. First,  present and justify several axiomatic properties necessary for a role similarity measure or metric. Second,  present RoleSim, a role similarity metric which satisfies these axioms and which can be computed with a simple iterative algorithm.  rigorously prove that RoleSim satisfies all the axiomatic properties and demonstrate its superior interpretative por on both synthetic and real datasets."}]