Lab questions Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is an adjacency matrix?

A

A of a graph is a square matrix with rows and columns equal to the number of vertices in the graph. The presence of an edge between vertices is repredented with a 1 otherwise it’s 0. For undirected graphs, the adjacency matrix is symmetrical.

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

What are some attributes a graph can have?

A

It can be weighted, directed, named etc

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

What are some examples of different types of graphs? Like in the way they look with node placement etc

A

Full graph (completely connected), # Star graph (directed towards a central node), # Tree graph (undirected, multiple “branches”), # Ring graph (unidirected, connects all vertices in a circular pattern)

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

What happens if you combine two graphs?

A

Combining two graphs does not merge their vertices by default (disjoint union), it only displays them in the same plot.

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

What is network density?

A

Network density describes the portion of the potential connections in a network that are real connections. A “potential connection” is a connection that could potentially exist between two vertices, regardless of whether or not it actually does.

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

What is network transivity?

A

Network transitivity is the probability for the network to have adjacent nodes interconnected, which reveals the existence of tightly connected communities (or clusters, subgroups, cliques…).

It is calculated as the ratio between the observed number of closed triplets and the sum of closed and open triplets in the graph.

Global transitivity (for an entire graph) is also referred to as global clustering coefficient.

So it’s closed triplets/closed+open triplets

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

What is netwrok diameter?

A

Network diameter is defined as the maximum shortest path between any two nodes in the network.

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

What is centrality?

A

Thus, the definition of centrality is not general and depends on the application.

Since there is no consensus about the definition of centrality, several measures have been proposed, where each one considers specific concepts. In this Lab, we will cover the following centrality measures:

Degree
Closeness
Eigenvector
Betweenness

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

What is degree centrality?

A

The simplest centrality measure is the degree centrality, which is defined by the number of connections attached to each node.

In-degree represents the number of directed connections reaching a node, while out-degree represents the number of directed edges leaving a node.

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

What is clsoeness centrality?

A

Node centrality can also be defined in terms of the shortest paths. A central node, therefore, should be close to all other nodes in the network in terms of their shortest path distances.

This idea is enclosed in the closeness centrality measure, which is defined in terms of the average distance of each node to all others.

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

What is Eigenvectors centrality

A

We can also define centrality in terms of the neighborhood of each node. We can assume that a node is important if it is linked to other important nodes.

The “importance” of a node is defined by the first eigenvector of the graph adjacency matrix, associated with the eigenvalue. Thus, this centrality is called eigenvector centrality.

Eigenvectors are a special set of vectors associated with a linear system of equations, such as a matrix equation. The direction of an eigenvector remains unchanged when a linear transformation is applied to it. They are also known as characteristic vectors, proper vectors, or latent vectors.

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

What is betweeness centrality?

A

Finally, if we measure the centrality as the number of shortest paths going through a vertex or an edge, we would be ranking them based on their betweenness centrality.

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

Describe hubs and authorties in a biological context

A

Hubs were expected to contain pages with a large number of outgoing links, while authorities would get many incoming links from hubs, presumably because of their high-quality relevant information.

In the biological context, the protein–protein interaction (PPI) network has a small number of highly-connected proteins (hubs) surrounded by a majority of lowly-connected proteins.

The malfunction of a hub is more likely to be lethal to an organism than the perturbation of a lowly connected node because hubs are more important than non-hubs in organizing the global network structure. This phenomenon is known as the centrality-lethality rule.

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

What are party and date hubs?

A

Protein hubs can be classified into two classes:

Party hubs, which coordinate a specific cellular process or protein complex, at a certain time.

Date hubs, which link together and convey information between different function‐specific modules or complexes, at different times.

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

What is average path lenght?

A

Average path length: mean of shortest distance between each pair of nodes, # (in both directions for directed graphs). One can when making a graph choose colors depenidng on the path lenght to visualize the path lenght easier

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

What is a community/module?

A

Many complex systems, including biological networks, are built up from communities or modules: sets of nodes that are densely connected among each other, but sparsely connected to other nodes outside their community.

17
Q

How can you identify a module by analyzing cliques?

A

One of the multiple methods for the detection of modules in a graph is based on the identification of cliques. A set of nodes forms a clique (or complete subgraph) if all possible connections between the nodes exist. A two-node clique is simply two connected nodes. A three-node clique is also known as a triangle.

Graphs also contain maximal cliques, which are complete subgraphs such that no other node can be added while maintaining completeness.

18
Q

What is high modularity?

A

High modularity for a partitioning reflects dense connections within communities and sparse connections across communities. This property is exploited by several community-detection algorithms, which try to optimize the modularity to identify existing communities.

19
Q

What are some different modules whe analyzing complex diseases?

A

Topological module which are genes that are close in together in the graph, functional model when they share the same function and disease model with genes that are asscoiated with that disease.

20
Q

What is a disease enrichmeant analysis?

A

we can determine if the gene list in the current state can be associated with any known disease mechanism.

21
Q

What is a pathway enrichmeant analysis?

A

We can also perform a pathway enrichment analysis for the identified module genes, for example using the KEGG (Kyoto Encyclopedia of Genes and Genomes) repository of biological pathways.