Collective dynamics of opposing groups with stochastic communication
This paper studies collective dynamics of opposing groups with stochastic communication over a complete graph. The model is characterized by a first-order continuous-time dynamics with linear averaging components separating two different groups. Each group has its own coefficient function describing alignment of opinions between people in the same group and in different groups. Two scenarios are discussed for the stochasticity of interaction. The first scenario assumes random communication between a pair of persons and the coefficients are independent Binomial variables which are time-invariant. The second scenario assumes random communication that changes at a time step of \(k\tau\) for each positive integer \(k\) and \(\tau>0\). For both cases, it is shown that with high probability, the two groups' opinions will be separated in the sense of \(L^2\) and \(L^{\infty}\) distance under some conditions imposed on separation indices.
- Blow-up in multidimensional aggregation equations with mildly singular interaction kernels
- Boltzmann and Fokker-Planck equations modelling opinion formation in the presence of strong leaders
- Community detection and stochastic block models: recent developments
- CONTINUUM LIMIT OF SELF-DRIVEN PARTICLES WITH ORIENTATION INTERACTION
- Emergent Behavior in Flocks
- Emergent behaviors of the Cucker–Smale ensemble under attractive–repulsive couplings and Rayleigh frictions
- From particle to kinetic and hydrodynamic descriptions of flocking
- Heterophilious dynamics enhances consensus
- Kinetic models of opinion formation
- On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity
- On the complete synchronization of the Kuramoto phase model
- On the dynamics of social conflicts: looking for the black swan
- On the mathematics of emergence
- Random batch methods (RBM) for interacting particle systems
- Suppressing chemotactic blow-up through a fast splitting scenario on the plane
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
This page was built for publication: Collective dynamics of opposing groups with stochastic communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046188)