Search Results for author:
Found 7 papers, 3 papers with code
Monotonicity in Undirected Networks
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
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
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
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
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
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
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
