On 11/07/2013 08:01 AM, xenil wrote:
> Two questions:
> - The usual katz calculation definition uses the transpose adjacency matrix, Is this transposition done in your code?

There are different conventions for the adjacency matrix of directed
graphs. The code in the library follows the in-neighbours of the
edge. So the matrix multiplication is performed:

        y_i = alpha \sum_j A_ij x_j + beta_i

where A_ij is one if there is an edge in the direction j->i. If you want
to transpose the matrix, it is easy: You just reverse the direction of
the graph with g.set_reversed(True).

> - Is the adjacency matrix normalized when no edge weight is used?

No.

Cheers,
Tiago

--
Tiago de Paula Peixoto <[hidden email]>


_______________________________________________
graph-tool mailing list
[hidden email]
http://lists.skewed.de/mailman/listinfo/graph-tool

signature.asc (919 bytes) Download Attachment

--
Tiago de Paula Peixoto [hidden email]

---

If you reply to this email, your message will be added to the discussion below:

http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Katz-centrality-calculation-tp4025165p4025187.html

To unsubscribe from Katz centrality calculation, click here.
NAML