相关论文: A spatial stochastic model for rumor transmission

We study relativistic scattering when one only has access to a subset of the particles, using the language of quantum measurement theory. We give an exact, non-perturbative formula for the von Neumann entanglement entropy of an apparatus…

The position of a reaction front, propagating into a metastable state, fluctuates because of the shot noise of reactions and diffusion. A recent theory [B. Meerson, P.V. Sasorov, and Y. Kaplan, Phys. Rev. E 84, 011147 (2011)] gave a closed…

Consider a system performing a continuous-time random walk on the integers, subject to catastrophes occurring at constant rate, and followed by exponentially-distributed repair times. After any repair the system starts anew from state zero.…

Opinion dynamics of random-walking agents on finite two-dimensional lattices is studied. In the model, the opinion is continuous, and both the lattice and the opinion can be either periodic or non-periodic. At each time step, all agents…

The problem of distributed identification of linear stochastic system with unknown coefficients over time-varying networks is considered. For estimating the unknown coefficients, each agent in the network can only access the input and the…

We examine characteristic properties of deterministic and stochastic diffusion in low-dimensional chaotic dynamical systems. As an example, we consider a periodic array of scatterers defined by a simple chaotic map on the line. Adding…

In this paper, we describe a representation for spatial information, called the stochastic map, and associated procedures for building it, reading information from it, and revising it incrementally as new information is obtained. The map…

Scaling limits are analyzed for stochastic continuous opinion dynamics systems, also known as gossip models. In such models, agents update their vector-valued opinion to a convex combination (possibly agent- and opinion-dependent) of their…

We introduce and solve a model that mimics the herding effect in financial markets when groups of agents share information. The number of agents in the model is growing and at each time step either (i) with probability $p$ an incoming agent…

We study the optimal transmission and scheduling policy for a transmitter (source) communicating with two gossiping receivers aiming at tracking the source's status over time using the age of information (AoI) metric. Gossiping enables…

Reputation is a central element of social communications, be it with human or artificial intelligence (AI), and as such can be the primary target of malicious communication strategies. There is already a vast amount of literature on trust…

The propagation of light in a scattering medium is described as the motion of a special kind of a Brownian particle on which the fluctuating forces act only perpendicular to its velocity. This enforces strictly and dynamically the…

Wireless communication systems, such as wireless sensor networks and RFIDs, are increasingly adopted to transfer potential highly sensitive information. Since the wireless medium has a sharing nature, adversaries have a chance to eavesdrop…

An important aspect in jointly analysing networked control systems and their communication is to model the networking in a sufficiently rich but at the same time mathematically tractable way. As such, this paper improves on a recently…

We study how a behavior (an idea, buying a product, having a disease, adopting a cultural fad or a technology) spreads among agents in an a social network that exhibits segregation or homophily (the tendency of agents to associate with…

We study the evolution of cooperation in an interacting particle system with two types. The model we investigate is an extension of a two-type biased voter model. One type (called defector) has a (positive) bias $\alpha$ with respect to the…

We study the process of information dispersal in a network with communication errors and local error-correction. Specifically we consider a simple model where a single bit of information initially known to a single source is dispersed…

We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number…

We present numerical simulations of a model of social influence, where the opinion of each agent is represented by a binary vector. Agents adjust their opinions as a result of random encounters, whenever the difference between opinions is…

We study networks of gossiping users where a source observing a process sends updates to an underlying graph. Nodes in the graph update their neighbors randomly and nodes always accept packets that have newer information, thus attempting to…