260 citations · 540 across the 20 of their papers we have counts for
20 papers
The Resistance Of Randomly Grown Trees
Ewan Colman, Geoff Rodgers
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the t…
Spectral Density of Complex Networks with a Finite Mean Degree
Taro Nagao, G. J. Rodgers
In order to clarify the statistical features of complex networks, the spectral density of adjacency matrices has often been investigated. Adopting a static model introduced by Goh,…
The Network of Commuters in London
A. P. Masucci, G. J. Rodgers
We study the directed and weighted network in which the wards of London are vertices and two vertices are connected whenever there is at least one person commuting to work from a w…
Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
Bosiljka Tadic, Stefan Thurner, G. J. Rodgers
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of dr…
Non-universal scaling and dynamical feedback in generalized models of financial markets
Dafang Zheng, G. J. Rodgers, P. M. Hui +1
We study self-organized models for information transmission and herd behavior in financial markets. Existing models are generalized to take into account the effect of size-dependen…
Bid distributions of competing agents in simple models of auctions
R. D'Hulst, G. J. Rodgers
Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful,…