We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (G n ) n≥0 converging locally to a Galton—Watson tree T (GWT), we provide an explicit formula ...

A couple of weeks ago, I attended and spoke at the first stop in the Neo4j GraphTour in Washington D.C. and I was able to get the best answer yet to a question that I’d been pondering: what’s the ...

TigerGraph, a company that provides a graph database and analytics software, has expanded its data science library with 20 new algorithms, bringing its total to more than 50 algorithms. Graph ...

It hadn’t occurred to me in quite these terms before, but Google has an algorithm for its Knowledge Graph. I have been tracking the Knowledge Graph API for five years. The resultScores have always ...

We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there are pure ...