Networks and Navigation: Difference between revisions
From Santa Fe Institute Events Wiki
No edit summary |
mNo edit summary |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{Networks and | {{Networks and Navigation}} | ||
'''Networks and Navigation''' Working Group, August 4-6, 2008, Santa Fe NM | |||
Joint with UCSD's [http://www.caida.org/home/ Cooperative Association for Internet Data Analysis] | |||
'''Organizers:''' [http://www.santafe.edu/~aaronc/ Aaron Clauset] (SFI), [http://www.caida.org/~dima/ Dmitri Krioukov] (CAIDA), [http://www.caida.org/~kc/ kc claffy] (CAIDA) and [http://www.santafe.edu/~moore/ Cris Moore] (UNM & SFI) | |||
'''Description''': Recent empirical and theoretical work on complex networks has indicated that many are not only small worlds in the sense that short paths exist between most pairs of vertices, but that these paths can often be found using only local information, i.e., can be found without doing the kind of global search that is necessary for unstructured networks like uniformly random graphs. | |||
A deeper understanding of the origin of these locally-navigable structures would (1) clarify the role (if any) that latent metric spaces play in the navigability of networks, and potentially point to novel generative mechanisms based on such spaces, (2) point us toward novel routing algorithms and search protocols for Internet-like topologies, other communication networks, and possibly social networks, (3) shed light on the potentially different behavior of passive versus active spreading on these networks, i.e., diffusion versus search, (4) identify the relationship between navigability and other network properties, e.g., community structure, degree heterogeneity, etc. | |||
'''*Please note that attendance to this event is by invitation only.''' | |||
Latest revision as of 15:03, 9 June 2008
| Working Group Navigation |
Networks and Navigation Working Group, August 4-6, 2008, Santa Fe NM
Joint with UCSD's Cooperative Association for Internet Data Analysis
Organizers: Aaron Clauset (SFI), Dmitri Krioukov (CAIDA), kc claffy (CAIDA) and Cris Moore (UNM & SFI)
Description: Recent empirical and theoretical work on complex networks has indicated that many are not only small worlds in the sense that short paths exist between most pairs of vertices, but that these paths can often be found using only local information, i.e., can be found without doing the kind of global search that is necessary for unstructured networks like uniformly random graphs.
A deeper understanding of the origin of these locally-navigable structures would (1) clarify the role (if any) that latent metric spaces play in the navigability of networks, and potentially point to novel generative mechanisms based on such spaces, (2) point us toward novel routing algorithms and search protocols for Internet-like topologies, other communication networks, and possibly social networks, (3) shed light on the potentially different behavior of passive versus active spreading on these networks, i.e., diffusion versus search, (4) identify the relationship between navigability and other network properties, e.g., community structure, degree heterogeneity, etc.
*Please note that attendance to this event is by invitation only.