Belief Control Strategies for Interactions Over Weakly-Connected Graphs
نویسندگان
چکیده
In diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents shape the beliefs of non-influential agents. This paper analyzes this mechanism more closely and addresses two main questions. First, article examines how much freedom have in controlling receiving agents, namely, whether can be driven to arbitrary network structure limits scope control by Second, even if there is a limit what accomplish, develops mechanisms which they lead adopt certain beliefs. These questions raise interesting possibilities about belief networked Once addressed, one ends up with design procedures allow drive other endorse particular regardless their local observations or convictions. The theoretical findings are illustrated means examples.
منابع مشابه
Strong weakly connected domination subdivisible graphs
The weakly connected domination subdivision number sdγw(G) of a connected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strongγw-subdivisible if for each edge uv ∈ E(G) we have γw(Guv) > γw(G), where Guv is a graph G with subdivided edge uv. The graph is s...
متن کاملA characterization of weakly four-connected graphs
A graph G = (V, E) is called weakly four-connected if G is 4-edge-connected and G − x is 2-edge-connected for all x ∈ V . We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four-connected graphs. By using these results we prove that every minimally weakly fourconnected graph on at least four vertices contains at least three ‘splittable’ vertices of...
متن کاملOn weakly connected domination in graphs
Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v]. The subgraph weakly induced by S is 〈S〉w = (N [S], E ∩ (S × N [S])). A set S is a weakly-connected dominating set of G if S is dominating and 〈S〉w is connected. The weakly-connected domination numb...
متن کاملThalamo-cortical Interactions Modeled by Forced Weakly Connected Oscillatory Networks
Modeled by Forced Weakly Connected Oscillatory Networks Proceedings of International Conference on Neural Networks 97, Houston TX; I:328{331 Frank C. Hoppensteadt and Eugene M. Izhikevich Center for Systems Science & Engineering Arizona State University, Box 87-7606 Tempe, AZ 85287-7606 [email protected], [email protected] Abstract In this paper we do not discuss what a thalamocortical syst...
متن کاملReplica Divergence Control Protocol in Weakly Connected Environment
This paper presents a consistency control protocol destined for groups of cooperative processes located worldwide. We assume that processes cooperate by sharing a replicated object. We consider processes with well-known profiles; however, the actual behaviour of each process could diverge from the profile. The protocol aims at offering a good quality of service to cooperative processes, while g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE open journal of signal processing
سال: 2021
ISSN: ['2644-1322']
DOI: https://doi.org/10.1109/ojsp.2021.3081026