week 3 - generative models Flashcards

(26 cards)

1
Q

what is generative modelling?

A

building or randomizing a brain network, with various constraints or rules

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is the general pipeline for generative modelling

A
  • question/hyptohesis
  • build a model
  • Validate the model to empirical data
  • Iteritively refine the model to capture previously unexplained variance in empirical data or to capture mor parsiminous explantions of existing data
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the Erdos Renyi random graph model?

A

For a given number of nodes, add new edges with fixed probability p

(So for each pair of nodes, theres a 0.3 chance that a new edge is made)

The new edges are all independent from each other so the network is random

The degree dsitrbution (which is the distribution of the degree for each node) follows a gaussian distribution

This is not a very realistic model of real networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the Barabasi-Albert preferential attachment model

A

networks based on preferential attachment

This means that more highly connected nodes are more likely to recieve another edge (rich get richer)

You start with a seed network
The probability of connecting a new node to an existing node is the degree of the node/ the sum of the degree of all nodes

You then repeat this until you reach the desired number of nodes

If you iterate this loads and loads of times, you get a log log power law degree distribution between degree and frequency. This is a scale free network, meaning it contains disproportionately well connected hub nodes
Degree distributions of scale free networks follow a power law (straight line on a log log plot). A power law is the only distribution that is the same whatever scale we look at it from

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is evidence that brain networsk are scale free?

A

The degree distribution of functional brain networks follows a power law

This means there are many nodes with only a few links, and a few nodes with many links

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what else follows a power law in brains?

A
  • distance between nodes and edge weight (makes sense cus proximal nodes are more likely to be connected)
  • This can be explained because it is the sweet spot in the cost efficiency trade off. Long connections are metabolically expensive but topographically advantageous
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what is the spatial constraint for modelling brain networks?

A

Proximal nodes are more likely to be connected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe the spatial growth model

A

spatial growth model

Each node has a spatial coordinate. When you add a new node, the probability of connecting to each existing node is equal to beta (the density, or overall probability of edge formation) multiplied by an exponential decay of the scaled (with alpha) euclidean distance between nodes.

This means that as the distance between nodes increases, the probability of an edge beinig connected decreases exponentially. Alpha determines how fast this happens

If the new node does not establish any connections it is removed

Interestingly, exploring the alpha and beta parameter space generates:
- some random networks
- some scale free networks
- some small world networks
- some virtually unlimited spatial networks

If you fiddle with your parameters enough you can generate something that looks like empirical data in terms of small worldedness, clustering etc. HOWEVER, be careful of overfitting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

describe the exponential decay with distance model of functional brain networks

A

the probabiltiy of a new edge is equal to the exponential decay of the negative of the ecludian distance between nodes, multiplied by a distance penalty

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

describe the economical preferential attachment model of functional connectivity

A

The probablity of a new edge is equal to (the product of the degree of each node, to the power of a preferential attachment parameter) multiplied by the (euclidean distance between each node, to the power of an exponential decay parameter)

This model combines both distance penalty and degree advantage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the economical clustering model of functional connectivity?

A

The probability of a new edge is equal to the (number of common neighbours between each node, to the power of a preferential attachment parameter) multiplied by the (distance between each node, to the power of a exponential decay parameter).

This combines a neighbour advantage with a distance penalty. It does a good job of fitting the clustering and modularity of empirical networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

which model fits empirical data the best?

A

The economical clustering model

A study calculated topographies such as clustering, modularity etc. and found hte economical clustering model fitted FC data the best

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what has empirical graph theory work found about empirical brain networks in schizophrenia?

A

They show slightly lower clustering and slightly shorter path length

This is equivalent to higher efficiency and a subtle randomization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

what can applying generative models to structural data from people with schizophrenia tell us?

A
  • It can tell us about the difference in parameters in health and disease
  • E.g economomical clustering model found that the optimal model for ppl with schizophrenia showed a lower distance parameter and a higher neighbour advantage
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

go through the step by step of generative modelling

A
  1. You have an initial seed matrix
  2. You take the distance between pairs of nodes in the seed matrix and you raise it to the power of eta (distance penalty)
  3. You then multiply it by the topological matrix (different types of these, e.g preferential attachment)
  4. Remove edges already connected in the multpilied matrix
  5. The final matrix gives you the relative probability of adding a new edge for every pair of nodes
  6. sample from the final matrix, weighted by probability
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

how can you compare the fit of generative model?

A

Compute and energy statistic

This combines the Kolmonov-Smirnov statistic for degree, clustering, betweenness and edge length

17
Q

Describe models of network growth in worms

A

The probability of adding a new edge is equal to the exponential decay of the changes in the distance between two nodes, over time

Created due to modelling worm networks. As the worm grows, the distance between nodes increased

interestingly they found a phase transition, where up until 200 nodes there was a quadratic relationsip between n nodes and n edges, and then suddenly it transitions into a linear relationship. This suggests that as the body of the worm gets longer, the cost of long distance connections is increasingly penalized

You can do this in humans too, with models of fetal gestation. They found that the growth model fits fetal FC development better than the static model

18
Q

5 oveview steps to model brain networks

A
  1. Make a list of stylized facts
  2. Come up with the simplist mechanism guiding this structure
  3. Fit the model to the data, compare to other models
  4. Validate the model on empirical data
  5. Think of what the model doesn’t capture
19
Q

What is the degree distribution of most real world networks?

A
  • Most real world networks follow a power law degree distribution, meaning that most nodes have a very low degree, but some nodes have a very high degree and they are the hubs of the neworks
20
Q

name facts about real world brain networks

A
  • They are modular, and the modules are functionally relavent
  • All the networks have hubs which tend to be organized in rich clubs
  • They are small worlded, and small worldedness matters in terms of information processing
  • They are spatially constrained
21
Q

why is small worlded networks useful in the brain?

A
  • it allows for a shorter path length which allows for more efficient information processing
22
Q

How is path lenght related to IQ

A
  • People with high IQ tend to have shorter average path lengths
23
Q

What is the wiring cost path length trade off

A

Networks are spatially constrained, and longer edges come at a high wiring cost, but they are also useful for decreasing path length

24
Q

Describe the economical clustering model in schizophrenia

A
  • By tuning eta and gamma in the model, they were able to replicate the alterations in clustering commonly seen in schizophrenia
  • When optimising the model on empirical data, they found scz patients had slightly different eta and gamma parameters.
  • They then found that optimal eta and gamma paramaters actually correlate with polygenic risk scores for scz
25
what do a lot of the generative models not capture?
- Topography of nodes and hubs (where they exist in space, not topology) - Cytoarchitecture - Local gene expression. This could be included by adding a term that includes similarity in gene expression between regions
26