Synchronization of networks over finite fields

In this paper, the synchronization problem for networks over finite fields is investigated, which is a generalization of consensus and provides a new perspective for networks of agents with limited capacities of memory and communication. It is assumed that the states and communication weights can on...

Full description

Saved in:
Bibliographic Details
Main Authors: Meng, Min, Li, Xiuxian, Xiao, Gaoxi
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2021
Subjects:
Online Access:https://hdl.handle.net/10356/152098
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-152098
record_format dspace
spelling sg-ntu-dr.10356-1520982021-09-08T01:48:13Z Synchronization of networks over finite fields Meng, Min Li, Xiuxian Xiao, Gaoxi School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Synchronization Networks In this paper, the synchronization problem for networks over finite fields is investigated, which is a generalization of consensus and provides a new perspective for networks of agents with limited capacities of memory and communication. It is assumed that the states and communication weights can only attain values from a finite alphabet equipped with a prime number of integers, termed finite fields, and operations are processed relying on modular arithmetic. For this synchronization problem, necessary and sufficient conditions are derived based on the transition graph of the studied network. The large number of nodes in the transition graph, dependent on the numbers of integers in finite fields and the agents, may lead to high computational cost and difficulties in verifying synchronization. To avoid this, an equivalent condition for synchronization of networks is provided by the characteristic polynomial of the studied network matrix. Furthermore, in a synchronized network over finite fields, the periodic behavior can be determined by the network matrix and the initial state. Ministry of Education (MOE) The work was partially supported by Ministry of Education, Singapore under contract of MOE2016-T2-1-119. 2021-09-08T01:48:13Z 2021-09-08T01:48:13Z 2020 Journal Article Meng, M., Li, X. & Xiao, G. (2020). Synchronization of networks over finite fields. Automatica, 115, 108877-. https://dx.doi.org/10.1016/j.automatica.2020.108877 0005-1098 https://hdl.handle.net/10356/152098 10.1016/j.automatica.2020.108877 2-s2.0-85079033324 115 108877 en MOE2016-T2-1-119 Automatica © 2020 Elsevier Ltd. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Synchronization
Networks
spellingShingle Engineering::Electrical and electronic engineering
Synchronization
Networks
Meng, Min
Li, Xiuxian
Xiao, Gaoxi
Synchronization of networks over finite fields
description In this paper, the synchronization problem for networks over finite fields is investigated, which is a generalization of consensus and provides a new perspective for networks of agents with limited capacities of memory and communication. It is assumed that the states and communication weights can only attain values from a finite alphabet equipped with a prime number of integers, termed finite fields, and operations are processed relying on modular arithmetic. For this synchronization problem, necessary and sufficient conditions are derived based on the transition graph of the studied network. The large number of nodes in the transition graph, dependent on the numbers of integers in finite fields and the agents, may lead to high computational cost and difficulties in verifying synchronization. To avoid this, an equivalent condition for synchronization of networks is provided by the characteristic polynomial of the studied network matrix. Furthermore, in a synchronized network over finite fields, the periodic behavior can be determined by the network matrix and the initial state.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Meng, Min
Li, Xiuxian
Xiao, Gaoxi
format Article
author Meng, Min
Li, Xiuxian
Xiao, Gaoxi
author_sort Meng, Min
title Synchronization of networks over finite fields
title_short Synchronization of networks over finite fields
title_full Synchronization of networks over finite fields
title_fullStr Synchronization of networks over finite fields
title_full_unstemmed Synchronization of networks over finite fields
title_sort synchronization of networks over finite fields
publishDate 2021
url https://hdl.handle.net/10356/152098
_version_ 1710686944413876224