Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
A.DHIVYA BHARATHI.
(For a matrix A, if there is a vector X s.t. AX = X for some scalar, then is the
eigenvalue of A assoc with eigenvector X.)
EPL states that the 20 or so largest eigenvalues of the Internet graph are power-law
distributed. It has been shown that the Eigenvalue Power Law is a consequence of
the Degree Power Law.
A.DHIVYA BHARATHI.
secondary largest connected components, the largest eigenvalue law and the bursty and selfsimilar edge additions over time.
13. State Weight Power Law.
We consider weighted directed graphs Data set: records in the form (IP-source, IP
destination, timestamp, number of-packets)
We can have multi-edges and weights
Notations:
This means that the weight of a given edge and weights of its neighboring two nodes are
correlated (similar to Newtons Gravitational Law).
15. Explain Snapshot Power laws.
Consider the i-th node of a weighted graph, at time t (a snapshot), and let out i , outwi be its
out-degree and out-weight. Then
o
Where ow is the out-weight-exponent of the SPL. Similarly, for the in-degree, with inweight-exponent iw.
The exponents iw and ow take values in the range [0.9-1.2] and [0.95-1.35], respectively.
The exponent over time remains almost constant.
16. Write notes on shrinking diameter.
It can be observed that not only is the diameter of real graphs small, but it also shrinks and
then stabilizes over time.There is a gelling point at which many small disconnected
components merge and form the largest connected component in the graph.
17. State Densification Power Law.
The Community Guided Attachment leads to Densification Power Law with exponent
A.DHIVYA BHARATHI.
Historically first and conceptually simplest is degree centrality, which is defined as the
number of links incident upon a node (i.e., the number of ties that a node has). The degree
can be interpreted in terms of the immediate risk of a node for catching whatever is flowing
through the network (such as a virus, or some information). In the case of a directed
network (where ties have direction), we usually define two separate measures of degree
centrality, namely indegree and outdegree. Accordingly, indegree is a count of the number
of ties directed to the node and outdegree is the number of ties that the node directs to
others. When ties are associated to some positive aspects such as friendship or collaboration,
indegree is often interpreted as a form of popularity, and outdegree as gregariousness.
The degree centrality of a vertex , for a given graph G: (V,E) with V vertices and E edges,
is defined as
An undirected graph has no loops and can have at most |V| * (|V| 1) / 2 edges, so the
density of an undirected graph is 2 * |E| / (|V| * (|V| 1)).
A directed graph has no loops and can have at most |V| * (|V| 1) edges, so the density of a
directed graph is |E| / (|V| * (|V| 1))
The average degree of a graph G is another measure of how many edges are in set E compared
to number of vertices in set V. Because each edge is incident to two vertices and counts in the
degree of both vertices, the average degree of an undirected graph is 2*|E|/|V|.
23. Define centrality
In graph theory and network analysis, indicators of centrality identify the most important
vertices within a graph. Applications include identifying the most influential person(s) in a
social network, key infrastructure nodes in the Internet or urban networks, and superspreaders of disease.
CS6010 SOCIAL NETWORK ANALYSIS
AP/IT- MAMCE,TRI-621 105
A.DHIVYA BHARATHI.
A.DHIVYA BHARATHI.