Book Chapter

Statistical models for networks A brief review of some recent research

Stanley Wasserman, Garry Robins, Douglas Steinley

Lecture Notes in Computer Science | SPRINGER-VERLAG BERLIN | Published : 2007


We begin with a graph (or a directed graph), a single set of nodes N, and a set of lines or arcs ℒ. It is common to use this mathematical concept to represent a network. We use the notation of [1], especially Chapters 13 and 15. There are extensions of these ideas to a wide range of networks, including multiple relations, affiliation relations, valued relations, and social influence and selection situations (in which information on attributes of the nodes is available), all of which can be found in the chapters of [2]. The purpose of this short exposition is to discuss the developments in statistical models for networks that have occurred over the past five years, since the publication of th..

View full abstract