Near consensus complex linear and nonlinear social networks

Some of the nodes of complex social networks may support for a given proposal, while the rest of the nodes may be against the given proposal. Even though all the nodes support for or are against the given proposal, the decision certitudes of individual nodes may be different. In this case, the stead...

Full description

Bibliographic Details
Main Authors: Ling, B., Ho, C., Wang, L., Teo, Kok Lay, Tse, C.k, Dai, Q.
Format: Journal Article
Published: World Scientific Publishing Company 2014
Subjects:
Online Access:http://hdl.handle.net/20.500.11937/20784
_version_ 1848750405271420928
author Ling, B.
Ho, C.
Wang, L.
Teo, Kok Lay
Tse, C.k
Dai, Q.
author_facet Ling, B.
Ho, C.
Wang, L.
Teo, Kok Lay
Tse, C.k
Dai, Q.
author_sort Ling, B.
building Curtin Institutional Repository
collection Online Access
description Some of the nodes of complex social networks may support for a given proposal, while the rest of the nodes may be against the given proposal. Even though all the nodes support for or are against the given proposal, the decision certitudes of individual nodes may be different. In this case, the steady state values of the decision certitudes of the majority of the nodes are either higher than or lower than a threshold value. Deriving the near consensus property is a key to the analysis of the behaviors of complex social networks. So far, no result on the behaviors of the complex social networks satisfying the near consensus property has been reported. Hence, it is useful to extend the definition of the exact consensus property to that of a near consensus property and investigate the behaviors of the complex social networks satisfying the near consensus property. This paper extends the definition of exact consensus complex social networks to that of near consensus complex social networks. For complex linear social networks, this paper investigates the relationships among the vectors representing the steady state values of the decision certitudes of the nodes, the influence weight matrix and the set of vectors representing the initial state values of the decision certitudes of the nodes under a given near consensus specification.The above analysis is based on the Eigen theory. For complex nonlinear social networks with certain types of nonlinearities, the relationship between the influence weight matrix and the vectors representing the steady state values of the decision certitudes of the nodes is studied. When a complex nonlinear social network does not achieve the exact consensus property, the optimal near consensus condition that the complex social network can achieve is derived. This problem is formulated as an optimization problem. The total number of nodes that the decision certitudes of the nodes are either higher than or lower than a threshold value is maximized subject to the corresponding near consensus specification. The optimization problem is a nonsmooth optimization problem. The nonsmooth constraints are first approximated by smooth constraints. Then, the approximated optimization problem is solved via a conventional smooth optimization approach. Computer numerical simulation results as well as the comparisons of the behaviors of complex nonlinear social networks to those of the complex linear social networks are presented. The obtained results demonstrate that some complex social networks can satisfy the near consensus property but not the exact consensus property. Also, the conditions for the near consensus property are dependent on the types of nonlinearities, the influence weight matrix and the vectors representing the initial state values of the decision certitudes of the nodes.
first_indexed 2025-11-14T07:36:18Z
format Journal Article
id curtin-20.500.11937-20784
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T07:36:18Z
publishDate 2014
publisher World Scientific Publishing Company
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-207842018-03-29T09:06:34Z Near consensus complex linear and nonlinear social networks Ling, B. Ho, C. Wang, L. Teo, Kok Lay Tse, C.k Dai, Q. nonsmooth constrained optimization problem Eigen theory exact consensus near consensus social networks Complex networks Some of the nodes of complex social networks may support for a given proposal, while the rest of the nodes may be against the given proposal. Even though all the nodes support for or are against the given proposal, the decision certitudes of individual nodes may be different. In this case, the steady state values of the decision certitudes of the majority of the nodes are either higher than or lower than a threshold value. Deriving the near consensus property is a key to the analysis of the behaviors of complex social networks. So far, no result on the behaviors of the complex social networks satisfying the near consensus property has been reported. Hence, it is useful to extend the definition of the exact consensus property to that of a near consensus property and investigate the behaviors of the complex social networks satisfying the near consensus property. This paper extends the definition of exact consensus complex social networks to that of near consensus complex social networks. For complex linear social networks, this paper investigates the relationships among the vectors representing the steady state values of the decision certitudes of the nodes, the influence weight matrix and the set of vectors representing the initial state values of the decision certitudes of the nodes under a given near consensus specification.The above analysis is based on the Eigen theory. For complex nonlinear social networks with certain types of nonlinearities, the relationship between the influence weight matrix and the vectors representing the steady state values of the decision certitudes of the nodes is studied. When a complex nonlinear social network does not achieve the exact consensus property, the optimal near consensus condition that the complex social network can achieve is derived. This problem is formulated as an optimization problem. The total number of nodes that the decision certitudes of the nodes are either higher than or lower than a threshold value is maximized subject to the corresponding near consensus specification. The optimization problem is a nonsmooth optimization problem. The nonsmooth constraints are first approximated by smooth constraints. Then, the approximated optimization problem is solved via a conventional smooth optimization approach. Computer numerical simulation results as well as the comparisons of the behaviors of complex nonlinear social networks to those of the complex linear social networks are presented. The obtained results demonstrate that some complex social networks can satisfy the near consensus property but not the exact consensus property. Also, the conditions for the near consensus property are dependent on the types of nonlinearities, the influence weight matrix and the vectors representing the initial state values of the decision certitudes of the nodes. 2014 Journal Article http://hdl.handle.net/20.500.11937/20784 10.1142/S0217984914501061 World Scientific Publishing Company restricted
spellingShingle nonsmooth constrained optimization problem
Eigen theory
exact consensus
near consensus
social networks
Complex networks
Ling, B.
Ho, C.
Wang, L.
Teo, Kok Lay
Tse, C.k
Dai, Q.
Near consensus complex linear and nonlinear social networks
title Near consensus complex linear and nonlinear social networks
title_full Near consensus complex linear and nonlinear social networks
title_fullStr Near consensus complex linear and nonlinear social networks
title_full_unstemmed Near consensus complex linear and nonlinear social networks
title_short Near consensus complex linear and nonlinear social networks
title_sort near consensus complex linear and nonlinear social networks
topic nonsmooth constrained optimization problem
Eigen theory
exact consensus
near consensus
social networks
Complex networks
url http://hdl.handle.net/20.500.11937/20784