Go to:
Logótipo
Você está em: Start > Publications > View > Minimum Number of Information Gatherers to Ensure Full Observability of a Dynamic Social Network: A Structural Systems Approach
Map of Premises
Principal
Publication

Minimum Number of Information Gatherers to Ensure Full Observability of a Dynamic Social Network: A Structural Systems Approach

Title
Minimum Number of Information Gatherers to Ensure Full Observability of a Dynamic Social Network: A Structural Systems Approach
Type
Article in International Conference Proceedings Book
Year
2014
Authors
Pequito, S
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Kar, S
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 750-753
2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014
3 December 2014 through 5 December 2014
Other information
Authenticus ID: P-00G-DHV
Abstract (EN): This paper studies the problem of identifying the minimum number of entities (agents), referred to as information gatherers, that are able to infer all the states in a dynamical social network. The information gatherers can be, for instance, service providers and the remaining agents the clients, each comprising several dynamic states associated with the services and personal information. The problem of identifying the minimum number of information gatherers can constitute a way to create coalitions to oversee the entire state of the system, and consequently the behavior of the agents in the social network. The dynamical social network is assumed to be modelled as a linear time-invariant system, and we will make use of the structural systems concept, i.e., by considering only the sparsity pattern (location of zeroes/non-zeroes) of the system coupling matrix. As a consequence, the design guarantees derived hold for almost all numerical parametric realizations of the system. In this paper, we show that this problem is NP-hard: in addition, we provide a reduction of the coalition problem to a minimum set covering problem that, in practice, leads to efficient (polynomial complexity) approximation schemes for solving the coalition problem with guaranteed optimality gaps. Finally, an example is provided which illustrates the analytical findings.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 4
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

The robust minimal controllability problem (2017)
Article in International Scientific Journal
Pequito, S; Ramos, G; Kar, S; Aguiar, AP; Ramos, J
On the complexity of the constrained input selection problem for structural linear systems (2015)
Article in International Scientific Journal
Pequito, S; Kar, S; Aguiar, AP
Minimum cost input/output design for large-scale linear structural systems (2016)
Article in International Scientific Journal
Pequito, S; Kar, S; Aguiar, AP
Composability and controllability of structural linear time-invariant systems: Distributed verification (2017)
Article in International Scientific Journal
Carvalho, JF; Pequito, S; Aguiar, AP; Kar, S; Johansson, KH

See all (14)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-06 at 19:27:57 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book