Sebastiano Vigna
Datos Biográficos
| ID | 3924956 |
|---|---|
| NOMBRE | Sebastiano Vigna |
| NOMBRES | Sebastiano |
| APELLIDO | Vigna |
| FIRMA | VIGNA S |
| AFILIACIONES | University of Milan |
| ORCID | 0000-0002-3257-651X |
| VERIFICADO | Sí |
| TOTAL DE OBRAS | 6 |
| TOTAL DE CITAS | 12 |
| TOTAL COMO AUTOR | 6 |
| TOTAL COMO EDITOR | 0 |
| PRIMER AÑO DE PUBLICACIÓN | 2013 |
| AÑO MÁS RECIENTE DE PUBLICACIÓN | 2024 |
| ÍNDICE H | 3 |
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…
SciPy 1.0
SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0…
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 …
Spectral ranking
We sketch the history of spectral ranking —a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities . Albeit recently made famous by the ample press coverage of Google's PageRank algorithm, spectral ranking was devised more than 60 years ago, almost exactly in the same …
Robustness of social and web graphs to node removal
Spectral ranking
We sketch the history of spectral ranking —a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities . Albeit recently made famous by the ample press coverage of Google's PageRank algorithm, spectral ranking was devised more than 60 years ago, almost exactly in the same …
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
Spectral ranking
We sketch the history of spectral ranking —a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities . Albeit recently made famous by the ample press coverage of Google's PageRank algorithm, spectral ranking was devised more than 60 years ago, almost exactly in the same …
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 …
SciPy 1.0
SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0…
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 (5 obras) · Computer Science (5 obras) · Combinatorics (4 obras) · Mathematics (4 obras) · Betweenness centrality (3 obras) · Centrality (3 obras) · Closeness (3 obras) · Graph theory and applications (3 obras) · Monotonic function (3 obras) · PageRank (3 obras)