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 ...
Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...
Rank-order relational data, in which each actor ranks other actors according to some criterion, often arise from sociometric measurements of judgment or preference. The authors propose a general ...
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 ...
This paper assesses whether cross-border M&A decisions exhibit network effects. We estimate exponential random graph models (ERGM) and temporal exponential random graph models (TERGM) to evaluate the ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results