Group Influence: Mechanisms & Applications

• Group influence is the process by which groups affect individual decisions and system outcomes via network proximity, joint interactions, and contextual dynamics.
• Empirical studies reveal decaying peer pressure over social distance, with indirect ties and coalition thresholds significantly shaping behavior and adoption rates.
• Methodologies span differential equation models, attention-based group recommendation, and second-order influence functions to capture non-additive and complex interactions.

Group influence denotes mechanisms by which a set of others alters an individual state, a collective decision, or a system-level outcome. In current arXiv literature, the term is used in several related but non-equivalent senses: as distance-weighted peer pressure in social diffusion, as interpersonal influence inside small-group opinion dynamics, as threshold-based coalition effects in network analysis, and as the non-additive effect of groups of training examples in machine learning (Miranda et al., 2024). A plausible synthesis is that group influence concerns how joint context matters beyond isolated dyads: who is nearby in a network, who speaks and is believed, which subgroup receives intervention benefits, and which examples act redundantly or complementarily in model training (Shang et al., 2012).

1. Conceptual scope and formal meanings

The literature does not treat group influence as a single formal object. In innovation diffusion, it is a function of social distance: first-circle, second-circle, and third-circle contacts exert distinct pressures, with influence decaying across graph distance rather than terminating at direct adjacency (Miranda et al., 2024). In group recommendation and discussion models, it is an interpersonal influence operator that maps initial opinions to a settled pattern of disagreement through repeated updates or equilibrium equations (Shang et al., 2012). In threshold-based network centrality, it is a coalition property: a group becomes influential when the combined weight of several neighbors exceeds a node-specific threshold, and a member is pivotal if the group ceases to be critical when that member is removed (Aleskerov et al., 2016). In machine-learning attribution, it is the joint effect of removing or adding sets of training examples, where additivity can fail because examples are redundant or complementary (Heo et al., 15 May 2026).

Formalization	Core variables	Representative papers
Distance-weighted peer pressure	social distance $d$, Laplacians $\mathcal{L}_d$, coefficients $c_d$	(Miranda et al., 2024)
Equilibrium opinion adjustment	susceptibility $A$, interpersonal weights $W$, fixed-point map $V$	(Shang et al., 2012)
Threshold and coalition influence	thresholds $q_i$, critical groups, pivotal nodes	(Aleskerov et al., 2016)
Group data influence	leave-group-out effect $I_S$, interaction term $\kappa(z_i,z_j)$	(Heo et al., 15 May 2026)

This plurality matters methodologically. Some papers model group influence as an endogenous social process, some as an optimization constraint, and some as an attribution problem. The common feature is that outcomes depend on the structure of a group, not only on independent individual contributions.

2. Social-distance influence in innovation diffusion

A controlled laboratory study of innovation adoption operationalized group influence as distance-dependent peer pressure on a network derived from the Menzel and Katz physician-innovation network, slightly modified so that every node had at least two nodes at distance 1 and at least two nodes at distance 4 (Miranda et al., 2024). The experiment involved 592 participants across 21 sessions. Each session used a binary color-choice task in which one color represented the majority or tradition and the other the minority or innovation. The initial condition was 27 majority-color participants and 4 minority-color participants, corresponding to about 13% early adopters. Participants saw ego-network visualizations and were exposed to one of four informational settings: only two nearest neighbors; two nearest neighbors plus two nodes at distance 2; two nearest neighbors plus two nodes at distance 3; or two nearest neighbors plus two nodes at distance 4.

The direct-influence baseline was written as

$$\dot{u}(t)=-\gamma_{NN}\mathcal{L}_{NN}u(t),\qquad u(0)=u^0,$$

while the full distance-aware model was

$\mathcal{L}_d$0

Here $\mathcal{L}_d$1 is the nearest-neighbor Laplacian, $\mathcal{L}_d$2 is the Laplacian over nodes at graph distance $\mathcal{L}_d$3, and $\mathcal{L}_d$4 fixes direct influence as the baseline. Continuous-time dynamics were discretized to match experimental rounds, binary adoption was recovered by thresholding, and parameters were fit by minimizing mean squared error between predicted and empirical adoption curves over $\mathcal{L}_d$5, thresholds $\mathcal{L}_d$6, and time horizon $\mathcal{L}_d$7.

The main empirical finding was that indirect ties mattered materially. By rounds 3–5, settings II and III showed faster accumulation of adopters than setting I: at round 3, setting I was about 84.5%, settings II and III about 88.8%, and setting IV about 85.4%; at round 4, the adoption rates were 89.2%, 92.9%, 93.4%, and 91.1%; at round 5, 92.9%, 96.2%, 96.2%, and 94.2%. The fitted coefficients were $\mathcal{L}_d$8, $\mathcal{L}_d$9, and $c_d$0. The only reported statistically significant difference among these indirect effects was between second- and third-circle influence, with $c_d$1, while $c_d$2 and $c_d$3.

The authors summarized the decay pattern by

$c_d$4

which yields weights $c_d$5, $c_d$6, $c_d$7, and $c_d$8 for distances $c_d$9 through $A$0. This implies that second-circle pressure is roughly two-thirds of nearest-neighbor pressure and third-circle pressure about one-third. Random Forest feature-importance analysis supported the same conclusion: direct-neighbor information was most important, but information from more distant neighbors became predictive when those nodes were visible. The study therefore treats group influence as a genuinely multi-level contagion process rather than a purely local-neighborhood effect.

3. Opinion formation, conformity, and small-group dynamics

In social-influence network theory for group recommendation, the core object is a group-level opinion dynamic rather than a contagion curve. For an item $A$1, each member starts from an initial opinion vector $A$2 and repeatedly updates via

$A$3

where the diagonal matrix $A$4 encodes susceptibility and the row-stochastic matrix $A$5 encodes interpersonal influence (Shang et al., 2012). At equilibrium,

$A$6

This equilibrium is explicitly interpreted as a settled pattern of disagreement rather than full consensus. Ratings become “essential” when the structure of $A$7 and $A$8 causes a member’s initial opinion to exert disproportionate leverage on the fixed point.

Sequential discussion models make the same point in a different form. In a three-person estimation task, each speaking turn updates listeners by

$A$9

with $W$0 on a weighted, directed influence network (Moussaid et al., 2018). Exhaustive simulations over 46,656 possible networks for $W$1 showed that the best network is balanced with moderate mutual influence around $W$2 when everyone is equally skilled, but becomes asymmetric when skill differs: good performers should trust each other more, and bad performers should rely more on the good ones. A social learning rule then revises trust across repeated tasks, and the model predicts both a first-speaker effect within discussions and a late-speaker effect in the long run.

A separate empirical study of 31 teams of 4 people solving 45 trivia questions operationalized influence as a row-stochastic appraisal matrix $W$3, elicited by asking each person to distribute 100 chips across themselves and teammates after each round (Askarisichani et al., 2020). Expertise correlated with persuasiveness at $W$4, and confidence correlated with persuasiveness at $W$5. The paper proposed three discrete-time cognitive models—Differentiation, Differentiation + Reversion, and Differentiation + Reversion + Perceived expertise—and showed that low-performing individuals exhibit greater mean reversion and tend to underestimate high-performing teammates. These results locate group influence in the interaction between accuracy discovery, confidence cues, and repeated feedback.

Online environments complicate the classical conformity picture. In 6,366 Reddit threads with over 6.3 million comments from r/AmItheAsshole, majority-judgment disclosure did not produce simple convergence; instead, Bayesian regression and linguistic analysis indicated systematic anti-conformity, with individuals preserving the majority’s positive or negative orientation while diverging from its exact stance (Goglia et al., 25 Sep 2025). Disagreement measured by multi-label Shannon entropy remained roughly stable after disclosure, “no judgment” comments increased, and post-disclosure rhetoric became more persuasive. By contrast, multimodal LLMs in Asch-style visual tasks exhibited a systematic conformity bias aligned with Social Impact Theory: conformity increased with group size, unanimity, task difficulty, and source characteristics, and most models showed a public-exposure effect measured by $W$6 (Bellina et al., 8 Jan 2026). A plausible implication is that group influence is not uniformly conformist or anti-conformist; its direction depends on anonymity, observability, competence boundaries, and the architecture of the agents involved.

4. Influence-aware recommendation and group choice

Group recommendation research treats group influence as heterogeneity in member contribution, not as a simple average of preferences. SIAGR, “Social Influence-based Attentive Group Recommendation,” grounds this claim in social identity theory and two-step flow theory, then estimates item-specific member influence by attention:

$W$7

with $W$8 (Wang et al., 2019). The final group representation combines an influence-aware weighted sum of member embeddings with a BERT-based interaction representation:

$W$9

On CAMRa2011 and Plancast, evaluated by HR@N and MRR, the full SIAGR model outperformed AGREE, COM, PIT, NCF+AVG, and NCF+LM.

DisRec sharpened this line of work by arguing that many group recommenders suffer from a “preference bias issue”: they bundle preferences and social influence into a single representation and therefore emphasize the preferences of the majority within the group rather than the actual interaction items (Ye et al., 20 Jan 2025). Its solution is a user-level disentangling network with separate preference and social-influence propagation branches, followed by attention-based group aggregation and a social-based contrastive learning strategy that removes either the most important or least important user according to learned attention weights. Experiments on Mafengwo and Yelp reported that the full model outperformed state-of-the-art baselines, while ablations showed that removing social influence embeddings, preference embeddings, or the self-supervised strategy all degraded performance.

EIGR extended influence-aware group recommendation to online media streams, where the target is not only relevance but downstream propagation (He et al., 2 Jul 2025). The framework adds Graph Extraction-based Sampling to reduce redundancy across temporal graphs, a Dynamic Independent Cascade model to estimate item-aware group propagation, and a two-level hash-based UG-Index for real-time retrieval. In the DYIC formulation, the edge probability from group $V$0 to group $V$1 for item $V$2 is

$V$3

where activeness, similarity, and sender/receiver willingness are combined. On Yelp, MovieLens 1M, and Mafengwo, EIGR improved HR@20, NDCG@20, and normalized group influence $V$4 over LightGCN, GroupIM, ConsRec, and IGR, while UG-Index reduced response time for 1,000 incoming items to 1.94, 1.24, and 1.01 on the three datasets respectively.

Across these models, group influence is operationalized as dynamic, context-dependent weighting of members or groups. Static aggregation rules such as average, least misery, or maximum satisfaction are therefore treated as insufficient approximations when discussion, authority, or propagation capacity materially shape the outcome.

5. Fairness and optimization of influence allocation

Influence maximization traditionally optimizes total expected spread under the independent cascade model, but fairness-aware work reframes the problem around how benefits are distributed across groups (Tsang et al., 2019). Groups are subsets $V$5 that may overlap, so the formulation explicitly accommodates intersectionality. Two fairness notions are introduced. Maximin fairness seeks to maximize the minimum per-capita influence received by any group. Diversity constraints, also called group rationality, require that each group receive at least as much influence as it could achieve on its own induced subgraph with a proportional “fair share” of seeds.

These fairness objectives are consequential because they break the submodularity that makes classical greedy influence maximization effective. The paper proves that the Maximin and Rational utilities are not submodular, reduces both problems to multiobjective submodular maximization, and proposes a new practical solver built from threshold inclusion, continuous optimization over multilinear extensions, and rounding via approximate Carathéodory decomposition and swap rounding. The central continuous method is MultiFW, a Frank–Wolfe-style algorithm, with S-SP-MD as a stochastic saddle-point mirror descent subroutine to find directions that make simultaneous progress across objectives.

The theoretical guarantees are asymptotically near-optimal: as $V$6, the approximation approaches $V$7 when $V$8. The paper also shows that the price of fairness can be unbounded for both Rational and Maximin objectives, and may worsen arbitrarily with overlapping groups. Yet the empirical results on homeless-youth HIV-prevention networks and synthetic Antelope Valley obesity-prevention networks were less severe: standard greedy methods often neglected small or marginalized groups, diversity constraints reduced constraint violations by about 55–65%, and the price of fairness in practice was typically around 1.05–1.15. Group influence here is therefore not only a diffusion quantity but also a distributive one: who gets reached becomes part of the objective itself.

6. Group influence in explainability, attribution, and data selection

In machine-learning explainability, group influence refers to how removing or adding a set of training examples changes a target quantity such as held-out loss or a test prediction. First-order influence functions estimate this effect by summing pointwise influences, and empirical work found that this approximation often correlates surprisingly well with actual leave-group-out retraining effects even when absolute and relative errors are large (Koh et al., 2019). The theory in that paper attributes strong correlation to particular settings where the parameter shift is small and local smoothness holds, while noting that such agreement need not hold in general.

Second-order methods were proposed because group removal can produce parameter shifts too large for a first-order Taylor approximation. For linear models, the second-order group influence function expands parameter changes as $V$9 and adds a curvature term that depends on within-group Hessians (Basu et al., 2019). On MNIST logistic regression, when more than about 36% of training samples were removed, the correlation improvement over first-order influence was often more than 40%; for coherent groups it was at least 15% across group sizes; and in one synthetic MNIST logistic-regression case with 50% of the data removed, the improvement exceeded 55%. The same work showed that optimizing the second-order objective improved the selection of the most influential group relative to greedy first-order or random selection.

Interaction-aware influence functions generalized the idea by expanding the target function itself to second order and introducing the pairwise interaction

$q_i$0

This term captures alignment, redundancy, and complementarity among examples (Heo et al., 15 May 2026). Across six dataset–model pairs spanning logistic regression, MLPs, and ResNet-9, the estimator labeled F+I was best on all six settings and improved Spearman rank correlation with leave-group-out retraining by up to +0.67. In instruction-tuning selection for Llama-3.1-8B, it selected 13,534 examples, corresponding to 5% of a 270K pool, and outperformed prior influence-based and representation-similarity baselines on five of seven downstream tasks.

Group-MATES extends the same non-additivity principle to pretraining data selection (Yu et al., 20 Feb 2025). Its relational data influence model weights individual influence by relationships among training examples, with the explicit claim that data can cancel or amplify one another. On DCLM 400M-4x, 1B-1x, and 3B-1x, Group-MATES achieved 3.5%–9.4% relative performance gains over random selection across 22 downstream tasks and reduced the number of tokens required to reach a target downstream performance by up to 1.75x. The broader conclusion is stable across these papers: group influence in training data is not just the sum of pointwise effects, and accurate attribution requires modeling interactions.

7. Extensions, applications, and abstract network formulations

Outside classical diffusion and recommendation, group influence appears in organizational behavior, segregation dynamics, and decentralized agent systems. In software development teams, leadership studies based on a systematic literature review of 80 articles and two industrial case studies with 76 software engineers in Brazil and Canada argue that leaders influence innovative behavior through acceptance of new ideas, leader proximity, leadership support, and ambidextrous use of transactional and transformational practices (Silva et al., 2017). In an agent-based desegregation model with a physical population layer and a virtual group-leader layer, desegregation was directly proportional to the frequency of leader contact and mostly ineffective with increased contact intensity; the strongest reported desegregation case, 0.1917, occurred at $q_i$1, $q_i$2, $q_i$3, and $q_i$4 (Zia et al., 2019). In asynchronous multi-agent voting, preferential communication channels and friend structures shape dominant-value outcomes, and a hybrid of dominant value and consensus integration yielded the best practical weather-forecasting performance in the reported prototype (Maleszka, 2021).

More abstract formulations remove the social interpretation almost entirely but retain the logic of group-level effects. A simple graph model of influence defines groups as rooted fragments whose passive vertices adopt the opinion of an active root; active edges trigger group mergers, and the expected number of active vertices follows

$q_i$5

With stubborn vertices, additional loss terms accelerate the disappearance of independent influencers (Cooper et al., 2023). In centrality theory, Long-Range Interactions Centrality incorporates node attributes, thresholds, pivotal coalitions, and long-range paths to detect hidden central elements that classical degree-, path-, or prestige-based measures can miss (Aleskerov et al., 2016). In graph theory, the phrase “influence of the group” refers to how the abelian group chosen for group-valued flows affects flow-continuous mappings: the main theorem states that the number of such mappings depends only on the largest order of an element of the group, namely its exponent, and for cubic graphs only $q_i$6, $q_i$7, and $q_i$8 are relevant (Šámal, 2012).

Taken together, these literatures treat group influence as a structural property of interaction systems. Sometimes it is peer pressure that decays with social distance; sometimes it is equilibrium compromise; sometimes it is coalition thresholding, fairness-constrained diffusion, or non-additive data attribution. The recurrent technical message is that group-level structure cannot generally be reduced to independent pairwise effects or simple averages.