SearcharxivSearch

arXiv subjects

Matthew Garrod

Publications and source records attributed to Matthew Garrod.

3 recordsLinked to original sources

Influencing dynamics on social networks without knowledge of network microstructure

Social network based information campaigns can be used for promoting beneficial health behaviours and mitigating polarisation (e.g. regarding climate change or vaccines). Network-based intervention strategies typically rely on full knowledge of network structure. It is largely not possible or desirable to obtain population-level social network data due to availability and privacy issues. It is easier to obtain information about individuals' attributes (e.g. age, income), which are jointly informative of an individual's opinions and their social network position. We investigate strategies for influencing the system state in a statistical mechanics based model of opinion formation. Using synthetic and data based examples we illustrate the advantages of implementing coarse-grained influence strategies on Ising models with modular structure in the presence of external fields. Our work provides a scalable methodology for influencing Ising systems on large graphs and the first exploration of the Ising influence problem in the presence of ambient (social) fields. By exploiting the observation that strong ambient fields can simplify control of networked dynamics, our findings open the possibility of efficiently computing and implementing public information campaigns using insights from social network theory without costly or invasive levels of data collection.

physics.soc-ph

Large algebraic connectivity fluctuations in spatial network ensembles imply a predictive advantage from node location information

A Random Geometric Graph (RGG) ensemble is defined by the disordered distribution of its node locations. We investigate how this randomness drives sample-to-sample fluctuations in the dynamical properties of these graphs. We study the distributional properties of the algebraic connectivity which is informative of diffusion and synchronization timescales in graphs. We use numerical simulations to provide the first characterisation of the algebraic connectivity distribution for RGG ensembles. We find that the algebraic connectivity can show fluctuations relative to its mean on the order of $30 \%$, even for relatively large RGG ensembles ($N=10^5$). We explore the factors driving these fluctuations for RGG ensembles with different choices of dimensionality, boundary conditions and node distributions. Within a given ensemble, the algebraic connectivity can covary with the minimum degree and can also be affected by the presence of density inhomogeneities in the nodal distribution. We also derive a closed-form expression for the expected algebraic connectivity for RGGs with periodic boundary conditions for general dimension.

physics.soc-ph

Effects of population growth on the success of invading mutants

Understanding if and how mutants reach fixation in populations is an important question in evolutionary biology. We study the impact of population growth has on the success of mutants. To systematically understand the effects of growth we decouple competition from reproduction; competition follows a birth--death process and is governed by an evolutionary game, while growth is determined by an externally controlled branching rate. In stochastic simulations we find non-monotonic behaviour of the fixation probability of mutants as the speed of growth is varied; the right amount of growth can lead to a higher success rate. These results are observed in both coordination and coexistence game scenarios, and we find that the 'one-third law' for coordination games can break down in the presence of growth. We also propose a simplified description in terms of stochastic differential equations to approximate the individual-based model.

q-bio.PE