Control theoretic approach to stationary iterative methods for large-scale Toeplitz-type equations

2012 ◽  
Author(s):  
K. Kashima ◽  
T. Oda ◽  
J. Imura
Keyword(s):  
Iterative Methods ◽  
Large Scale ◽  
Theoretic Approach ◽  
Stationary Iterative Methods

scholarly journals An information theoretic approach to link prediction in multiplex networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Seyed Hossein Jafari ◽  
Amir Mahdi Abdolhosseini-Qomi ◽  
Masoud Asadpour ◽  
Maseud Rahgozar ◽  
Naser Yazdani
Keyword(s):  
Real World ◽  
Link Prediction ◽  
Large Scale ◽  
Similarity Measures ◽  
Prediction Method ◽  
General Purpose ◽  
Fast Method ◽  
Theoretic Approach ◽  
Multiplex Networks ◽  
Wide Range

AbstractThe entities of real-world networks are connected via different types of connections (i.e., layers). The task of link prediction in multiplex networks is about finding missing connections based on both intra-layer and inter-layer correlations. Our observations confirm that in a wide range of real-world multiplex networks, from social to biological and technological, a positive correlation exists between connection probability in one layer and similarity in other layers. Accordingly, a similarity-based automatic general-purpose multiplex link prediction method—SimBins—is devised that quantifies the amount of connection uncertainty based on observed inter-layer correlations in a multiplex network. Moreover, SimBins enhances the prediction quality in the target layer by incorporating the effect of link overlap across layers. Applying SimBins to various datasets from diverse domains, our findings indicate that SimBins outperforms the compared methods (both baseline and state-of-the-art methods) in most instances when predicting links. Furthermore, it is discussed that SimBins imposes minor computational overhead to the base similarity measures making it a potentially fast method, suitable for large-scale multiplex networks.

scholarly journals A perspective on graph theory-based stability analysis of impulsive stochastic recurrent neural networks with time-varying delays

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
M. Iswarya ◽  
R. Raja ◽  
G. Rajchakit ◽  
J. Cao ◽  
J. Alzabut ◽  
...  
Keyword(s):  
Neural Networks ◽  
Graph Theory ◽  
Exponential Stability ◽  
Recurrent Neural Networks ◽  
Lyapunov Functional ◽  
Large Scale ◽  
Sufficient Conditions ◽  
Distributed Delay ◽  
Theoretic Approach ◽  
Discrete Time Delay

AbstractIn this work, the exponential stability problem of impulsive recurrent neural networks is investigated; discrete time delay, continuously distributed delay and stochastic noise are simultaneously taken into consideration. In order to guarantee the exponential stability of our considered recurrent neural networks, two distinct types of sufficient conditions are derived on the basis of the Lyapunov functional and coefficient of our given system and also to construct a Lyapunov function for a large scale system a novel graph-theoretic approach is considered, which is derived by utilizing the Lyapunov functional as well as graph theory. In this approach a global Lyapunov functional is constructed which is more related to the topological structure of the given system. We present a numerical example and simulation figures to show the effectiveness of our proposed work.

Sparse Tiling for Stationary Iterative Methods

2004 ◽  
Vol 18 (1) ◽  
pp. 95-113 ◽  
Author(s):  
Michelle Mills Strout ◽  
Larry Carter ◽  
Jeanne Ferrante ◽  
Barbara Kreaseck
Keyword(s):  
Iterative Methods ◽  
Stationary Iterative Methods
Sign in / Sign up

Export Citation Format

Share Document