  The Sznajd model is one of the most popular opinion dynamics models in
sociophysics. The model is based on the social validation concept that has been
applied to various social systems and is still interesting to study today,
especially when agents who interact with each other do not follow the
prevailing norms. This paper examines the generalized Sznajd model involving
independent agents defined on a complete graph and a two-dimensional square
lattice. Agents on the networks act independently with probability $p$, that
is, change their opinion or state without the influence of others. In this
model, we defined a paired agent size $r$, which persuades its nearest neighbor
size $n$ to follow their opinion. Based on our results, both analytically and
numerically, on the complete graph, the macroscopic state of the system is not
affected by the neighbor size $n$ but only depends on the number of the paired
agents $r$. The time required to reach a stationary state is inversely
proportional to the number of neighboring agents $n$. We obtain two critical
points $p = p_c$ in the two-dimensional square lattice depending on the
configuration agents. Our results suggest that the model universality class
defined on the complete graph still belongs to the mean-field Ising
universality class. In addition, the model universality class defined on the
two-dimensional square lattice with two different configurations is identical
and belongs to the two-dimensional Ising universality class.

Physics and Society