Comment on "Subgraphs in random networks"

被引：17

作者：

Kino, OD ^{[1
]}

机构：

[1] Harvard Univ, Sch Med, Dept Biol Chem & Mol Pharmacol, Boston, MA 02115 USA

来源：

PHYSICAL REVIEW E | 2004年 / 70卷 / 05期

关键词：

D O I：

10.1103/PhysRevE.70.058101

中图分类号：

O35 [流体力学]; O53 [等离子体物理学];

学科分类号：

070204 ; 080103 ; 080704 ;

摘要：

We point out biases in the algorithms used by Itzkovitz et al. [Phys. Rev. E 68, 026127 (2003)] to assess their approximate formulas for the average number of occurrences of certain subgraphs in random graphs with prescribed degree sequences.

引用

页数：3

共 24 条

[11] Subgraphs in random networks [J].

Itzkovitz, S ;

Milo, R ;

Kashtan, N ;

Ziv, G ;

Alon, U .

PHYSICAL REVIEW E, 2003, 68 (02) :8

[12] FAST UNIFORM GENERATION OF REGULAR GRAPHS [J].

JERRUM, M ;

SINCLAIR, A .

THEORETICAL COMPUTER SCIENCE, 1990, 73 (01) :91-100

[13]

Kannan R, 1999, RANDOM STRUCT ALGOR, V14, P293, DOI 10.1002/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO

[14]

2-G

[15] Specificity and stability in topology of protein networks [J].

Maslov, S ;

Sneppen, K .

SCIENCE, 2002, 296 (5569) :910-913

[16]

MASLOV S, CONDMAT0205379, P41908

[17] Network motifs: Simple building blocks of complex networks [J].

Milo, R ;

Shen-Orr, S ;

Itzkovitz, S ;

Kashtan, N ;

Chklovskii, D ;

Alon, U .

SCIENCE, 2002, 298 (5594) :824-827

[18] A CRITICAL-POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE [J].

MOLLOY, M ;

REED, B .

RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) :161-179

[19]

Newman MEJ, 2001, PHYS REV E, V64, DOI [10.1103/PhysRevE.64.016132, 10.1103/PhysRevE.64.016131]

[20]

Rao A., 1996, SANKHYA SER A, V58, P225

← 1 2 3 →