On periodical behaviour in societies with symmetric influences
From MaRDI portal
Publication:2266658
DOI10.1007/BF02579347zbMath0561.90008OpenAlexW1980767716MaRDI QIDQ2266658
Miroslav Sůra, Svatopluk Poljak
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579347
Economic growth models (91B62) Social choice (91B14) Mathematical sociology (including anthropology) (91D99)
Related Items
Simple dynamics on graphs, Fixed points in conjunctive networks and maximal independent sets in graph contractions, The \(r\)-majority vote action on 0-1 sequences, Parametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequences, On pre-periods of discrete influence systems, Asynchronous threshold networks, Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory, Sequential simulation of parallel iterations and applications, Diffusion in large networks, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Control and voting power in corporate networks: Concepts and computational aspects, The number of fixed points of the majority rule, Finite Dynamical Systems, Hat Games, and Coding Theory, Triggering cascades on undirected connected graphs, The complexity of the asynchronous prediction of the majority automata, Guaranteeing convergence of iterative skewed voting algorithms for image segmentation, Positive and negative cycles in Boolean networks, Irreversible conversion processes with deadlines, Dynamic monopolies in tori., On the computational power of discrete Hopfield nets, Majority rule cellular automata, Graphs with few \(P_4\)'s under the convexity of paths of order three, The Maximum Label Propagation Algorithm on Sparse Random Graphs, Majority dynamics with one nonconformist, A computational study of \(f\)-reversible processes on graphs, Performance of a neural network method with set partitioning, Reversible iterative graph processes, Dynamical Behaviour of Neural Networks, Color War: Cellular Automata with Majority-Rule, On the Period-Two-Property of the Majority Operator in Infinite Graphs, Irreversible conversion of graphs, Computer science and decision theory, Random majority percolation, On the rank and periodic rank of finite dynamical systems, Collective opinion as tendency towards consensus, Opinion dynamics using majority functions, Computing with truly asynchronous threshold logic networks, Size bounds for dynamic monopolies, Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Dynamic matching pennies on networks, Dynamic monopolies of constant size, Fixed points and 2-cycles of synchronous dynamic coloring processes on trees, Distributed probabilistic polling and applications to proportionate agreement, Local majorities, coalitions and monopolies in graphs: A review, Dynamics of positive automata networks, Social influence models with ranking alternatives and local election rules, On an application of convexity to discrete systems
Cites Work
