1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

The problem of maximizing the spread of an opinion inside a social network has been investigated extensively during the past decade. The importance of this problem in applications such as marketing has been amplified by the major expansion of online social networks. In this thesis, we study opinion control policies, first under a broad class of deterministic dynamics governing the interactions inside a network, and then under the classical "Voter Model". In the former case, we design a policy that a controller can follow in order to spread an opinion inside a network with the smallest possible cost. In the latter case, we consider networks whose underlying graph is the d-dimensional integer torus Zd/n, and we design policies that minimize the expected time until the network reaches a consensus. We also show that, in dimension d >/= 2, dynamic policies do not perform significantly better than static policies, while, in dimension d = 1, optimal dynamic policies perform much better than optimal static policies..

Pertenece a

DSpace at MIT  

Autor(es)

Ben Chaouch, Zied - 

Id.: 69702363

Idioma: eng  - 

Versión: 1.0

Estado: Final

Tipo:  132 pages - 

Palabras claveElectrical Engineering and Computer Science. - 

Tipo de recurso: Thesis  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Formatos:  132 pages - 

Requerimientos técnicos:  Browser: Any - 

Fecha de contribución: 12-mar-2017

Contacto:

Localización:
* 973722726

Otros recursos que te pueden interesar

  1. Machine learning and coresets for automated real-time data segmentation and summarization In this thesis, we develop a family of real-time data reduction algorithms for large data streams, b...
  2. Aggregation for modular robots in the pivoting cube model In this thesis, we present algorithms for self-aggregation and self-reconfiguration of modular robot...
  3. On the equivalence of sparse statistical problems Sparsity is a widely used and theoretically well understood notion that has allowed inference to be ...
  4. Understanding resilience in large networks This thesis focuses on the analysis of robustness in large interconnected networks. Many real life s...
  5. A microfluidic mucosal airway model to study airway mucosal function and pathogenesis Airway mucus hypersecretion or impaired clearance is one of the key pathophysiological features of a...

Otros recursos de la mismacolección

  1. FairML : ToolBox for diagnosing bias in predictive modeling Predictive models are increasingly deployed for the purpose of determining access to services such a...
  2. Privatizing the Saudi electricity sector Electricity demand in Saudi Arabia has been growing rapidly with an average peak demand growth rate ...
  3. Aggregation for modular robots in the pivoting cube model In this thesis, we present algorithms for self-aggregation and self-reconfiguration of modular robot...
  4. On the equivalence of sparse statistical problems Sparsity is a widely used and theoretically well understood notion that has allowed inference to be ...
  5. Understanding resilience in large networks This thesis focuses on the analysis of robustness in large interconnected networks. Many real life s...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.