6,449 research outputs found
S3: Social-network Simulation System with Large Language Model-Empowered Agents
Social network simulation plays a crucial role in addressing various
challenges within social science. It offers extensive applications such as
state prediction, phenomena explanation, and policy-making support, among
others. In this work, we harness the formidable human-like capabilities
exhibited by large language models (LLMs) in sensing, reasoning, and behaving,
and utilize these qualities to construct the S system (short for
ocial network imulation ystem). Adhering to
the widely employed agent-based simulation paradigm, we employ prompt
engineering and prompt tuning techniques to ensure that the agent's behavior
closely emulates that of a genuine human within the social network.
Specifically, we simulate three pivotal aspects: emotion, attitude, and
interaction behaviors. By endowing the agent in the system with the ability to
perceive the informational environment and emulate human actions, we observe
the emergence of population-level phenomena, including the propagation of
information, attitudes, and emotions. We conduct an evaluation encompassing two
levels of simulation, employing real-world social network data. Encouragingly,
the results demonstrate promising accuracy. This work represents an initial
step in the realm of social network simulation empowered by LLM-based agents.
We anticipate that our endeavors will serve as a source of inspiration for the
development of simulation systems within, but not limited to, social science
Epidemic modelling by ripple-spreading network and genetic algorithm
Mathematical analysis and modelling is central to infectious disease epidemiology. This paper, inspired by the natural ripple-spreading phenomenon, proposes a novel ripple-spreading network model for the study of infectious disease transmission. The new epidemic model naturally has good potential for capturing many spatial and temporal features observed in the outbreak of plagues. In particular, using a stochastic ripple-spreading process simulates the effect of random contacts and movements of individuals on the probability of infection well, which is usually a challenging issue in epidemic modeling. Some ripple-spreading related parameters such as threshold and amplifying factor of nodes are ideal to describe the importance of individuals’ physical fitness and immunity. The new model is rich in parameters to incorporate many real factors such as public health service and policies, and it is highly flexible to modifications. A genetic algorithm is used to tune the parameters of the model by referring to historic data of an epidemic. The well-tuned model can then be used for analyzing and forecasting purposes. The effectiveness of the proposed method is illustrated by simulation results
A survey of statistical network models
Networks are ubiquitous in science and have become a focal point for
discussion in everyday life. Formal statistical models for the analysis of
network data have emerged as a major topic of interest in diverse areas of
study, and most of these involve a form of graphical representation.
Probability models on graphs date back to 1959. Along with empirical studies in
social psychology and sociology from the 1960s, these early works generated an
active network community and a substantial literature in the 1970s. This effort
moved into the statistical literature in the late 1970s and 1980s, and the past
decade has seen a burgeoning network literature in statistical physics and
computer science. The growth of the World Wide Web and the emergence of online
networking communities such as Facebook, MySpace, and LinkedIn, and a host of
more specialized professional network communities has intensified interest in
the study of networks and network data. Our goal in this review is to provide
the reader with an entry point to this burgeoning literature. We begin with an
overview of the historical development of statistical network modeling and then
we introduce a number of examples that have been studied in the network
literature. Our subsequent discussion focuses on a number of prominent static
and dynamic network models and their interconnections. We emphasize formal
model descriptions, and pay special attention to the interpretation of
parameters and their estimation. We end with a description of some open
problems and challenges for machine learning and statistics.Comment: 96 pages, 14 figures, 333 reference
Mixed membership stochastic blockmodels
Observations consisting of measurements on relationships for pairs of objects
arise in many settings, such as protein interaction and gene regulatory
networks, collections of author-recipient email, and social networks. Analyzing
such data with probabilisic models can be delicate because the simple
exchangeability assumptions underlying many boilerplate models no longer hold.
In this paper, we describe a latent variable model of such data called the
mixed membership stochastic blockmodel. This model extends blockmodels for
relational data to ones which capture mixed membership latent relational
structure, thus providing an object-specific low-dimensional representation. We
develop a general variational inference algorithm for fast approximate
posterior inference. We explore applications to social and protein interaction
networks.Comment: 46 pages, 14 figures, 3 table
MULTI AGENT-BASED ENVIRONMENTAL LANDSCAPE (MABEL) - AN ARTIFICIAL INTELLIGENCE SIMULATION MODEL: SOME EARLY ASSESSMENTS
The Multi Agent-Based Environmental Landscape model (MABEL) introduces a Distributed Artificial Intelligence (DAI) systemic methodology, to simulate land use and transformation changes over time and space. Computational agents represent abstract relations among geographic, environmental, human and socio-economic variables, with respect to land transformation pattern changes. A multi-agent environment is developed providing task-nonspecific problem-solving abilities, flexibility on achieving goals and representing existing relations observed in real-world scenarios, and goal-based efficiency. Intelligent MABEL agents acquire spatial expressions and perform specific tasks demonstrating autonomy, environmental interactions, communication and cooperation, reactivity and proactivity, reasoning and learning capabilities. Their decisions maximize both task-specific marginal utility for their actions and joint, weighted marginal utility for their time-stepping. Agent behavior is achieved by personalizing a dynamic utility-based knowledge base through sequential GIS filtering, probability-distributed weighting, joint probability Bayesian correlational weighting, and goal-based distributional properties, applied to socio-economic and behavioral criteria. First-order logics, heuristics and appropriation of time-step sequences employed, provide a simulation-able environment, capable of re-generating space-time evolution of the agents.Environmental Economics and Policy,
Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs
Mathematical models of cellular physiological mechanisms often involve random
walks on graphs representing transitions within networks of functional states.
Schmandt and Gal\'{a}n recently introduced a novel stochastic shielding
approximation as a fast, accurate method for generating approximate sample
paths from a finite state Markov process in which only a subset of states are
observable. For example, in ion channel models, such as the Hodgkin-Huxley or
other conductance based neural models, a nerve cell has a population of ion
channels whose states comprise the nodes of a graph, only some of which allow a
transmembrane current to pass. The stochastic shielding approximation consists
of neglecting fluctuations in the dynamics associated with edges in the graph
not directly affecting the observable states. We consider the problem of
finding the optimal complexity reducing mapping from a stochastic process on a
graph to an approximate process on a smaller sample space, as determined by the
choice of a particular linear measurement functional on the graph. The
partitioning of ion channel states into conducting versus nonconducting states
provides a case in point. In addition to establishing that Schmandt and
Gal\'{a}n's approximation is in fact optimal in a specific sense, we use recent
results from random matrix theory to provide heuristic error estimates for the
accuracy of the stochastic shielding approximation for an ensemble of random
graphs. Moreover, we provide a novel quantitative measure of the contribution
of individual transitions within the reaction graph to the accuracy of the
approximate process.Comment: Added one reference, typos corrected in Equation 6 and Appendix C,
added the assumption that the graph is irreducible to the main theorem
(results unchanged
- …