Node-based generalized friendship paradox fails

HIGHLIGHTS

• who: Anna Evtushenko from the DepartmentCornell University have published the research: Node-based generalized friendship paradox fails, in the Journal: Scientific Reports Scientific Reports
• what: The authors show that this is not possible, because the authors are able to show the following result: for every finite graph G, there is a constant u033aG and amp;lt; 1 such that any attribute sample in G whose correlation with the degree sequence exceeds u033aG must produce a non-negative gap.
• how: The authors are looking at connected graphs but similar to the Friendship Paradox the . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.