We explore the asymptotic properties of strategic models of network formation in very large populations. Specifically, we focus on (undirected) exponential random graph models. We want to recover a ...

In this paper we investigate first passage percolation on an inhomogeneous random graph model introduced by Bollobás et al. (2007). Each vertex in the graph has a type from a type space, and edge ...

Google published details of a new kind of AI based on graphs called a Graph Foundation Model (GFM) that generalizes to previously unseen graphs and delivers a three to forty times boost in precision ...