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 ...
This is a preview. Log in through your library . Abstract In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and 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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results