# Latent Space Approaches to Social Network Analysis

@article{Hoff2002LatentSA, title={Latent Space Approaches to Social Network Analysis}, author={Peter D. Hoff and Adrian E. Raftery and Mark S. Handcock}, journal={Journal of the American Statistical Association}, year={2002}, volume={97}, pages={1090 - 1098} }

Network models are widely used to represent relational information among interacting units. In studies of social networks, recent emphasis has been placed on random graph models where the nodes usually represent individual social actors and the edges represent the presence of a specified relation between actors. We develop a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space.” We make inference for the social…

## 1,786 Citations

### Model‐based clustering for social networks

- Computer Science
- 2007

A new model is proposed, the latent position cluster model, under which the probability of a tie between two actors depends on the distance between them in an unobserved Euclidean ‘social space’, and the actors’ locations in the latent social space arise from a mixture of distributions, each corresponding to a cluster.

### Model-based clustering for multidimensional social networks

- Computer Science
- 2020

The infinite latent position cluster model for multidimensional network data is proposed, which enables model-based clustering of actors interacting across multiple social dimensions, based on a Bayesian nonparametric framework.

### Spatial process models for social network analysis

- Computer Science
- 2007

This thesis introduces the use of spatial process models for the statistical analysis of networks, emphasizing applications to social networks and proposes a reference distribution variable selection procedure to aid in the identification of important covariates.

### Modeling Social Networks with Sampled or Missing Data

- Computer Science
- 2007

This paper develops the conceptual and computational theory for inference based on sampled network information for social network models based on information from adaptive network mechanisms and develops a typology of network data that reflects their treatment within this frame.

### A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES

- Mathematics
- 2004

We consider social networks in which the relations between actors are governed by latent classes of actors with similar relational structure, i.e., blockmodeling. In Snijders and Nowicki (1997) and…

### Latent Space Models for Dynamic Networks

- Computer Science
- 2015

A model which embeds longitudinal network data as trajectories in a latent Euclidean space is presented and a novel approach is given to detect and visualize an attracting influence between actors using only the edge information.

### Networks as mediating variables: a Bayesian latent space approach

- Computer ScienceStatistical Methods & Applications
- 2022

A latent space model mapping the network into a space of smaller dimension by considering the hidden positions of the units in the network is introduced and an application to social interactions among a group of adolescents and their attitude toward substance use is presented.

### An alternative class of models to position social network groups in latent spaces

- Computer ScienceBrazilian Journal of Probability and Statistics
- 2022

A class of blockmodels is proposed to model stochastic equivalence and visualize groups in an unobservable space and is flexible enough to cluster and quantify between and within-group tie probabilities in social networks.

## References

SHOWING 1-10 OF 58 REFERENCES

### Pseudolikelihood Estimation for Social Networks

- Computer Science
- 1990

The focus of this article is on a general estimation technique that maximizes the pseudolikelihood, the maximum likelihood of log-linear modeling for social-network data.

### Stochastic Blockmodels for Directed Graphs

- Computer Science
- 1987

An iterative scaling algorithm is presented for fitting the model parameters by maximum likelihood and blockmodels that are simple extensions of the p 1 model are proposed specifically for such data.

### Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp

- Computer Science
- 1996

A large class of models, including several generalizations of stochastic block models, as well as models parameterizing global tendencies towards clustering and centralization, and individual differences in such tendencies are described and extended.

### Analyzing Data from Multivariate Directed Graphs: An Application to Social Networks.

- Computer Science
- 1980

Methods to analyse a network of 73 organizations in a Midwest American community linked by three types of relations is considered: information, money, and support, and a class of stochastic loglinear models for multivariate directed graphs are described.

### Social Network Analysis: Methods and Applications

- Computer ScienceStructural analysis in the social sciences
- 1994

This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of dyadic and triadic interaction models, which provide insights into the structure and dynamics of relationships between actors and groups.

### A dynamic model for social networks

- Computer Science
- 1977

A continuous‐time binary‐matrix‐valued Markov chain is used to model the process by which social structure effects individual behavior, and empirical estimates of the parameters can be interpreted as measures of structural tendencies.

### LOGIT MODELS AND LOGISTIC REGRESSIONS FOR SOCIAL NETWORKS: I. AN INTRODUCTION TO MARKOV GRAPHS AND p* STANLEY WASSERMAN UNIVERSITY OF ILLINOIS

- Mathematics
- 1996

Spanning nearly sixty years of research, statistical network analysis has passed through (at least) two generations of researchers and models. Beginning in the late 1930’s, the first generation of…

### Estimation and Prediction for Stochastic Blockstructures

- Mathematics
- 2001

A statistical approach to a posteriori blockmodeling for digraphs and valued digraphs is proposed. The probability model assumes that the vertices of the digraph are partitioned into several…