Paolo Boldi
Datos Biográficos
| ID | 1757599 |
|---|---|
| NOMBRE | Paolo Boldi |
| NOMBRES | Paolo |
| APELLIDO | Boldi |
| FIRMA | BOLDI P |
| AFILIACIONES | University of Milan |
| ORCID | 0000-0002-8297-6255 |
| VERIFICADO | Sí |
| TOTAL DE OBRAS | 4 |
| TOTAL DE CITAS | 7 |
| TOTAL COMO AUTOR | 4 |
| TOTAL COMO EDITOR | 0 |
| PRIMER AÑO DE PUBLICACIÓN | 2013 |
| AÑO MÁS RECIENTE DE PUBLICACIÓN | 2024 |
| ÍNDICE H | 2 |
Score and rank semi-monotonicity for closeness, betweenness, and distance–decay centralities
Among the properties describing the behavior of centrality measures with respect to network modifications, score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the importance of the target with respect to the remaining nodes. It is known (Boldi and Vigna Intern Math 10:222–262, 2014, Boldi et al. Netw Sci 5(4):529–550, 2017) that score and rank mon…
Monotonicity in undirected networks
Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the importance of the target of the arc relatively to the r…
Rank monotonicity in centrality measures
A measure of centrality is rank monotone if after adding an arc x → y , all nodes with a score smaller than (or equal to) y have still a score smaller than (or equal to) y . If, in particular, all nodes with a score smaller than or equal to y get a score smaller than y (i.e., all ties with y are broken in favor of y ), the measure is called strictly rank monotone . We prove that harmonic centrality is strictly rank monotone, whereas closeness is …
Robustness of social and web graphs to node removal
Rank monotonicity in centrality measures
A measure of centrality is rank monotone if after adding an arc x → y , all nodes with a score smaller than (or equal to) y have still a score smaller than (or equal to) y . If, in particular, all nodes with a score smaller than or equal to y get a score smaller than y (i.e., all ties with y are broken in favor of y ), the measure is called strictly rank monotone . We prove that harmonic centrality is strictly rank monotone, whereas closeness is …
Robustness of social and web graphs to node removal
Monotonicity in undirected networks
Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the importance of the target of the arc relatively to the r…
Robustness of social and web graphs to node removal
Rank monotonicity in centrality measures
A measure of centrality is rank monotone if after adding an arc x → y , all nodes with a score smaller than (or equal to) y have still a score smaller than (or equal to) y . If, in particular, all nodes with a score smaller than or equal to y get a score smaller than y (i.e., all ties with y are broken in favor of y ), the measure is called strictly rank monotone . We prove that harmonic centrality is strictly rank monotone, whereas closeness is …
Monotonicity in undirected networks
Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the importance of the target of the arc relatively to the r…
Score and rank semi-monotonicity for closeness, betweenness, and distance–decay centralities
Among the properties describing the behavior of centrality measures with respect to network modifications, score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the importance of the target with respect to the remaining nodes. It is known (Boldi and Vigna Intern Math 10:222–262, 2014, Boldi et al. Netw Sci 5(4):529–550, 2017) that score and rank mon…
Complex Network Analysis Techniques (4 obras) · Computer Science (4 obras) · Betweenness centrality (3 obras) · Centrality (3 obras) · Closeness (3 obras) · Combinatorics (3 obras) · Graph theory and applications (3 obras) · Mathematics (3 obras) · Monotonic function (3 obras) · Theoretical Computer Science (3 obras)