Question: Graph Centrality measure
0
gravatar for Saeed Rahmani
2.9 years ago by
Iran/Zanjan/University of Zanjan
Saeed Rahmani10 wrote:

I had read a paper of "Characterization of protein-interaction networks in tumors", In table of graph parameters, It has a parameter of Graph Centrality and said:

GCi = 1/ max(d(i,j)

enter image description here

and describe:

max(d(i,j)) is the length of the shortest path between vertices i and j for a given vertices i. This is a define to d(i,j).

I think this is wrong and :

max(d(i,j)) is the longest length of the shortest path between vertices i and j for a given vertices i.

This parameter what is say? and I think right?

ADD COMMENTlink modified 2.9 years ago • written 2.9 years ago by Saeed Rahmani10
1
gravatar for Girolamo
2.9 years ago by
Girolamo140
Italia
Girolamo140 wrote:

The length of the shortest path between a pair of nodes is the number of nodes you have to traverse from node i to node j. You can have many shortest paths between the node i and node j but they have always the same length. So, I think that the definition of the paper is right.

ADD COMMENTlink written 2.9 years ago by Girolamo140
1

Your definition of shortest path might be correct, but the title of post asks about 'Centrality', which is something else. I don't know the paper nor do I understand the question, so I can not really say anything else about it - but maybe provide a link to wikipedia talking about Graph Centrality. There are many different centrality measurements.

ADD REPLYlink modified 2.9 years ago • written 2.9 years ago by LLTommy1.2k

Yes, there are many dfferent centrality measurements, but OP only asked about a specific vertex centrality

ADD REPLYlink modified 2.9 years ago • written 2.9 years ago by russhh4.3k

Hi, Thanks. No it is Graph Centrality, different of Closeness, Betweenness, Degree, Vertex Centralizes.

ADD REPLYlink written 2.9 years ago by Saeed Rahmani10
Please log in to add an answer.

Help
Access

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.
Powered by Biostar version 2.3.0
Traffic: 1088 users visited in the last hour