LISTSERV mailing list manager LISTSERV 16.0

Help for SOCNET Archives


SOCNET Archives

SOCNET Archives


SOCNET@LISTS.UFL.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SOCNET Home

SOCNET Home

SOCNET  April 2018

SOCNET April 2018

Subject:

Re: Cumulative Rank Aggregation of a Family of Network Centrality Indices

From:

Moses Boudourides <[log in to unmask]>

Reply-To:

Moses Boudourides <[log in to unmask]>

Date:

Tue, 3 Apr 2018 14:29:27 +0300

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (132 lines)

*****  To join INSNA, visit http://www.insna.org  *****

Thanks, Ian!

What I'm trying to do is NOT:

* to compare separate centrality indices to each other either to
benchmark them or to assess which centrality index performs better
than some other
* or locate a super node (according to separate indices or all of them
lumped together).

What I'm trying to do is:

1. To RANK all network nodes according to each separate centrality
index, obtaining K rankings of nodes (where K is the number of
centrality indices with regards to which I'm measuring the importance
of nodes). Of course, each ranking has a super/top node but I'm not
interested in it. I'm interested in the relative positions, in which
each node is placed in the order for every centrality ranking among
the K ones.
2. To extract a "meta-ranking" from the above K rankings as if each
nodal ranking was a "ranked choice/vote" that (metaphorically) that
each centrality index was casting in a preferential ballot. Of course,
the individual "vote" of each centrality index would have one or more
super/top nodes according to the importance attributed by this
centrality index. However, in preferential ballots this is not the way
that winners are counted. In Social Choice theory, there are many
different ways which count the winning outcomes always as rankings
(see for example
https://urldefense.proofpoint.com/v2/url?u=https-3A__en.wikipedia.org_wiki_Category-3APreferential-5Felectoral-5Fsystems&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=9y-a4z8dsXcr7C24IGS6Ows-UfngAJS29hBQLxjLEw4&s=6C94M1TqZshSwuzH3gajksB9B0y_sXRa7Brsra6nkUY&e=).
In my case, since each centrality index produces a ranking, I am
trying to find a winning meta-ranking among all the individual
rankings.

Why would one want to do this?

Because by computing "distances" between the overall meta-ranking and
a partial subset of rankings (corresponding to a smaller subfamily of
centrality indices), one might say which ones among the centrality
indices (actually among a potentially large number of them that
nowadays can be easily computed) really matters and which ones are in
fact redundant (and it doesn't make any sense that one would bother to
include them in one's network computations, always for a particular
social network). To give a hypothetical example: Why should one bother
to compute both, let's say, degree, closeness, betweenness, PageRank
and eigenvector centralities, when the meta-ranking wouldn't change
considerably if, let's say, eigenvector or closeness centrality was
omitted? Of course, an obvious objection might be that this method is
only a posteriori useful, but think of the case that one would
subsequently need to process a number of computationally-demanding
statistical models, which would be groundlessly loaded by including a
number of redundant (in the above sense) centrality indices.

That was supposed to be my 0.02 bitcoins!

On Tue, Apr 3, 2018 at 1:34 PM, McCulloh, Ian A.
<[log in to unmask]> wrote:
> Moses,
>
> Thanks for sharing and maintaining a blog.
>
> I often find differences in centrality more interesting. One common approach
> I use is to plot two measures against each other, such as degree and
> betweenness. Centrality measures tend to be correlated (on my phone or I’d
> share refs, but there are pubs on this by me, Valente, Contractor). So, when
> you see a node stand out that is high in betweenness and low in degree, you
> have evidence of structural holes.
>
> I think of betweenness, closeness, degree, much like median, mean, and mode.
> All three (six actually) are measures of center. All tell you something a
> bit different. The differences are interesting (eg income median vs mean).
> The comparisons are really fascinating.
>
> So, I’d encourage you to think what do centrality patterns tell us about the
> structure than to locate a super node. Just my $0.02.
>
> Ian
>
> Ian McCulloh, PhD
> Johns Hopkins University
> 240-506-3417
>
> From: Moses Boudourides <[log in to unmask]>
> Date: Sunday, Apr 01, 2018, 5:20 PM
> To: [log in to unmask] <[log in to unmask]>
> Subject: [SOCNET] Cumulative Rank Aggregation of a Family of Network
> Centrality Indices
>
> *****  To join INSNA, visit https://urldefense.proofpoint.com/v2/url?u=http-3A__www.insna.org&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=9y-a4z8dsXcr7C24IGS6Ows-UfngAJS29hBQLxjLEw4&s=0fvf6N0fUKeBaSufkg2Naf4mXTfrejTA-JQvhKirvso&e=  *****
>
> Hello everybody,
>
> You might be interested in the following brief report "Cumulative Rank
> Aggregation of a Family of Network Centrality Indices" that  I've just
> entered in my Medium blog:
>
> https://urldefense.proofpoint.com/v2/url?u=https-3A__medium.com_-40mosabou_cumulative-2Drank-2Daggregation-2Dof-2Da-2Dfamily-2Dof-2Dnetwork-2Dcentrality-2Dindices-2De625a76bf7e4&d=DwIBaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=KKhLpuoSdgNSblj5QR8GGUVheVaGB91lw9aMaPeyHVY&s=qiuVA8Rto15u_Dhmq4ASKtLkZOz4f-KZba61k28Bv54&e=
>
> A growing number of centrality indices are used today in social
> network analysis. The purpose of using all these network centrality
> measures is that through them one might be able to identify the most
> important nodes according to a variety of structural criteria (like
> nodal degree, closeness, betweenness, eigenvector, PageRank etc.).
> Moreover, computations (in Python, R etc. or standalone applications)
> may very easily derive the tables of various centrality indices of
> network nodes. Therefore, knowing a good deal of network nodal
> centralities, the crucial question would be how to make sense for all
> such indices in a illuminating way that would account for the
> structural features that an empirical network exhibits. What I am
> proposing here is a methodology for a cumulative ranking of network
> nodes according to the scores that each node possesses, not on a
> single centrality measure, but on a whole group (a family) of
> centrality measures.
>
> Any remarks, corrections, comments, suggestions etc are more than welcomed.
>
> Best,
>
> --Moses
>
> _____________________________________________________________________
> SOCNET is a service of INSNA, the professional association for social
> network researchers (https://urldefense.proofpoint.com/v2/url?u=http-3A__www.insna.org&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=9y-a4z8dsXcr7C24IGS6Ows-UfngAJS29hBQLxjLEw4&s=0fvf6N0fUKeBaSufkg2Naf4mXTfrejTA-JQvhKirvso&e=). To unsubscribe, send
> an email message to [log in to unmask] containing the line
> UNSUBSCRIBE SOCNET in the body of the message.

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008, Week 62
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001

ATOM RSS1 RSS2



LISTS.UFL.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager