TY - JOUR
T1 - Reply to “Comment on ‘Subgraphs in random networks’?”
AU - Itzkovitz, S.
AU - Milo, R.
AU - Kashtan, N.
AU - Newman, M. E.J.
AU - Alon, U.
PY - 2004
Y1 - 2004
N2 - King [preceding Comment, Phys. Rev. E 70, 058101 (2004)] points out biases in one of the two common algorithms for generating simple random graphs—the matching, or stub-pairing, algorithm. We clarify that in our simulations of simple graphs we used a different algorithm, the Markov-chain Monte Carlo switching algorithm, which is more uniform. As for multigraphs, the stub-pairing algorithm indeed samples uniformly configurations rather than multigraphs, as King points out, and thus is relevant for our model, which pertains to configurations. Finally, we demonstrate that the algorithm we used to generate families of random networks with scale-free out-degree and compact in-degree does not result in noticeable biases.
AB - King [preceding Comment, Phys. Rev. E 70, 058101 (2004)] points out biases in one of the two common algorithms for generating simple random graphs—the matching, or stub-pairing, algorithm. We clarify that in our simulations of simple graphs we used a different algorithm, the Markov-chain Monte Carlo switching algorithm, which is more uniform. As for multigraphs, the stub-pairing algorithm indeed samples uniformly configurations rather than multigraphs, as King points out, and thus is relevant for our model, which pertains to configurations. Finally, we demonstrate that the algorithm we used to generate families of random networks with scale-free out-degree and compact in-degree does not result in noticeable biases.
UR - http://www.scopus.com/inward/record.url?scp=85036419255&partnerID=8YFLogxK
U2 - 10.1103/PhysRevE.70.058102
DO - 10.1103/PhysRevE.70.058102
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85036419255
SN - 1063-651X
VL - 70
SP - 2
JO - Physical Review E
JF - Physical Review E
IS - 5
ER -