633 citations · 2.1k across the 47 of their papers we have counts for
Showing cond-mat.stat-mechShow all
3 papers · 1 filter
cond-mat.stat-mech2007★ 1 cited
Network Rewiring Models
T. S. Evans, A. D. K. Plato
Recently we showed that a simple model of network rewiring could be solved exactly for any time and any parameter value. We also showed that this model can be recast in terms of se…
cond-mat.stat-mech2006★ 63 cited
Exact Solution for the Time Evolution of Network Rewiring Models
T. S. Evans, A. D. K. Plato
We consider the rewiring of a bipartite graph using a mixture of random and preferential attachment. The full mean field equations for the degree distribution and its generating fu…
cond-mat.stat-mech2004★ 70 cited
Scale Free Networks from Self-Organisation
T. S. Evans, J. P. Saramaki
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several va…