Managing consensus based on community classification in opinion dynamics
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
<abstract><p>Opinion dynamics in social networks are fast becoming an essential instrument for concentrating on the effect of individual choices on external public information. One of the main challenges in seeing the dynamics is reaching an opinion consensus acceptable to managers in a social network. This issue is referred to as a consensus-reaching process (CRP). Most studies of CRP focus only on network structure and ignore the effect of agent opinions. In addition, existing methods ignore the diversities between divided communities. How to synthesize individual opinions with community diversities to solve CRP issues has remained unclear. Using the DeGroot model for opinion control, this paper considers the effects of network structures and agent opinions when dividing communities, incorporating community classification and targeted opinion control strategies. First, a community classification enhancement approach is utilized, introducing the concept of ambiguous nodes and their division methods. Second, we separate all communities into three levels, $ Center $, $ Base $, and $ Fringe $, according to the logical regions for opinion control. Third, an edge expansion algorithm and three opinion control strategies are proposed based on the community levels, which can significantly reduce the time it takes for the network to reach a consensus. Finally, numerical analysis and comparison are given to verify the feasibility of the proposed opinion control strategy.</p></abstract>
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it