On periodical behaviour in societies with symmetric influences

From MaRDI portal
Revision as of 10:19, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (48)

Simple dynamics on graphsFixed points in conjunctive networks and maximal independent sets in graph contractionsThe \(r\)-majority vote action on 0-1 sequencesParametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequencesOn pre-periods of discrete influence systemsAsynchronous threshold networksFixed Points of Boolean Networks, Guessing Graphs, and Coding TheorySequential simulation of parallel iterations and applicationsDiffusion in large networksGeneral-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic ResultsControl and voting power in corporate networks: Concepts and computational aspectsThe number of fixed points of the majority ruleFinite Dynamical Systems, Hat Games, and Coding TheoryTriggering cascades on undirected connected graphsThe complexity of the asynchronous prediction of the majority automataGuaranteeing convergence of iterative skewed voting algorithms for image segmentationPositive and negative cycles in Boolean networksIrreversible conversion processes with deadlinesDynamic monopolies in tori.On the computational power of discrete Hopfield netsMajority rule cellular automataGraphs with few \(P_4\)'s under the convexity of paths of order threeThe Maximum Label Propagation Algorithm on Sparse Random GraphsMajority dynamics with one nonconformistA computational study of \(f\)-reversible processes on graphsPerformance of a neural network method with set partitioningReversible iterative graph processesDynamical Behaviour of Neural NetworksColor War: Cellular Automata with Majority-RuleOn the Period-Two-Property of the Majority Operator in Infinite GraphsIrreversible conversion of graphsComputer science and decision theoryThe Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration PeriodicityRandom majority percolationOn the rank and periodic rank of finite dynamical systemsCollective opinion as tendency towards consensusOpinion dynamics using majority functionsComputing with truly asynchronous threshold logic networksSize bounds for dynamic monopoliesIrreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinionDynamic matching pennies on networksDynamic monopolies of constant sizeFixed points and 2-cycles of synchronous dynamic coloring processes on treesDistributed probabilistic polling and applications to proportionate agreementLocal majorities, coalitions and monopolies in graphs: A reviewDynamics of positive automata networksSocial influence models with ranking alternatives and local election rulesOn an application of convexity to discrete systems




Cites Work




This page was built for publication: On periodical behaviour in societies with symmetric influences