most citedOptimal routing on complex networks

224 citations · 410 across the 5 of their papers we have counts for

collaborators

5 papers

cond-mat.dis-nn2007★ 100 cited

Transport optimization on complex networks

Bogdan Danila, Yong Yu, John A. Marsh +1

We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algori…

cond-mat.stat-mech2006★ 224 cited

Optimal routing on complex networks

Bogdan Danila, Yong Yu, John A. Marsh +1

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload.…

cond-mat.stat-mech2006★ 3 cited

Generalized Box-Muller method for generating q-Gaussian random deviates

William Thistleton, Kenric Nelson, John A. Marsh +1

Addendum: The generalized Box-Müller algorithm provides a methodology for generating q-Gaussian random variates. The parameter is related to the shape of the tail…

cond-mat.stat-mech2006★ 27 cited

Influence of global correlations on central limit theorems and entropic extensivity

John A. Marsh, Miguel A. Fuentes, Luis G. Moyano +1

We consider probabilistic models of N identical distinguishable, binary random variables. If these variables are strictly or asymptotically independent, then, for N>>1, (i) the att…

cond-mat.stat-mech2006★ 56 cited

Congestion-gradient driven transport on complex networks

Bogdan Danila, Yong Yu, Samuel Earl +3

We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rul…