Search Results for author: Paolo Boldi

Found 7 papers, 3 papers with code

Monotonicity in Undirected Networks

1 code implementation13 Jul 2022 Paolo Boldi, Flavio Furia, Sebastiano Vigna

In this paper, we study the problem of score and rank monotonicity for classical centrality measures in the case of undirected networks: in this case, we require that score, or relative importance, improve at both endpoints of the new edge.

Spectral Rank Monotonicity on Undirected Networks

no code implementations2 Feb 2022 Paolo Boldi, Flavio Furia, Sebastiano Vigna

We show that, surprisingly, the situation is very different for undirected graphs, and in particular that PageRank is neither score nor rank monotone.


Quasifibrations of Graphs to Find Symmetries in Biological Networks

1 code implementation13 Nov 2021 Paolo Boldi, Ian Leifer, Hernán A. Makse

A fibration of graphs is an homomorphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods.

Estimating latent feature-feature interactions in large feature-rich graphs

no code implementations3 Dec 2016 Corrado Monti, Paolo Boldi

Other authors, instead, developed more sophisticated models, that are able to handle complex feature interactions, but are unfit to scale to very large networks.

Cache-Oblivious Peeling of Random Hypergraphs

1 code implementation2 Dec 2013 Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna

The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings.

Data Structures and Algorithms

Four Degrees of Separation

no code implementations19 Nov 2011 Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna

It is not completely clear whether the selected individual is part of the five, so this could actually allude to distance five or six in the language of graph theory, but the "six degrees of separation" phrase stuck after John Guare's 1990 eponymous play.

Social and Information Networks Physics and Society

HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget

no code implementations25 Nov 2010 Paolo Boldi, Marco Rosa, Sebastiano Vigna

Recently, the ANF algorithm (approximate neighbourhood function) has been proposed with the purpose of approximating NG(t) on large graphs.

Data Structures and Algorithms Social and Information Networks Physics and Society

Cannot find the paper you are looking for? You can Submit a new open access paper.