“…With suitable choices of the set {m k,j } the GPM reproduces the MF behavior of all known models with binary opinions: voter, majority rule, Sznajd, the majority-minority model, etc.. We now briefly review the modifications of the Sznajd model. The dynamics has been studied on many different topologies: regular lattices (Chang, 2001;Stauffer et al, 2000), complete graphs (Slanina and Lavička, 2003), random graphs (Rodrigues and da F. Costa, 2005), smallworld networks (Elgazzar, 2003;He et al, 2004) and scale-free networks (Bernardes et al, 2002;Bonnekoh, 2003;Rodrigues and da F. Costa, 2005;Sousa and Sánchez, 2006). The Sznajd model on scalefree networks was recently studied (González et al, 2006) within a real space renormalization framework.…”