igraph-help
[Top][All Lists]
Advanced

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

Re: [igraph] Barabasi.Game


From: Gábor Csárdi
Subject: Re: [igraph] Barabasi.Game
Date: Fri, 4 Nov 2011 08:33:16 -0400

On Fri, Nov 4, 2011 at 6:45 AM, Thomas <address@hidden> wrote:
> Anyone know why barabasi.game() creates networks with zero transitivity?

In general it does not, unless you set m=1, which means that a tree is
generated:

> bg <- simplify(barabasi.game(1000, m=5))
> transitivity(bg)
[1] 0.01707914

> I
> thought their approach (from Barabasi, A.-L. and Albert R. 1999. Emergence
> of scaling in random networks Science, 286 509–512) was intended to capture
> the characteristics of a social network?

I don't think they intended to capture transitivity, though.

Gabor

> They discuss an actor collaboration
> network for instance.
>
> I'm running igraph on R.
>
> Thank you,
>
> Thomas Chesney
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI



reply via email to

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