igraph-help
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

## Re: [igraph] how to compare two networks...

 From: Simone Gabbriellini Subject: Re: [igraph] how to compare two networks... Date: Fri, 11 Apr 2008 19:06:43 +0200

```Gabor,

the first case is my solution, I guess!
```
I have a network built from empiric data and a simulated one (in Netlogo): nodes stands for the same people, and the simulated network is basically a what-if scenario... the Hamming distance of the adjacency matrix looks like what I need..
```
as usual, thank you very much for your help,
Simone

Il giorno 11/apr/08, alle ore 17:56, Gabor Csardi ha scritto:

```
```Simone,

in general it depends what you mean by "close".
Same structural properties? Which structural properties
in particular?

Here are two classic graph theory methods.

If vertices in the two networks stand for the same entities,
then you can take the Hamming distance of their adjacency matrices.

```
If this is not the case, then you can ask for the minimum number of edge
```removal/addition operations you need to get the second
network from the first. This is a quite difficult problem,
and there is no solution for it in igraph.

Gabor

On Fri, Apr 11, 2008 at 05:45:23PM +0200, Simone Gabbriellini wrote:
```
```Hello,

is there a procedure in igraph that let's you compare two networks
```
(with the same nodes but different links distribution) to see how much
```they are close each other?

thank you,
Simone

_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help
```
```
--
Csardi Gabor <address@hidden>    UNIL DGM

_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help
```
```

```

reply via email to

 [Prev in Thread] Current Thread [Next in Thread]