[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Creation of a random graph with high clustering coefficiant
From: |
Jeff Hemsley |
Subject: |
Re: [igraph] Creation of a random graph with high clustering coefficiant |
Date: |
Wed, 5 Dec 2012 07:15:32 -0800 |
Thanks Fabio,
This is probably exactly what I'm looking for to the demonstration I
have in mind.
On Tue, Dec 4, 2012 at 10:34 AM, Fabio Daolio <address@hidden> wrote:
> Hi Jeff,
>
> what about geometric random graphs, where nodes are randomly distributed on a
> plane and connect to nodes within a given distance radius?
>
> You might wanna have a look at ?grg.game() if you use the R interface.
> Maybe one could start like that and add a touch of rewiring once the network
> is constructed...just an idea.
>
> Best regards,
> --
> Fabio
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
--
Jeff Hemsley
Doctoral Candidate
The Information School
University of Washington
http://ischool.uw.edu/
address@hidden