Some have proposed that for a natural centrality measure, the most central a node can get is the cen

Justine Webster 2022-05-07 Answered
Some have proposed that for a natural centrality measure, the most central a node can get is the center node in the star network. I've heard this called "star maximization." That is, for a measure M ( ), and a star network g with center c ,
{ ( c , g ) } arg max ( i , g ) N × G ( N ) M ( i , g )
where N is the set of nodes and G considers all unweighted network structures.

I'd like to learn about some centrality measures that don't satisfy this property, but "star maximization" isn't a heavily used term, so I am having trouble in searching for many such measures. What are some such measures of centrality?
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

noruegezajl00y
Answered 2022-05-08 Author has 8 answers
A centrality measure will display star maximization under very weak conditions.
Suppose you normalize the sum of centralities to 1. Then as long as you assign zero centrality to peripheral nodes (those connected to just one other node) the centre must have the maximal centrality 1.
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Relevant Questions

asked 2022-05-01
If X Poisson ( λ ), prove that P [ X = k ] is maximized at k = λ

How would I go about proving something like this so that the method would work to prove a maximization point of other random variables like say Binomial is max at k = ( n + 1 ) p?
asked 2022-05-07
Let x R n and let P be a n × n positive definite symmetrix matrix. It is known that the maximum of
maximize x T P x subject to x T x 1
is λ max ( P ), the largest eigenvalue of P. Now consider the following problem
maximize x T P x subject to ( x a ) T ( x a ) 1
where a R n is known. What is the analytical solution?
asked 2022-05-10
Let f ( x , y ) : R × R R be a continuous and differentiable function. When can we claim that the following holds true:
d d x max y R f ( x , y ) = max y R x f ( x , y )
assuming that both max y R f ( x , y ) and max y R x f ( x , y ) exists.
asked 2022-05-08
Let X { 0 , 1 } d be a Boolean vector and Y , Z { 0 , 1 } are Boolean variables. Assume that there is a joint distribution D over Y , Z and we'd like to find a joint distribution D over X , Y , Z such that:

1. The marginal of D on Y, Z equals D .
2. X are independent of Z under D , i.e., I ( X ; Z ) = 0.
3. I ( X ; Y ) is maximized,

where I ( ; ) denotes the mutual information. For now I don't even know what is a nontrivial upper bound of I ( X ; Y ) given that I ( X ; Z ) = 0? Furthermore, is it possible we can know the optimal distribution D that achieves the upper bound?

My conjecture is that the upper bound of I ( X ; Y ) should have something to do with the correlation (coupling?) between Y and Z, so ideally it should contain something related to that.
asked 2022-04-06
Let us consider a linear programming problem shown below:
min x f ( x ) c
where, f ( x ) is a linear function of x. Now, can be following maximization problem be considered as an equivalent to the above minimization problem?
max x ( 1 f ( x ) c )
asked 2022-05-09
A huge conical tank to be made from a circular piece of sheet metal of radius 10m by cutting out a sector with vertex angle theta and welding the straight edges of the straight edges of the remaining piece together. Find theta so that the resulting cone has the largest possible volume.

Specifically, the question is asked in the context of wanting derivatives, multiple max/min equations, and hopefully more calc rather than trig or geo.

I have gotten as far as using 10m as the hypotenuse for a triangle formed by the height of the cone, radius of the base of the cone, and slant. I'm not sure where to go from there, because I can't determine how to find height and/or radius, without which I'm not sure I can continue.
asked 2022-05-09
Show that f ( x 1 , . . . x n ) = max { f ( x 1 , . . . , x n ) : ( x 1 , . . . , x n ) Ω } if and only if f ( x 1 , . . . x n ) = min { f ( x 1 , . . . , x n ) : ( x 1 , . . . , x n ) Ω }
I am not exactly sure how to approach this problem -- it is very general, so I can't assume anything about the shape of f. It seems obvious that flipping the max problem with a negative turns it into a min problem. Thoughts?