activity
20022008
most citedFinite Connectivity Attractor Neural Networks

66 citations · 290 across the 14 of their papers we have counts for

collaborators
Showing 2004Show all

5 papers · 1 filter

cond-mat.dis-nn2004★ 18 cited

Replica symmetry breaking in the `small world' spin glass

B Wemmenhove, T Nikoletopoulos, J P L Hatchett

We apply the cavity method to a spin glass model on a `small world' lattice, a random bond graph super-imposed upon a 1-dimensional ferromagnetic ring. We show the correspondence w…

cond-mat.dis-nn2004★ 5 cited

Slowly evolving random graphs II: Adaptive geometry in finite-connectivity Hopfield models

B. Wemmenhove, N. S. Skantzos

We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We…

cond-mat.dis-nn2004★ 9 cited

Slowly evolving geometry in recurrent neural networks I: extreme dilution regime

B. Wemmenhove, N. S. Skantzos, A. C. C. Coolen

We study extremely diluted spin models of neural networks in which the connectivity evolves in time, although adiabatically slowly compared to the neurons, according to stochastic…

cond-mat.dis-nn2004★ 64 cited

Parallel dynamics of disordered Ising spin systems on finitely connected random graphs

J. P. L. Hatchett, B. Wemmenhove, I. Perez Castillo +3

We study the dynamics of bond-disordered Ising spin systems on random graphs with finite connectivity, using generating functional analysis. Rather than disorder-averaged correlati…

cond-mat.dis-nn2004★ 63 cited

Replicated Transfer Matrix Analysis of Ising Spin Models on `Small World' Lattices

T. Nikoletopoulos, A. C. C. Coolen, I. Perez-Castillo +3

We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average…