Many scientific fields involve the study of network data, including social networks, networks in statistical physics, biological networks, and information networks (Goldenberg, Zheng, Fienberg, & Airoldi, 2010; Newman, 2010).

What we can learn about nodes in a network from their connectivity patterns? We can begin to study this using a latent space model (Hoff, Raftery, & Handcock, 2002). Latent space models embed nodes in the network in a latent space, where the likelihood of forming an edge between two nodes depends on their distance in the latent space.

We will analyze network data from neuroscience. An interactive version with Jupyter notebook is available here.

The data comes from Mark Newman’s repository. It is a weighted, directed network representing the neural network of the nematode C. Elegans compiled by Watts & Strogatz (1998) using experimental data by White, Southgate, Thomson, & Brenner (1986).

The neural network consists of around \(300\) neurons. Each connection between neurons is associated with a weight (positive integer) capturing the strength of the connection.

First, we load the data.

`x_train = np.load('data/celegans_brain.npy')`

What can we learn about the neurons from their connectivity patterns? Using a latent space model (Hoff et al., 2002), we will learn a latent embedding for each neuron to capture the similarities between them.

Each neuron \(n\) is a node in the network and is associated with a latent position \(z_n\in\mathbb{R}^K\). We place a Gaussian prior on each of the latent positions.

The log-odds of an edge between node \(i\) and \(j\) is proportional to the Euclidean distance between the latent representations of the nodes \(|z_i- z_j|\). Here, we model the weights (\(Y_{ij}\)) of the edges with a Poisson likelihood. The rate is the reciprocal of the distance in latent space. The generative process is as follows:

- For each node \(n=1,\ldots,N\), \[\begin{aligned} z_n \sim N(0,I).\end{aligned}\]
- For each edge \((i,j)\in\{1,\ldots,N\}\times\{1,\ldots,N\}\), \[\begin{aligned} Y_{ij} \sim \text{Poisson}\Bigg(\frac{1}{|z_i - z_j|}\Bigg).\end{aligned}\]

In Edward, we write the model as follows.

```
from edward.models import Normal, Poisson
N = x_train.shape[0] # number of data points
K = 3 # latent dimensionality
z = Normal(mu=tf.zeros([N, K]), sigma=tf.ones([N, K]))
# Calculate N x N distance matrix.
# 1. Create a vector, [||z_1||^2, ||z_2||^2, ..., ||z_N||^2], and tile
# it to create N identical rows.
xp = tf.tile(tf.reduce_sum(tf.pow(z, 2), 1, keep_dims=True), [1, N])
# 2. Create a N x N matrix where entry (i, j) is ||z_i||^2 + ||z_j||^2
# - 2 z_i^T z_j.
xp = xp + tf.transpose(xp) - 2 * tf.matmul(z, z, transpose_b=True)
# 3. Invert the pairwise distances and make rate along diagonals to
# be close to zero.
xp = 1.0 / tf.sqrt(xp + tf.diag(tf.zeros(N) + 1e3))
x = Poisson(lam=xp, value=tf.zeros_like(xp))
```

Note Edward doesn’t currently support sampling for `Poisson`

random variables. For now, we hard-code its associated tensor to be full of 0’s via the `value`

argument. It is required only for instantiating the random variable and is not used in the experiment.

Maximum a posteriori (MAP) estimation is simple in Edward. Two lines are required: Instantiating inference and running it.

`inference = ed.MAP([z], data={x: x_train})`

See this extended tutorial about MAP estimation in Edward.

One could instead run variational inference. This requires specifying a variational model and instantiating `KLqp`

.

```
qz = Normal(mu=tf.Variable(tf.random_normal([N * K])),
sigma=tf.nn.softplus(tf.Variable(tf.random_normal([N * K]))))
inference = ed.KLqp({z: qz}, data={x: x_train})
```

See this extended tutorial about variational inference in Edward.

Finally, the following line runs the inference procedure for 2500 iterations.

`inference.run(n_iter=2500)`

We thank Maja Rudolph for writing the initial version of this tutorial.

Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010). A survey of statistical network models. *Foundations and Trends in Machine Learning*.

Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002). Latent space approaches to social network analysis. *Journal of the American Statistical Association*, *97*(460), 1090–1098.

Newman, M. (2010). *Networks: An introduction*. Oxford University Press.

Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’networks. *Nature*, *393*(6684), 440–442.

White, J. G., Southgate, E., Thomson, J. N., & Brenner, S. (1986). The structure of the nervous system of the nematode caenorhabditis elegans. *Philos Trans R Soc Lond B Biol Sci*, *314*(1165), 1–340.