English
Related papers

Related papers: The maximum proportion of spreaders in stochastic …

200 papers

This paper models information diffusion in a network of Large Language Models (LLMs) that is designed to answer queries from distributed datasets, where the LLMs can hallucinate the answer. We introduce a two-time-scale dynamical model for…

Social and Information Networks · Computer Science 2025-04-22 Adit Jain , Vikram Krishnamurthy , Yiming Zhang

We characterize the growth of the Sibson and Arimoto mutual informations and $\alpha$-maximal leakage, of any order that is at least unity, between a random variable and a growing set of noisy, conditionally independent and…

Information Theory · Computer Science 2021-11-23 Benjamin Wu , Aaron B. Wagner , Ibrahim Issa , G. Edward Suh

Distributed statistical inference has recently attracted immense attention. The asymptotic efficiency of the maximum likelihood estimator (MLE), the one-step MLE, and the aggregated estimating equation estimator are established for…

Methodology · Statistics 2020-08-14 Ping Zhou , Zhen Yu , Jingyi Ma , Maozai Tian , Ye Fan

When an infection spreads in a community, an individual's probability of becoming infected depends on both her susceptibility and exposure to the contagion through contact with others. While one often has knowledge regarding an individual's…

Social and Information Networks · Computer Science 2017-12-05 Maggie Makar , John Guttag , Jenna Wiens

We define a stochastic reaction-diffusion process that describes a consensus formation in a non-sedentary population. The process is a diffusive version of the Majority Vote model, where the state update follows two stages: in the first…

Statistical Mechanics · Physics 2022-03-14 J. R. S. Lima , F. W. S. Lima , T. F. A. Alves , G. A. Alves , A. Macedo-Filho

Rumour spreading is a protocol for modelling the spread of information through a network via user-to-user interaction. The Spatial Preferred Attachment (SPA) model is a random graph model for complex networks: vertices are placed in a…

Social and Information Networks · Computer Science 2016-08-08 Jeannette Janssen , Abbas Mehrabian

We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erdos and Renyi. In this theory, a network is characterized by two parameters: the size…

Physics and Society · Physics 2007-05-23 K. Malarz , Z. Szvetelszky , B. Szekfu , K. Kulakowski

The paper considers gossip distributed estimation of a (static) distributed random field (a.k.a., large scale unknown parameter vector) observed by sparsely interconnected sensors, each of which only observes a small fraction of the field.…

Information Theory · Computer Science 2015-05-20 Soummya Kar , Jose' M. F. Moura

We study the stationary states of variants of the noisy voter model, subject to fluctuating parameters or external environments. Specifically, we consider scenarios in which the herding-to-noise ratio switches randomly and on different time…

Physics and Society · Physics 2023-06-01 Annalisa Caligiuri , Tobias Galla

We model the spread of information in a homogeneously mixed population using the Maki Thompson rumor model. We formulate an optimal control problem, from the perspective of single campaigner, to maximize the spread of information when the…

Systems and Control · Computer Science 2014-06-09 Kundan Kandhway , Joy Kuri

It is widely believed that one's peers influence product adoption behaviors. This relationship has been linked to the number of signals a decision-maker receives in a social network. But it is unclear if these same principles hold when the…

Social and Information Networks · Computer Science 2020-09-09 Soumajyoti Sarkar , Ashkan Aleali , Paulo Shakarian , Mika Armenta , Danielle Sanchez , Kiran Lakkaraju

We consider the problem of \emph{influence maximization}, the problem of maximizing the number of people that become aware of a product by finding the `best' set of `seed' users to expose the product to. Most prior work on this topic…

Social and Information Networks · Computer Science 2016-04-28 Sharan Vaswani , Laks. V. S. Lakshmanan , Mark Schmidt

We consider the duration of discussions in face-to-face contacts and propose a stochastic model to describe it. It is based on the points of a Levy flight where the duration of each contact corresponds to the size of the clusters produced…

Physics and Society · Physics 2024-08-23 S. Plaszczynski , B. Grammaticos , M. Badoual

Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…

Combinatorics · Mathematics 2010-02-19 Nikolaos Fountoulakis , Konstantinos Panagiotou

This short note contains a few comments and corrections about some recent models for the spread of rumors in a population. We consider a system of ordinary differential equations which describes the evolution of Ignorant-Spreaders-Stiflers…

Classical Analysis and ODEs · Mathematics 2016-11-29 Alberto Ragagnin

We present numerical results on a complex dynamical model for the aggregation of many individual rankings of S alternatives by the pairwise majority rule under a deliberative scenario. Agents are assumed to interact when the Kemeny distance…

Physics and Society · Physics 2009-11-13 G. L. Columbu , A. De Martino , A. Giansanti

One key problem in network analysis is the so-called influence maximization problem, which consists in finding a set $S$ of at most $k$ seed users, in a social network, maximizing the spread of information from $S$. This paper studies a…

Computer Science and Game Theory · Computer Science 2020-03-19 Ruben Becker , Gianlorenzo D'Angelo , Hugo Gilbert

The stationary distribution of allele frequencies under a variety of Wright--Fisher $k$-allele models with selection and parent independent mutation is well studied. However, the statistical properties of maximum likelihood estimates of…

Applications · Statistics 2009-10-12 Erkan Ozge Buzbas , Paul Joyce

Social network is a main tunnel of rumor spreading. Previous studies are concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its…

Physics and Society · Physics 2013-03-01 Yichao Zhang , Shi Zhou , Jihong Guan , Shuigeng Zhou

Suppose that a rumor originating from a single source among a set of suspects spreads in a network, how to root out this rumor source? With the a priori knowledge of suspect nodes and an observation of infected nodes, we construct a maximum…

Social and Information Networks · Computer Science 2016-11-17 Wenxiang Dong , Wenyi Zhang , Chee Wei Tan
‹ Prev 1 3 4 5 6 7 10 Next ›