Information Flow Propagation Research Articles

Causality-driven multivariate stock movement forecasting.

Our study aims to investigate the interdependence between international stock markets and sentiments from financial news in stock forecasting. We adopt the Temporal Fusion Transformers (TFT) to incorporate intra and inter-market correlations and the interaction between the information flow, i.e. causality, of financial news sentiment and the dynamics of the stock market. The current study distinguishes itself from existing research by adopting Dynamic Transfer Entropy (DTE) to establish an accurate information flow propagation between stock and sentiments. DTE has the advantage of providing time series that mine information flow propagation paths between certain parts of the time series, highlighting marginal events such as spikes or sudden jumps, which are crucial in financial time series. The proposed methodological approach involves the following elements: a FinBERT-based textual analysis of financial news articles to extract sentiment time series, the use of the Transfer Entropy and corresponding heat maps to analyze the net information flows, the calculation of the DTE time series, which are considered as co-occurring covariates of stock Price, and TFT-based stock forecasting. The Dow Jones Industrial Average index of 13 countries, along with daily financial news data obtained through the New York Times API, are used to demonstrate the validity and superiority of the proposed DTE-based causality method along with TFT for accurate stock Price and Return forecasting compared to state-of-the-art time series forecasting methods.

Graph Theory and Algorithms for Social Network Analysis

Graph theory and algorithms play a crucial role in the analysis of social networks, which are complex systems composed of individuals or entities connected by various types of relationships. This paper provides an overview of graph theory concepts and algorithms commonly used in social network analysis. It discusses how these tools can be applied to understand the structure and dynamics of social networks, identify key actors or communities, and analyze information flow and influence propagation. The paper also highlights some of the challenges and future directions in the field of social network analysis using graph theory. The study of graph theory and algorithms for social network analysis is of significant importance due to its wide-ranging applications in various fields. Understanding the structure and dynamics of social networks can provide valuable insights into human behavior, information diffusion, organizational dynamics, and the spread of diseases or ideas. By applying graph theory concepts such as centrality measures, community detection algorithms, and link prediction techniques, researchers can uncover hidden patterns, identify influential nodes or groups, and predict future interactions in social networks. This knowledge can be used to design more effective strategies for marketing, public health interventions, social media management, and other areas where understanding and influencing human behavior are critical. Versatile with distinctive options. MOORA is a new optimization approach that has been proposed. This objective method signifies a matrix of potential replies, but it also proposes better policies based on the rates employed. Well established. For comparison, the reference point method is another multi-objective optimization technique. After several competitions, this proved to be the best pick among the methods. From the result network models is in first position whereas Graph density is in 5th position

Awas: AADL information flow and error propagation analysis framework

Awas: AADL information flow and error propagation analysis framework

Real Time Video Object Segmentation in Compressed Domain

Many of the recent methods for semi-supervised video object segmentation are still far from being applicable for real time applications due to their slow inference speed. Therefore, we explore a propagation based segmentation method in compressed domain to accelerate inference speed in this paper. In particular, we only extract the features of I-frames by traditional deep convolutional neural network and produce the features of P-frames through information flow propagation. In the process of feature propagation, we propose two effective components to enhance the representation ability of simply warped features in terms of appearance and location. Specifically, we propose a residual supplement module to supplement appearance information which is lost in direct warping and a spatial attention module that can mine extra spatial saliency to provide the location information of the specified object. Besides, we propose a metric based decoder module which consists of a feature match module and a multi-level refinement module to transform information from semantic representation to shape segmentation mask. Extensive experiments on several video datasets demonstrate that the proposed method can achieve comparable accuracy while much faster inference speed when compared to the state-of-the-art algorithms.

Multiclass information flow propagation control under vehicle-to-vehicle communication environments

Most existing models for information flow propagation in a vehicle-to-vehicle (V2V) communications environment are descriptive. They lack capabilities to control information flow, which may preclude their ability to meet application needs, including the need to propagate different information types simultaneously to different target locations within corresponding time delay bounds. This study proposes a queuing-based modeling approach to control the propagation of information flow of multiple classes. Two control parameters associated with a vehicle, the number of communication servers and the mean communication service rate, are leveraged to control the propagation performance of different information classes. A two-layer model is developed to characterize the information flow propagation wave (IFPW) under the designed queuing strategy. The upper layer is formulated as integro-differential equations to characterize the spatiotemporal information dissemination due to V2V communication. The lower layer characterizes the traffic flow dynamics using the Lighthill–Whitham–Richards model. The analytical solution of the asymptotic density of informed vehicles and the necessary condition for existence of the IFPW are derived for homogeneous traffic conditions. Numerical experiments provide insights on the impact of the mean communication service rate on information spread and its spatial coverage. Further, a numerical solution method is developed to solve the two-layer model, which aids in estimating the impacts of the control parameters in the queuing strategy on the IFPW speed under homogenous and heterogeneous conditions. The proposed modeling approach enables controlling the propagation of information of different information classes to meet application needs, which can assist traffic managers to design effective and efficient traffic management and control strategies under V2V communications.

LDAPred: A Method Based on Information Flow Propagation and a Convolutional Neural Network for the Prediction of Disease-Associated lncRNAs.

Long non-coding RNAs (lncRNAs) play a crucial role in the pathogenesis and development of complex diseases. Predicting potential lncRNA–disease associations can improve our understanding of the molecular mechanisms of human diseases and help identify biomarkers for disease diagnosis, treatment, and prevention. Previous research methods have mostly integrated the similarity and association information of lncRNAs and diseases, without considering the topological structure information among these nodes, which is important for predicting lncRNA–disease associations. We propose a method based on information flow propagation and convolutional neural networks, called LDAPred, to predict disease-related lncRNAs. LDAPred not only integrates the similarities, associations, and interactions among lncRNAs, diseases, and miRNAs, but also exploits the topological structures formed by them. In this study, we construct a dual convolutional neural network-based framework that comprises the left and right sides. The embedding layer on the left side is established by utilizing lncRNA, miRNA, and disease-related biological premises. On the right side of the frame, multiple types of similarity, association, and interaction relationships among lncRNAs, diseases, and miRNAs are calculated based on information flow propagation on the bi-layer networks, such as the lncRNA–disease network. They contain the network topological structure and they are learned by the right side of the framework. The experimental results based on five-fold cross-validation indicate that LDAPred performs better than several state-of-the-art methods. Case studies on breast cancer, colon cancer, and osteosarcoma further demonstrate LDAPred’s ability to discover potential lncRNA–disease associations.

An Analytical Model to Characterize the Spatiotemporal Propagation of Information Under Vehicle-to-Vehicle Communications

Modeling the spatiotemporal propagation characteristics of information under vehicle-to-vehicle communications is critical for developing information-enabled applications to improve traffic safety and mobility. Existing analytical approaches assume instantaneous information flow propagation to simplify the communication constraints arising from the traffic flow dynamics. Consequently, information flow propagation characteristics such as the information flow propagation wave have not been analyzed. They are necessary to describe the interactions with the underlying traffic flow dynamics. An analytical model, which integrates an epidemic model with a traffic flow model, is developed to account for such interactions. The proposed model is able to capture the dynamics of information flow and traffic flow in an integrated formulation that circumvents key analytical and numerical challenges. Results from computational experiments demonstrate the effectiveness of the proposed model and its ability to describe the dynamic characteristics of information flow propagation along with the traffic flow dynamics.

Modeling the information flow propagation wave under vehicle-to-vehicle communications

Vehicle-to-vehicle (V2V) communications under the connected vehicle context have the potential to provide new paradigms to enhance the safety, mobility and environmental sustainability of surface transportation. Understanding the information propagation characteristics in space and time is a key enabler for V2V-based traffic systems. Most existing analytical models assume instantaneous propagation of information flow through multi-hop communications. Such an assumption ignores the spatiotemporal relationships between the traffic flow dynamics and V2V communication constraints. This study proposes a macroscopic two-layer model to characterize the information flow propagation wave (IFPW). The traffic flow propagation is formulated in the lower layer as a system of partial differential equations based on the Lighthill-Whitham-Richards model. Due to their conceptual similarities, the upper layer adapts and modifies a spatial Susceptible-Infected epidemic model to describe information dissemination between V2V-equipped vehicles using integro-differential equations. A closed-form solution is derived for the IFPW speed under homogeneous conditions. The IFPW speed is numerically determined for heterogeneous conditions. Numerical experiments illustrate the impact of traffic density and market penetration of V2V-equipped vehicles on the IFPW speed. The proposed model can capture the spatiotemporal relationships between the traffic and V2V communication layers, and aid in the design of novel information propagation strategies to manage traffic conditions under V2V-based traffic systems.

Analytical model for information flow propagation wave under an information relay control strategy in a congested vehicle-to-vehicle communication environment

Vehicular traffic congestion in a vehicle-to-vehicle (V2V) communication environment can lead to congestion effects for information flow propagation. Such congestion effects can impact whether a specific information packet of interest can reach a desired location, and if so, in a timely manner to influence the traffic system performance. Motivated by the usefulness and timeliness of information propagation, this paper aims to characterize the information flow propagation wave (IFPW) for an information packet in a congested V2V communication environment under an information relay control strategy. This strategy seeks to exclude information that is dated in the communication buffer under a first-in, first-out queue discipline, from being relayed if the information flow regime is congested. It trades off the need to enable the dissemination of every information packet as far as possible, against the congestion effects that accrue because of the presence of multiple information packets. A macroscopic two-layer model is proposed to characterize the IFPW. The upper layer is formulated as integro-differential equations to characterize the information dissemination in space and time under this control strategy. The lower layer adopts the Lighthill-Whitham-Richards model to capture the traffic flow dynamics. Based on the upper layer model, a necessary condition is derived which quantifies the expected time length that needs to be reserved for broadcasting the information packet of interest so as to ensure the formation of an IFPW under a given density of V2V-equipped vehicles.When the necessary condition is satisfied under homogeneous conditions, it is shown that the information packet can be propagated at an asymptotic speed whose value can be derived analytically. Besides, under the proposed control strategy, only a proportion of vehicles (labeled asymptotic density of informed vehicles) can receive the specific information packet, which can be estimated by solving a nonlinear equation. The asymptotic IFPW speed, the asymptotic density of informed vehicles, and the necessary condition for the IFPW, help in evaluating the timeliness of information propagation and the influence of traffic dynamics on information propagation.In addition, the proposed model can be used to numerically estimate the IFPW speed for heterogeneous conditions, which can aid inthe design of traffic management strategies built upon the timely propagation of information through V2V communication.

Analytical model for information flow propagation wave under an information relay control strategy in a congested vehicle-to-vehicle communication environment

Abstract: Vehicular traffic congestion in a vehicle-to-vehicle (V2V) communication environment can lead to congestion effects for information flow propagation. Such congestion effects can impact whether a specific information packet of interest can reach a desired location, and if so, in a timely manner to influence the traffic system performance. Motivated by the usefulness and timeliness of information propagation, this paper aims to characterize the information flow propagation wave (IFPW) for an information packet in a congested V2V communication environment under an information relay control strategy. This strategy seeks to exclude information that is dated in the communication buffer under a first-in, first-out queue discipline, from being relayed if the information flow regime is congested. It trades off the need to enable the dissemination of every information packet as far as possible, against the congestion effects that accrue because of the presence of multiple information packets. A macroscopic two-layer model is proposed to characterize the IFPW. The upper layer is formulated as integro-differential equations to characterize the information dissemination in space and time under this control strategy. The lower layer adopts the Lighthill-Whitham-Richards model to capture the traffic flow dynamics. Based on the upper layer model, a necessary condition is derived which quantifies the expected time length that needs to be reserved for broadcasting the information packet of interest so as to ensure the formation of an IFPW under a given density of V2V-equipped vehicles. When the necessary condition is satisfied under homogeneous conditions, it is shown that the information packet can be propagated at an asymptotic speed whose value can be derived analytically. Besides, under the proposed control strategy, only a proportion of vehicles (labeled asymptotic density of informed vehicles) can receive the specific information packet, which can be estimated by solving a nonlinear equation. The asymptotic IFPW speed, the asymptotic density of informed vehicles, and the necessary condition for the IFPW, help in evaluating the timeliness of information propagation and the influence of traffic dynamics on information propagation. In addition, the proposed model can be used to numerically estimate the IFPW speed for heterogeneous conditions, which can aid in the design of traffic management strategies built upon the timely propagation of information through V2V communication.

Graph‐Based Modeling of Information Flow Evolution and Propagation under V2V Communications‐Based Advanced Traveler Information Systems

AbstractA vehicle equipped with a vehicle‐to‐vehicle (V2V) communications capability can continuously update its knowledge on traffic conditions using its own experience and anonymously obtained travel experience data from other such equipped vehicles without any central coordination. In such a V2V communications‐based advanced traveler information system (ATIS), the dynamics of traffic flow and intervehicle communication lead to the time‐dependent vehicle knowledge on the traffic network conditions. In this context, this study proposes a graph‐based multilayer network framework to model the V2V‐based ATIS as a complex system which is composed of three coupled network layers: a physical traffic flow network, and virtual intervehicle communication and information flow networks. To determine the occurrence of V2V communication, the intervehicle communication layer is first constructed using the time‐dependent locations of vehicles in the traffic flow layer and intervehicle communication‐related constraints. Then an information flow network is constructed based on events in the traffic and intervehicle communication networks. The graph structure of this information flow network enables the efficient tracking of the time‐dependent vehicle knowledge of the traffic network conditions using a simple graph‐based reverse search algorithm and the storage of the information flow network as a single graph database. Further, the proposed framework provides a retrospective modeling capability to articulate explicitly how information flow evolves and propagates. These capabilities are critical to develop strategies for the rapid flow of useful information and traffic routing to enhance network performance. It also serves as a basic building block for the design of V2V‐based route guidance strategies to manage traffic conditions in congested networks. Synthetic experiments are used to compare the graph‐based approach to a simulation‐based approach, and illustrate both memory usage and computational time efficiencies.

A New Strategy for Model Order Identification and Its Application to Transfer Entropy for EEG Signals Analysis

The background objective of this study is to analyze electrenocephalographic (EEG) signals recorded with depth electrodes during seizures in patients with drug-resistant epilepsy. Usually, different phases are observed during the seizure evolution, including a fast onset activity. We aim to ascertain how cerebral structures get involved during this phase, in particular whether some structures "drive" other ones. Regarding a recent theoretical information measure, namely the transfer entropy (TE), we propose two criteria, the first one is based on Akaike's information criterion, the second on the Bayesian information criterion, to derive models' orders that constitute crucial parameters in the TE estimation. A normalized index, named partial transfer entropy (PTE), allows for quantifying the contribution or the influence of a signal to the global information flow between a pair of signals. Experiments are first conducted on linear autoregressive models, then on a physiology-based model, and finally on real intracerebral EEG epileptic signals to detect and identify directions of causal interdependence. Results support the relevance of the new measures for characterizing the information flow propagation whatever unidirectional or bidirectional interactions.

Hybrid quantum computation

We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-z gates, and multiqubit rotations around the $z$ axis. Every single-qubit and the controlled-z gate are realized by a respective unitary evolution, and every multiqubit rotation is executed by a single measurement on a required star graph state. The classical information processing in our model requires only an information flow vector and propagation matrices. We provide the implementation of multicontrol gates in the hybrid model. They are very useful for implementing Grover's search algorithm, which is studied as an illustrative example.