1. |
- Acemoglu, Daron, et al.
(författare)
-
Harmonic influence in largescale networks
- 2014. - 3
-
Ingår i: ACM SIGMETRICS Performance Evaluation Review. - : Association for Computing Machinery (ACM). - 0163-5999. - 9781450327893 ; 42, s. 24-24
-
Konferensbidrag (refereegranskat)
|
|
2. |
- Acemoglu, Daron, et al.
(författare)
-
Opinion fluctuations and disagreement in social networks
- 2013
-
Ingår i: Mathematics of Operations Research. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0364-765X .- 1526-5471. ; 38:1, s. 1-27
-
Tidskriftsartikel (refereegranskat)abstract
- We study a tractable opinion dynamics model that generates long-run disagreements and persistent opinion fluctuations. Our model involves an inhomogeneous stochastic gossip process of continuous opinion dynamics in a society consisting of two types of agents: (1) regular agents who update their beliefs according to information that they receive from their social neighbors and (2) stubborn agents who never update their opinions and might represent leaders, political parties, or media sources attempting to influence the beliefs in the rest of the society. When the society contains stubborn agents with different opinions, the belief dynamics never lead to a consensus (among the regular agents). Instead, beliefs in the society fail to converge almost surely, the belief profile keeps on fluctuating in an ergodic fashion, and it converges in law to a nondegenerate random vector. The structure of the graph describing the social network and the location of the stubborn agents within it shape the opinion dynamics. The expected belief vector is proved to evolve according to an ordinary differential equation coinciding with the Kolmogorov backward equation of a continuous-time Markov chain on the graph with absorbing states corresponding to the stubborn agents, and hence to converge to a harmonic vector, with every regular agent's value being the weighted average of its neighbors' values, and boundary conditions corresponding to the stubborn agents' beliefs. Expected cross products of the agents' beliefs allow for a similar characterization in terms of coupled Markov chains on the graph describing the social network. We prove that, in large-scale societies, which are highly fluid, meaning that the product of the mixing time of the Markov chain on the graph describing the social network and the relative size of the linkages to stubborn agents vanishes as the population size grows large, a condition of homogeneous influence emerges, whereby the stationary beliefs' marginal distributions of most of the regular agents have approximately equal first and second moments.
|
|
3. |
|
|
4. |
- Cianfanelli, Leonardo, et al.
(författare)
-
Lockdown interventions in SIR models : Is the reproduction number the right control variable?
- 2021
-
Ingår i: 60th IEEE Conference on Decision and Control, CDC 2021. - 0743-1546 .- 2576-2370. - 9781665436595 ; 2021-December, s. 4254-4259
-
Konferensbidrag (refereegranskat)abstract
- The recent COVID-19 pandemic highlighted the need of non-pharmaceutical interventions in the first stages of a pandemic. Among these, lockdown policies proved unavoidable yet extremely costly from an economic perspective. To better understand the tradeoffs between economic and epidemic costs of lockdown interventions, we here focus on a simple SIR epidemic model and study lockdowns as solutions to an optimal control problem. We first show numerically that the optimal lockdown policy exhibits a phase transition from suppression to mitigation as the time horizon grows, i.e., if the horizon is short the optimal strategy is to impose severe lockdown to avoid diffusion of the infection, whereas if the horizon is long the optimal control steers the system to herd immunity to reduce economic loss. We then consider two alternative policies, motivated by government responses to the COVID19 pandemic, where lockdown levels are selected to either stabilize the reproduction number (i.e., "flatten the curve") or the fraction of infected (i.e., containing the number of hospitalizations). We compute analytically the performance of these two feedback policies and compare them to the optimal control. Interestingly, we show that in the limit of infinite horizon stabilizing the number of infected is preferable to controlling the reproduction number, and in fact yields close to optimal performance.
|
|
5. |
- Johansson, Björn, 1978-
(författare)
-
On Distributed Optimization in Networked Systems
- 2008
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Numerous control and decision problems in networked systems can be posed as optimization problems. Examples include the framework of network utility maximization for resource allocation in communication networks, multi-agent coordination in robotics, and collaborative estimation in wireless sensor networks (WSNs). In contrast to classical distributed optimization, which focuses on improving computational efficiency and scalability, these new applications require simple mechanisms that can operate under limited communication. In this thesis, we develop several novel mechanisms for distributed optimization under communication constraints, and apply these to several challenging engineering problems. In particular, we devise three tailored optimization algorithms relying only on nearest neighbor, also known as peer-to-peer, communication. Two of the algorithms are designed to minimize a non-smooth convex additive objective function, in which each term corresponds to a node in a network. The first method is an extension of the randomized incremental subgradient method where the update order is given by a random walk on the underlying communication graph, resulting in a randomized peer-to-peer algorithm with guaranteed convergence properties. The second method combines local subgradient iterations with consensus steps to average local update directions. The resulting optimization method can be executed in a peer-to-peer fashion and analyzed using epsilon-subgradient methods. The third algorithm is a center-free algorithm, which solves a non-smooth resource allocation problem with a separable additive convex objective function subject to a constant sum constraint. Then we consider cross-layer optimization of communication networks, and demonstrate how optimization techniques allow us to engineer protocols that mimic the operation of distributed optimization algorithms to obtain an optimal resource allocation. We describe a novel use of decomposition methods for cross-layer optimization, and present a flowchart that can be used to categorize and visualize a large part of the current literature on this topic. In addition, we devise protocols that optimize the resource allocation in frequency-division multiple access (FDMA) networks and spatial reuse time-division multiple access (TDMA) networks, respectively. Next we investigate some variants of the consensus problem for multi-robot coordination, for which it is usually standard to assume that agents should meet at the barycenter of the initial states. We propose a negotiation strategy to find an optimal meeting point in the sense that the agents' trajectories to the meeting point minimize a quadratic cost criterion. Furthermore, we also demonstrate how an augmented state vector can be used to boost the convergence rate of the standard linear distributed averaging iterations, and we present necessary and sufficient convergence conditions for a general version of these iterations. Finally, we devise a generic optimization software component for WSNs. To this end, we implement some of the most promising optimization algorithms developed by ourselves and others in our WSN testbed, and present experimental results, which show that the proposed algorithms work surprisingly well.
|
|