scholarly journals Optimal synchronization on strongly connected directed networks

2010 ◽  
Vol 74 (2) ◽  
pp. 217-225 ◽  
Author(s):  
M. Brede
Keyword(s):  
Directed Networks ◽  
Strongly Connected

scholarly journals Symmetric Distributed Termination

1985 ◽  
Vol 14 (189) ◽  
Author(s):  
Ole Eriksen ◽  
Sven Skyum
Keyword(s):  
Upper Bound ◽  
Simple Algorithm ◽  
Distributed Computation ◽  
Directed Networks ◽  
Strongly Connected ◽  
Termination Problem ◽  
Special Master

In this paper we present a simple algorithm for deciding when to terminate a distributed computation. Former solutions to the termination problem are restricted to rings and undirected connected networks, and they rely on the existence of a special master processor present in the network. The class of configurations for which our algorithm is applicable is the most general possible, namely the class of configurations, where the underlying (directed) networks are strongly connected. If the network is not strongly connected then there exists a group of processors which cannot send messages to the rest and it becomes impossible to detect when to terminate. Furthermore, the algorithm does not require a special master processor acting differently from the others. The only information needed is an upper bound on the diameter of the network (the number of processors, for example). The protocol for all processors is in other words identical.

scholarly journals Giant strongly connected component of directed networks

2001 ◽  
Vol 64 (2) ◽  
Author(s):  
S. N. Dorogovtsev ◽  
J. F. F. Mendes ◽  
A. N. Samukhin
Keyword(s):  
Connected Component ◽  
Directed Networks ◽  
Strongly Connected Component ◽  
Strongly Connected

Exponential Consensus in Directed Networks of Multi-Agents with Saturated Protocols

2016 ◽  
Vol 16 (02) ◽  
pp. 1650003
Author(s):  
QINGLING WANG ◽  
YUANDA WANG
Keyword(s):  
Lyapunov Function ◽  
Directed Graph ◽  
Spanning Tree ◽  
Directed Graphs ◽  
Consensus Problem ◽  
Directed Networks ◽  
Strongly Connected ◽  
Theoretical Results ◽  
Multi Agents

This paper addresses the exponential consensus problem of single-integrator agents with saturated protocols on directed graphs. By employing an integral Lyapunov function, the exponential consensus problem of single-integrator agents is solved under the directed graph with strongly connected or a spanning tree. The main contribution is that under the directed graph, some conditions for exponential consensus with saturated protocols are first obtained. Finally, two examples are used to illustrate the effectiveness of the theoretical results.

Intimation

2017 ◽  
Author(s):  
G. R. F. Ferrari
Keyword(s):  
Social Life ◽  
Relevance Theory ◽  
Self Presentation ◽  
Erving Goffman ◽  
Strongly Connected ◽  
Dan Sperber ◽  
Paul Grice

The communicative scale is introduced. What is fundamental to communication is the intention of the communicator rather than the codes that languages employ. Following the model first proposed by Paul Grice and developed in Dan Sperber and Deirdre Wilson’s ‘relevance theory’, the structure of communicative intentionality is understood to be recursive: its underlying form is ‘I want you to know that I want you to know’. This leaves room for a simpler kind of transmission, to be called ‘intimation’, whose underlying form would be ‘I want you to know’. If communication is a transmission at the ‘full-on’ position of the scale, and if the switch is off when no communication is intended, then intimation would be at the intermediate, ‘half-on’ position. Intimation is particularly useful in contexts where discretion, suggestiveness, or plausible deniability are needed. It is strongly connected to self-presentation in social life (as studied by Erving Goffman).

scholarly journals Distributed support vector machines over dynamic balanced directed networks

2021 ◽  
pp. 1-1
Author(s):  
Mohammadreza Doostmohammadian ◽  
Alireza Aghasi ◽  
Themistoklis Charalambous ◽  
Usman A. Khan
Keyword(s):  
Support Vector Machines ◽  
Support Vector ◽  
Directed Networks ◽  
Vector Machines

scholarly journals The Nexus of Sophisticated Digital Assets with Economic Policy Uncertainty: A Survey of Empirical Findings and an Empirical Investigation

2021 ◽  
Vol 13 (10) ◽  
pp. 5383
Author(s):  
Nikolaos A. Kyriazis
Keyword(s):  
Economic Policy ◽  
Empirical Investigation ◽  
Econometric Analysis ◽  
Policy Uncertainty ◽  
Negative Effects ◽  
Economic Policy Uncertainty ◽  
Strongly Connected ◽  
Threshold Arch ◽  
Best Fit ◽  
Digital Assets

This paper sets out to explore the nexus between economic policy uncertainty (EPU) and digital currencies. An integrated survey takes place based on eleven primary studies. Furthermore, an econometric analysis is conducted by the threshold ARCH, simple asymmetric ARCH and non-linear ARCH specifications covering the bull and the bear markets as well as the highly volatile period up to the present. Threshold ARCH is found to provide the best fit for estimations. Outcomes reveal that Bitcoin is strongly connected with EPU while Ethereum and Litecoin are not but are strongly linked with Bitcoin performance. Moreover, weak negative effects of the VIX on both cryptocurrencies are detected while oil exerts weak positive impacts on Ethereum. Overall, Ethereum and Litecoin could serve for diversifiers against Bitcoin or hedgers against traditional assets during highly stressed periods with the advantage of not being affected by economic policy uncertainty news.

Sign in / Sign up

Export Citation Format

Share Document