| ²é¿´: 445 | »Ø¸´: 2 | ||||
chentao3476Ìú¸Ëľ³æ (ÖøÃûдÊÖ)
would-be Dr. CHEN
|
[ÇóÖú]
The relationship between graph distance and Euclidean distance
|
| Hello, everyone. I am a postgraduate student who conducts research on complex networks. Now I have a problem to consult all of you. As is known from the theory of complex networks, a network constitutes nodes and edges. My question is what the relationship is between graph distance of two connected nodes and their Euclidean distance? (For instance, in a random graph, the graph distance (average short path length) of two connected nodes (A and B) is L~ln(N)/ln(pN), where N is the total number of nodes, and p is the connection probability between two connected nodes. What is the Euclidean distance of nodes A and B) Thank you. |
» ²ÂÄãϲ»¶
Ϊʲô×ÊÖúÊý¸÷´ó¸ßУ¶¼´´Ð¸ߣ¬×Ô¼ºÉêÇëÔõô¾ÍÕâôÄÑ
ÒѾÓÐ6È˻ظ´
¹ú×ÔÈ»ÃæÉϸ´ÅÌ~»¶ÓÌÖÂÛ
ÒѾÓÐ10È˻ظ´
ÓжàÉÙÈËÊǽñÌì²éϵͳ֪µÀ½á¹ûµÄ£¿
ÒѾÓÐ17È˻ظ´
»ù½ðδÖУ¬ÕâÖÖ´ð¸´ÊÇÄ£°åÂð£¿
ÒѾÓÐ6È˻ظ´
¿´°åÉÏÕâô¶àÖеģ¬ÓеãÏñ50ÈËȺÀï49¸öÈ˶¼ÊÇÆ×ÓµÄÄÇÖָоõ¡¡
ÒѾÓÐ6È˻ظ´
µ¼Ê¦Í²ۣºÎÒÔõô̯ÉÏÁËÕâô¸ö¼«Æ·Ñо¿Éú£¡
ÒѾÓÐ6È˻ظ´
Çà»ùÈçºÎÆÆ¾Ö
ÒѾÓÐ4È˻ظ´
»ù½ð²»ÖУ¬¹²Ãã
ÒѾÓÐ8È˻ظ´
Ôõô¿´Çà»ùÖÐÁËûÓа¡
ÒѾÓÐ5È˻ظ´
ÃÎÏë
ÒѾÓÐ3È˻ظ´

feixiaolin
ÈÙÓþ°æÖ÷ (ÎÄ̳¾«Ó¢)
-

ר¼Ò¾Ñé: +518 - Ó¦Öú: 942 (²©ºó)
- ¹ó±ö: 1.275
- ½ð±Ò: 3886
- É¢½ð: 58785
- ºì»¨: 532
- ɳ·¢: 11
- Ìû×Ó: 24216
- ÔÚÏß: 2601.8Сʱ
- ³æºÅ: 2139575
- ×¢²á: 2012-11-21
- רҵ: ¹âѧÐÅÏ¢»ñÈ¡Óë´¦Àí
- ¹ÜϽ: Êýѧ
|
1) Graph distance and Euclidean distance on the grid http://link.springer.com/chapter/10.1007/978-3-642-46908-4_63 2) The ratio of Euclidean distance to graph distance is between two value, this can be seen in "Graph approximations to geodesics on embedded manifolds" ftp://ftp-sop.inria.fr/prisme/bo ... anifolds/isomap.pdf |
2Â¥2013-12-03 13:16:01
chentao3476
Ìú¸Ëľ³æ (ÖøÃûдÊÖ)
would-be Dr. CHEN
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 6633.3
- É¢½ð: 722
- ºì»¨: 1
- Ìû×Ó: 1156
- ÔÚÏß: 562.3Сʱ
- ³æºÅ: 1112964
- ×¢²á: 2010-10-02
- ÐÔ±ð: GG
- רҵ: ĤÉúÎﻯѧÓëĤÉúÎïÎïÀíѧ

3Â¥2013-12-03 15:13:52









»Ø¸´´ËÂ¥
10