Graph Theory and Connectivity Flashcards

1
Q

What is functional connectivity?

A
  • statistical dependencies among spatially remote neurophysiologic events
  • GLM
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

(rest) functional connectivity - method

A

seed-voxel correlation
- seed = target region/variable
- extract time series from a seed region
- voxel-wise test for correlations (i.e. multiple GLMs with X for each other voxel)

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

(rest) functional connectivity - pros and cons

A

pros
- no a priori hypothesis needed (i.e. data-driven)
- useful when we have no model of what caused the data

cons
- no mechanistic insight into the neural system of interest
- inappropriate for situations where we have a priori knowledge and experimental control about the system of interest

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

(task) functional connectivity - method

A

Psycho-physiological interaction (PPI)
- factorial design
- 1 task factor (e.g. attention / no attention)
- 1 stimulus factor (movement / no movement)
y = (TA - TB) beta 1 + (S1 - S2) beta2 + (TA - TB)(S1 - S2) beta3 + e
- main effect of task + main effect of stimulus + interaction
- replace main effect in GLM by time series of an area that shows main effect of stimulus type
- 2 possible interpretations of PPI term

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

(task) functional connectivity - pros & cons

A

pros
- given a single source region, we can test for its context-dependent connectivity across the entire brain
- complies with KISS principle

cons
- very simplistic model: only allows to model contributions from a single region
- not easily used with event-related data
- limited causal interpretability in neural terms, more powerful models needed

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

What is effective connectivity?

A
  • influence that the elements of a neuronal system exert over another

models of effective connectivity:
- Granger causality
- Dynamic causal modelling (DCM)
- structural equation modelling (SEM)
- multivariate autoregressive models (MAR)

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

What is Granger causality?

A
  • model of effective connectivity
  • given two time series y1 and y2, y1 is considered to be caused by y2 if its dynamics can be predicted better using past values from y1 and y2 as opposed to using past values of y1 alone
  • causal interpretability? not really
  • in neural terms? No (time scale)
  • more powerful models needed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a graph composed of?

A

nodes and edges

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

What is the degree of a node?

A
  • the number of its edges
  • the higher the degree, the more impact
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the difference between weighted and binary networks?

A
  • for weighted networks, matrix elements are continous values ranging from strong (high valued) to weak (low valued)
  • for binary networks, matrix elements are either 0 (no connection) or 1 (connection)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are the 3 rules for defining nodes?

A

Brain nodes should have:
- intrinsic consistency (belong to the same function, homogenous)
- extrinsic differentiation (different from other nodes)
- spatially constrained (no smoothing)

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

How big should the network be?

A
  • if global properties (efficiency, distribution of nodes) are of interest, it does not make a difference whether using 80 or over 1000 areas
  • 200 - 300 areas is a good choice.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What kinds of thresholds can you use to get rid of weak links?

A
  • absolute threshold: set every link below threshold to zero
  • proportional: certain percentage of highest correlations are considered as links (normalizing by wiring cost)
  • result is called adjacency matrix
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Problems edge definition

A
  • thresholding can modify network structure
  • thresholding can result in different stages of network fragmentation for each subject and thus in different numbers of nodes forming the network
  • low threshold may result in uniformity of networks (no possibility to detect inter-individual differences)
  • association of network topology with independent variables may uniquely dependent on the precise threshold value

solution:
- construct each individual network / perform analysis over a range of thresholds

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

What kinds of network measures are there?

A
  • functional segregation
  • functional integration
  • centrality
  • resilience
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

functional segregation

A
  • ability for specialized processing of densely interconnected groups of brain regions
  • quantifies presence of such groups/clusters/modules within network
  • suggests organization of brain regions indicative of segregated neural processing
  • simple measures are based on number of triangles in network (more triangles, more segregation)
17
Q

functional segregation - clustering coefficient

A
  • measure of local connectedness
  • proportion of how many nearest neighbors of node i are connected to each other as well
18
Q

functional segregation - modular/community structure

A
  • subdividing network into groups of nodes with a maximally possible number of within-group links, and a minimally possible number of between-group links
19
Q

functional integration

A
  • ability to rapidly combine specialized information from distributed brain regions
  • characterizes the ease with which brain regions communicate
  • commonly based on concept of path (sequence of links between nodes)
  • represent potential routes of information flow between pairs of brain regions
20
Q

functional integration - global network efficiency

A
  • the shorter the paths from one region to another, the higher efficiency
  • hub = node embedded in a lot of shortest paths between networks
21
Q

What is small-worldness?

A
  • optimal balance of functional integration and segregation
  • high clustering & low path length
  • brain is also organized as small-world network
  • high global and local efficiency of parallel information processing facilitates adaptive reconfiguration of neuronal assemblies in supoort of changing cognitive states
22
Q

centrality

A
  • important brain regions (hubs) often interact with many other regions and facilitate functional integration
  • various measures: degree, betweenness (being part of many of the shortest paths), connection between modules
23
Q

centrality - hubs

A
  • 6% of all connections connect 90% of the brain
  • highest edge betweenness centrality
  • highest functional connectivity
  • above-average FC distance
  • organized in a rich-club
24
Q

resilience

A
  • anatomical brain connectivity influences the capacity of neuropathological lesions to affect functional brain activity
  • extent of functional dysfunction is heavily determined by the affected anatomical region in a stroke
25
Q

What are bridge hubs, connector hubs and provincial hubs?

A
  • bridge hubs connect more than 2 modules
  • connector hubs connect 2 modules
  • provincial hubs are important in their own module but not relevant for information flow within the entire system
26
Q

resilience - degeneracy

A
  • capacity of structurally distinct elements of a system to carry out the same function
  • ability of distinct neuronal systems to make overlapping contributions to the same output, offering both functional adaptability and robustness to damage