Finding a feasible flow in a strongly connected network

In this paper, a susceptible–exposed–infective–recovered–susceptible (SEIRS) epidemic model with vaccination has been formulated. We studied the global stability of the corresponding single-group model, multi-group model with strongly connected network and multi-group model without strongly connected network by means of analyzing their basic reproduction numbers and the application of Lyapunov functionals. Finally, we provide some numerical simulations to illustrate our analysis results.

Download Full-text

Inflation of strongly connected networks

Mathematical Proceedings of the Cambridge Philosophical Society ◽

10.1017/s0305004110000654 ◽

2011 ◽

Vol 150 (2) ◽

pp. 367-384 ◽

Cited By ~ 2

Author(s):

NIKITA AGARWAL

Keyword(s):

Sufficient Conditions ◽

Simple Algorithm ◽

Necessary And Sufficient Conditions ◽

Connected Network ◽

Cell Network ◽

Strongly Connected ◽

Necessary And Sufficient ◽

Strongly Connected Network

AbstractA coupled cell network is an inflation of if the dynamics of is embedded in as a quotient network. We give necessary and sufficient conditions for the existence of a strongly connected inflation of a strongly connected network. We provide a simple algorithm for the construction of a strongly connected inflation as a sequence of simple inflations.

Download Full-text

The Modified Rural Postman Problem in Vehicle Route Optimization

Communications - Scientific letters of the University of Zilina ◽

10.26552/com.c.2018.3.88-92 ◽

2018 ◽

Vol 20 (3) ◽

pp. 88-92

Author(s):

Petr Kozel ◽

Lucie Orlikova ◽

Sarka Michalcova

Keyword(s):

Linear Programming ◽

Real Life ◽

Transport Network ◽

Route Optimization ◽

Network Services ◽

Rural Postman Problem ◽

Life Problems ◽

Strongly Connected ◽

Service Vehicles ◽

Strongly Connected Network

The submitted paper deals with designing routes of the vehicles, which provide the transport network services. We limit our focus to such tasks, where the priority is the edge service in the transport network and the initial problem is finding an Eulerian path. Regarding to real-life problems, this contribution presents such procedure of solving, which takes into account both the existence of a mixed transport network containing one-way roads and the existence of a wider transport network. In this network, there are only selected edges with possibility of the effective passages. This problem can be solved by the modified Rural Postman Problem assuming the strongly connected network. Linear programming is a suitable tool for designing optimal routes of service vehicles.

Download Full-text

Adaptive Control of Dynamically Complex Networks with Saturation Couplings

Discrete Dynamics in Nature and Society ◽

10.1155/2016/4614856 ◽

2016 ◽

Vol 2016 ◽

pp. 1-9

Author(s):

Guoliang Wang ◽

Tingting Yan

Keyword(s):

Adaptive Control ◽

Complex Networks ◽

Original System ◽

Pinning Control ◽

Adaptive Controller ◽

Control Schemes ◽

Strongly Connected ◽

System States ◽

Strongly Connected Network ◽

Uniformly Bounded

This paper considers the control problem of dynamically complex networks with saturation couplings. Two novel control schemes in terms of adaptive control are presented to deal with such saturation couplings. Based on the robust idea, the underlying complex network is firstly transformed into a strongly connected network having time-varying uncertainty. However, the upper bound of uncertainty is unknown. Because of such an unavailable bound, a kind of adaptive controller added to each node is proposed such that the closed-loop auxiliary network is uniformly bounded. In particular, the original system states are asymptotically stable. Moreover, in order to avoid adding the desired controller to every node, another different kind of adaptive controller based on the pinning control idea is proposed. Compared with the former method, it is only applied to a part of nodes and has a good operability. Finally, a numerical example is provided to show the effectiveness of our results.

Download Full-text

Naive Learning Through Probability Overmatching

Operations Research ◽

10.1287/opre.2021.2202 ◽

2021 ◽

Author(s):

Itai Arieli ◽

Yakov Babichenko ◽

Manuel Mueller-Frank

Keyword(s):

Social Network ◽

Decision Rule ◽

Private Information ◽

Information Structures ◽

Long Run ◽

Strongly Connected ◽

Rational Inference ◽

High Level ◽

Action Spaces ◽

Strongly Connected Network

Naïve Learning in a Binary Action, Social Network Environment In “Naïve Learning Through Probability Overmatching,” I. Arieli, Y. Babichenko, and M. Mueller-Frank consider an environment where privately informed agents select a binary action repeatedly observing the past actions of their neighbors in a social network. Rational inference has been shown to be exceedingly complex in this environment. Instead, this paper focuses on boundedly rational agents that form beliefs according to discretized DeGroot updating and apply a decision rule that assigns a (mixed) action to each belief. It is shown that naïve learning, where the long run actions of all agents are optimal given their pooled private information, can be achieved in any strongly connected network if beliefs satisfy a high level of inertia and the decision rule coincides with probability overmatching. The main difference to existing naïve learning results is that here it is shown to hold (1) for binary rather than uncountable action spaces and (2) even for network and information structures where Bayesian agents fail to learn.

Download Full-text

Ongoing Global and Regional Adaptive Evolution of SARS-CoV-2

10.1101/2020.10.12.336644 ◽

2020 ◽

Cited By ~ 3

Author(s):

Nash D. Rochman ◽

Yuri I. Wolf ◽

Guilhem Faure ◽

Feng Zhang ◽

Eugene V. Koonin

Keyword(s):

Severe Acute Respiratory Syndrome ◽

Nucleocapsid Protein ◽

Temporal Dynamics ◽

Purifying Selection ◽

Spike Protein ◽

Epistatic Interactions ◽

Spatial And Temporal Dynamics ◽

Strongly Connected ◽

Small Set ◽

Strongly Connected Network

AbstractUnprecedented sequencing efforts have, as of October 2020, produced nearly 200,000 genomes of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), the virus responsible for COVID-19. Understanding the trends in SARS-CoV-2 evolution is paramount to control the pandemic, but analysis of this enormous dataset is a major challenge. We show that the ongoing evolution of SARS-CoV-2 over the course of the pandemic is characterized primarily by purifying selection but a small set of sites, including spike 614 and nucleocapsid 203-204 appear to evolve under positive selection. In addition to the substitutions in the spike protein, multiple substitutions in the nucleocapsid protein appear to be important for SARS-CoV-2 adaptation to the human host. The positively selected mutations form a strongly connected network of apparent epistatic interactions and are signatures of major partitions in the SARS-CoV-2 phylogeny. These partitions show distinct spatial and temporal dynamics, with both globalization and diversification trends being apparent.

Download Full-text

Intimation

10.1093/oso/9780198798422.003.0001 ◽

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).

Download Full-text

Public Awareness: What Climate Change Scientists Should Consider

Sustainability ◽

10.3390/su12208369 ◽

2020 ◽

Vol 12 (20) ◽

pp. 8369

Author(s):

Mohammad Rahimi

Keyword(s):

Climate Change ◽

Social Media ◽

Large Scale ◽

Public Awareness ◽

Connected Network ◽

Multi Scale ◽

Valuable Addition ◽

Scientific Approach ◽

Design Solutions ◽

Mitigate Climate Change

In this Opinion, the importance of public awareness to design solutions to mitigate climate change issues is highlighted. A large-scale acknowledgment of the climate change consequences has great potential to build social momentum. Momentum, in turn, builds motivation and demand, which can be leveraged to develop a multi-scale strategy to tackle the issue. The pursuit of public awareness is a valuable addition to the scientific approach to addressing climate change issues. The Opinion is concluded by providing strategies on how to effectively raise public awareness on climate change-related topics through an integrated, well-connected network of mavens (e.g., scientists) and connectors (e.g., social media influencers).

Download Full-text