Search results for "Complex network"

The Content Web-Accessibility of Information and Technology Support in a Complex System of Educational and Social Inclusion

2018

Support for the socialization of people with special needs is an urgent task in the European space. The study of the system of educational and social inclusion requires an interdisciplinary approach, and a large number of components, their hierarchy, and other features states that the system of inclusion is complex, and therefore requires appropriate means of its modeling - complex networks, graphs, appropriate modeling languages, etc. An important stage in the study of complex systems is the evaluation of their information and technology component in terms of the web accessibility. The use of the recommendations outlined in the WCAG 2.0 while developing information technologies as a compon…

A complex network analysis of inbound tourism in Sicily

2019

In this article, the complex dynamics of inbound tourism in Sicily is analyzed for the period 1998–2017. The horizontal visibility graph algorithm is used to transform the overnight stays' time series into a network whose topology is investigated by standard network analysis. Discontinuities in the domestic and international tourism demand were identified in order to detect signals of change and the timing of the directional change in tourism growth. The network degree distribution confirms the complex structure of the destination and reveals the random and thus more unpredictable nature of the international tourism demand in Sicily, compared with a more stable domestic segment. Some policy…

Image Segmentation by Deep Community Detection Approach

2017

International audience; To address the problem of segmenting an image into homogeneous communities this paper proposes an efficient algorithm to detect deep communities in the image by maximizing at each stage a new centrality measure, called the local Fiedler vector centrality (LFVC). This measure is associated with the sensitivity of algebraic connectivity to node removals. We show that a greedy node removal strategy, based on iterative maximization of LFVC, has bounded performance loss relative to the optimal, but intractable, combinatorial batch removal strategy. A remarkable feature of this method is the ability to segments the image automatically into homogeneous regions by maximizing…

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

2016

New systems can be designed, developed, and managed as societies of agents that interact with each other by offering and providing services. These systems can be viewed as complex networks where nodes are bounded rational agents. In order to deal with complex goals, they require cooperation of the other agents to be able to locate the required services. The aim of this paper is formally and empirically analyze under which circumstances cooperation emerges in decentralized search of services. We propose a repeated game model that formalizes the interactions among agents in a search process where agents are free to choose between cooperate or not in the process. Agents make decisions based on…

Information Decomposition in Multivariate Systems: Definitions, Implementation and Application to Cardiovascular Networks

2016

The continuously growing framework of information dynamics encompasses a set of tools, rooted in information theory and statistical physics, which allow to quantify different aspects of the statistical structure of multivariate processes reflecting the temporal dynamics of complex networks. Building on the most recent developments in this field, this work designs a complete approach to dissect the information carried by the target of a network of multiple interacting systems into the new information produced by the system, the information stored in the system, and the information transferred to it from the other systems; information storage and transfer are then further decomposed into amou…

2014

This paper is devoted to investigating stability in mean of partial variables for coupled stochastic reaction-diffusion systems on networks (CSRDSNs). By transforming the integral of the trajectory with respect to spatial variables as the solution of the stochastic ordinary differential equations (SODE) and using Itô formula, we establish some novel stability principles for uniform stability in mean, asymptotic stability in mean, uniformly asymptotic stability in mean, and exponential stability in mean of partial variables for CSRDSNs. These stability principles have a close relation with the topology property of the network. We also provide a systematic method for constructing global Lyapu…

Global stability of coupled Markovian switching reaction–diffusion systems on networks

2014

Abstract In this paper, we investigate the stability problem for some Markovian switching reaction–diffusion coupled systems on networks (MSRDCSNs). By using the Lyapunov function, we establish some novel stability principles for stochastic stability, asymptotically stochastic stability, globally asymptotically stochastic stability and almost surely exponential stability of the MSRDCSNs. These stability principles have a close relation to the topology property of the network. We also provide a systematic method for constructing global Lyapunov function for these MSRDCSNs by using graph theory. The new method can help analyze the dynamics of complex networks.

Energy Efficient Consensus Over Complex Networks

2015

The need to extract large amounts of information from the environment to have precise situation awareness and then react appropriately to certain events has led to the emergence of complex and heterogeneous sensor networks. In this context, where the sensor nodes are usually powered by batteries, the design of new methods to make inference processes efficient in terms of energy consumption is necessary. One of these processes, which is present in many distributed tasks performed by these complex networks, is the consensus process. This is the basis for certain tracking algorithms in monitoring and control applications. To improve the energy efficiency of this process, in this paper we propo…

Neural Networks and Metabolic Networks: Fault Tolerance and Robustness Features

2009

The main objective of this work is the comparison between metabolic networks and neural networks (ANNs) in terms of their robustness and fault tolerance capabilities. In the context of metabolic networks errors are random removal of network nodes, while attacks are failures in the network caused intentionally. In the contest of neural networks errors are usually defined configurations of input submitted to the network that are affected by noise, while the failures are defined as the removal of some network neurons. This study have proven that ANNs are very robust networks, with respect to the presence of noise in the inputs, and the partial removal of some nodes, until it reached a critical…

How Correlated Are Community-Aware and Classical Centrality Measures in Complex Networks?

2021

Unlike classical centrality measures, recently developed community-aware centrality measures use a network’s community structure to identify influential nodes in complex networks. This paper investigates their relationship on a set of fifty real-world networks originating from various domains. Results show that classical and community-aware centrality measures generally exhibit low to medium correlation values. These results are consistent across networks. Transitivity and efficiency are the most influential macroscopic network features driving the correlation variation between classical and community-aware centrality measures. Additionally, the mixing parameter, the modularity, and the Max…