large network layout

[Stephen Guerin]

We're exploring the feasibility of dealing with a social network from phone
log data with 250 million nodes. No, this is not US NSA data ;-)

Does anyone have experience or recommendations for graph layout / navigation
/ query tools that can handle data of this size.  We've looked at Pajek, but
10M nodes may be its upper limit. And I've google'd permutations on "large
network layout" which gave some interesting leads...

-S

________________________________________
Stephen.Guerin at Redfish.com
www.Redfish.com
624 Agua Fria Street, Santa Fe, NM 87501
mobile: [phone]
office: Santa Fe, NM [phone] / London, UK [phone]

[Marko Rodriguez]

Check out Walrus:

http://www.caida.org/tools/visualization/walrus/

example pic:

http://www.caida.org/tools/visualization/walrus/gallery1/lhr-old.png

Marko.

On Tue, 2006-05-16 at 14:29 -0600, Stephen Guerin wrote:

> We're exploring the feasibility of dealing with a social network from phone
> log data with 250 million nodes. No, this is not US NSA data ;-)
>
> Does anyone have experience or recommendations for graph layout / navigation
> / query tools that can handle data of this size.  We've looked at Pajek, but
> 10M nodes may be its upper limit. And I've google'd permutations on "large
> network layout" which gave some interesting leads...
>
> -S
>
> ________________________________________
> Stephen.Guerin at Redfish.com
> www.Redfish.com
> 624 Agua Fria Street, Santa Fe, NM 87501
> mobile: [phone]
> office: Santa Fe, NM [phone] / London, UK [phone]
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org

--
Marko A. Rodriguez
CCS-3 Modeling, Algorithms and Informatics
Los Alamos National Laboratory
Phone [phone]
Fax [phone]
http://www.soe.ucsc.edu/~okram

[Louis Macovsky, Dynamic BioSystems]

Interesting video...Is it real or is it memorex (I mean could it be a
simulation ;)?

http://video.google.com/videoplay?docid=-6886880938991195179&q=fed+ex+thunde
rstorm

Lou

[Stephen Guerin]

Thanks, Marko. I like the hyperbolic representation.

We were once looking at Caida for a semantic network application. It may be
appropriate for this project if we can find a way to efficiently parse and
navigate the full graph into subnetworks and/or collapsed hierarchies.

-Steve

> -----Original Message-----
> From: Marko Rodriguez [mailto:marko at lanl.gov]
> Sent: Tuesday, May 16, 2006 2:35 PM
> To: The Friday Morning Applied Complexity Coffee Group
> Subject: Re: [FRIAM] large network layout
>
> Check out Walrus:
>
> http://www.caida.org/tools/visualization/walrus/
>
> example pic:
>
> http://www.caida.org/tools/visualization/walrus/gallery1/lhr-old.png
>
> Marko.
>
> On Tue, 2006-05-16 at 14:29 -0600, Stephen Guerin wrote:
> > We're exploring the feasibility of dealing with a social
> network from
> > phone log data with 250 million nodes. No, this is not US
> NSA data ;-)
> >
> > Does anyone have experience or recommendations for graph layout /
> > navigation / query tools that can handle data of this size.  We've
> > looked at Pajek, but 10M nodes may be its upper limit. And I've
> > google'd permutations on "large network layout" which gave
> some interesting leads...
> >
> > -S
> >
> > ________________________________________
> > Stephen.Guerin at Redfish.com
> > www.Redfish.com
> > 624 Agua Fria Street, Santa Fe, NM 87501
> > mobile: [phone]
> > office: Santa Fe, NM [phone] / London, UK [phone]
> >
> >
> > ============================================================
> > FRIAM Applied Complexity Group listserv Meets Fridays
> 9a-11:30 at cafe
> > at St. John's College lectures, archives, unsubscribe, maps at
> > http://www.friam.org
> --
> Marko A. Rodriguez
> CCS-3 Modeling, Algorithms and Informatics Los Alamos
> National Laboratory Phone [phone] Fax [phone]
> http://www.soe.ucsc.edu/~okram
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org
>
>

[Gus Koehler]

You might consider: VicHealth, The Partnerships Analysis Tool.
www.vichealth.vic.gov.au/default.asp?artid=538&tmid=406&level=3
See also fpor methodological, analysis, and interpretation issues:
Wassterman and Faust, Social Network Analysis
Scott, Social Network Analysis

Gus

Gus Koehler, Ph.D.
Principal
Time Structures
1545 University Ave.
Sacramento, CA 95825
916-564-8683, Fax: [phone]
Cell: 916-716-1740
www.timestructures.com
 


-----Original Message-----
From: [hidden email] [mailto:[hidden email]] On Behalf
Of Stephen Guerin
Sent: Wednesday, May 17, 2006 8:51 AM
To: 'The Friday Morning Applied Complexity Coffee Group'
Subject: Re: [FRIAM] large network layout


Thanks, Marko. I like the hyperbolic representation.

We were once looking at Caida for a semantic network application. It may be
appropriate for this project if we can find a way to efficiently parse and
navigate the full graph into subnetworks and/or collapsed hierarchies.

-Steve

> -----Original Message-----
> From: Marko Rodriguez [mailto:marko at lanl.gov]
> Sent: Tuesday, May 16, 2006 2:35 PM
> To: The Friday Morning Applied Complexity Coffee Group
> Subject: Re: [FRIAM] large network layout
>
> Check out Walrus:
>
> http://www.caida.org/tools/visualization/walrus/
>
> example pic:
>
> http://www.caida.org/tools/visualization/walrus/gallery1/lhr-old.png
>
> Marko.
>
> On Tue, 2006-05-16 at 14:29 -0600, Stephen Guerin wrote:
> > We're exploring the feasibility of dealing with a social
> network from
> > phone log data with 250 million nodes. No, this is not US
> NSA data ;-)
> >
> > Does anyone have experience or recommendations for graph layout /
> > navigation / query tools that can handle data of this size.  We've
> > looked at Pajek, but 10M nodes may be its upper limit. And I've
> > google'd permutations on "large network layout" which gave
> some interesting leads...
> >
> > -S
> >
> > ________________________________________
> > Stephen.Guerin at Redfish.com
> > www.Redfish.com
> > 624 Agua Fria Street, Santa Fe, NM 87501
> > mobile: [phone]
> > office: Santa Fe, NM [phone] / London, UK [phone]
> >
> >
> > ============================================================
> > FRIAM Applied Complexity Group listserv Meets Fridays
> 9a-11:30 at cafe
> > at St. John's College lectures, archives, unsubscribe, maps at
> > http://www.friam.org
> --
> Marko A. Rodriguez
> CCS-3 Modeling, Algorithms and Informatics Los Alamos
> National Laboratory Phone [phone] Fax [phone]
> http://www.soe.ucsc.edu/~okram
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org
>
>

============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org

[Marcus G. Daniels-2]

Stephen Guerin wrote:
> It may be appropriate for this project if we can find a way to efficiently parse and
> navigate the full graph into subnetworks and/or collapsed hierarchies.
>  
Hmm, a graph partitioning package like Chaco (from Sandia), might be
helpful for this.