• Aucun résultat trouvé

Contextual centrality: going beyond network structure

N/A
N/A
Protected

Academic year: 2021

Partager "Contextual centrality: going beyond network structure"

Copied!
10
0
0

Texte intégral

Loading

Figure

Figure 2 displays the relative change between CC’s average payoff and the maximum average payoff of the  other centrality measures aggregated over 100 runs of simulations for varying values of  σ y ( )y  and pλ 1  on three  different types of simulated gra
Figure 3.  Average payoffs when standardized average contribution is 0. Here we show the average payoff with  95% confidence interval when seeding with different methods on (a) Barabasi-Albert, (b) Erdos-Renyi, and (c)  Watts-Strogatz models.
Figure 7.  Homophily and maximum of contextual centrality when pλ 1  < 1. We regress the maximum of  contextual centrality on homophily after controlling for  σ y ( )y  and pλ 1

Références

Documents relatifs

We conducted two types of experiments: in the first type we evaluate the quality of the solution produced by the greedy algorithm by measuring the approxi- mation ratio on

In order to evaluate the proposed centrality measure we computed the mint centrality for the first 200,000 blocks of the public bitcoin blockchain.. We then inspected the 50

To determine a variation of betweenness centrality we will use the methods of cooperative game theory using the model of the communication game developed by Myerson.. Cooperative

The well known concept of eingenvector centrality for graphs is extended to weighted multi-hypergraphs and we present a model instantiation for centrality analysis in

Section 3 introduces principles of net- work’s dynamic, dynamic evaluation of the neighbourhood of the selected author and our approach in the directed network created from DBLP

The modulus of the Overlapping Modular Betweenness centrality performs better than the standard measure with an average gain that ranges between 39% and 47% in networks

In this section, we analyze the evolution of the number of clusters when both threshold and the fraction of the top ranked nodes are combined and the size of the network changes.

Simulation results on different synthetic and real-world networks show that it outperforms Degree, Betweenness and Comm centrality in term of the epidemic size in networks with