Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"Influence maximization"”.

  1. Influence maximization over a network : static and dynamic policies

    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 …

    mit Repository record for Influence maximization over a network : static and dynamic policies (opens in a new tab)

  2. An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model

    The problem of influence maximization has been studied extensively with applications that include viral marketing, recommendations, and feed ranking. The optimization problem, first formulated by Kempe, Kleinberg and Tardos, is known to be NP-hard. Thus, several heuristics have been proposed to …

    vt Repository record for An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model (opens in a new tab)

  3. NODE INFLUENCE IN NETWORK-BASED DISCRETE DYNAMICAL SYSTEMS

    … to such properties; in other words, how can the influence of a node, or set of nodes, be measured and how does it affect the large-scale dynamics of the system? Understanding this influence is crucial to characterize, predict, and control complex systems. Traditional lines of inquiry often …

    iu Repository record for NODE INFLUENCE IN NETWORK-BASED DISCRETE DYNAMICAL SYSTEMS (opens in a new tab)

  4. Probabilistic Models and Algorithmic Analysis of Network Problems

    … the lower bound. In the second problem, we study influence spreading in networks, which is a stochastic process. We propose a new optimization problem: minimizing the seed set with probabilistic guarantees on the influence. This problem relates to non-submodular target functions, and is hard even …

    houston Repository record for Probabilistic Models and Algorithmic Analysis of Network Problems (opens in a new tab)

  5. Task-specific summarization of networks: Optimization and Learning

    … for various tasks such as content-aware influence maximization and time segmentation. In addition, we study many real-world networks and their summary graphs such as people-contact, news-blogs, etc. and visualize them to make sense of their characteristics given the input task. 2. …

    vt Repository record for Task-specific summarization of networks: Optimization and Learning (opens in a new tab)

  6. Graph methods in Multi Agent Systems Coordination and Social Network Analysis

    … and characterize the optimal solution: the Influence Maximization Problem in Finite Time and the diffusion of innovation over a target set. • We characterize the novel Non Progressive Linear Threshold Model, which extends the classical Linear Threshold Model. We formalize the model and we …

    cagliari Repository record for Graph methods in Multi Agent Systems Coordination and Social Network Analysis (opens in a new tab)

  7. Optimization problems in networks and queues

    … from epidemic dynamics to queueing systems and influence propagation, the works share common analytical themes in the treatment of stochastic models, asymptotic behavior, and structural properties of optimal or equilibrium solutions. In the first problem, we develop a state-dependent epidemic …

    uiuc Repository record for Optimization problems in networks and queues (opens in a new tab)

  8. Three fundamental pillars of decision-centered teamwork

    … in the social networks domain, in the context of influence maximization. Additionally, I study a novel problem in social networks: I assume only a subgraph of the network is initially known, and we must spread influence and learn the graph simultaneously. I analyze a linear combination of two …

    lancaster Repository record for Three fundamental pillars of decision-centered teamwork (opens in a new tab)

  9. Blocking Negative Influential Node Set in Social Networks: From Host Perspective

    … spreading of information, innovations, ideas and influences among individuals. Viral marketing is a most prominent marketing strategy using word-of-mouth advertising in social networks. The key problem with the viral marketing is to find the set of influential users or seeds, who, when convinced …

    kennesaw Repository record for Blocking Negative Influential Node Set in Social Networks: From Host Perspective (opens in a new tab)

  10. A framework for large-scale dynamic social network analysis with application to key actor analysis

    Over the past decade, the availability of large and dynamic data sources from diverse domains including business, healthcare, and social media has significantly increased. Most of these data sources consist of rich information about actors' social roles, behavioral traits, and interactions which …

    uiuc Repository record for A framework for large-scale dynamic social network analysis with application to key actor analysis (opens in a new tab)