Filters








42,287 Hits in 7.3 sec

Adaptive Submodular Influence Maximization with Myopic Feedback [article]

Guillaume Salha, Nikolaos Tziortziotis, Michalis Vazirgiannis
2018 arXiv   pre-print
This paper examines the problem of adaptive influence maximization in social networks.  ...  This strategy maximizes an alternative utility function that has been proven to be adaptive monotone and adaptive submodular.  ...  Adaptive influence maximization constitutes a sequential decision making problem where we have to design a policy π, determining sequentially which node(s) must be selected as seed(s) at each time step  ... 
arXiv:1704.06905v6 fatcat:3r76j74jsbhghohidro7hzevkm

Adaptive Influence Maximization: If Influential Node Unwilling to Be the Seed [article]

Jianxiong Guo, Weili Wu
2020 arXiv   pre-print
In this paper, we study the adaptive influence maximization with multiple activations (Adaptive-IMMA) problem, where we select a node in each iteration, observe whether she accepts to be a seed, if yes  ...  Influence maximization problem attempts to find a small subset of nodes that makes the expected influence spread maximized, which has been researched intensively before.  ...  At time step , ≥ 1, we set := −1 first; then, for those nodes activated first at time step −1 , ∈ ( −1 \ −2 ), it activates its each inactive outgoing neighbor with the probability by one chance.  ... 
arXiv:2005.08060v2 fatcat:x2c577oxbvf5zb5mqmffsetyia

Beyond Adaptive Submodularity: Adaptive Influence Maximization with Intermediary Constraints [article]

Shatian Wang, Zhen Xu, Van-Anh Truong
2019 arXiv   pre-print
In each round, it commissions an influencer to promote the product over a social network, and then observes the subsequent diffusion of the product before adaptively choosing the next influencer to commission  ...  Due to this added constraint, the order in which the influencers are chosen can change the influence spread, making obsolete existing analysis techniques that based on the notion of adaptive submodularity  ...  Throughout the text, we refer to the function w as influence probabilities. IC specifies an influence diffusion process that unfolds in discrete time steps. Initially, all nodes are unactivated.  ... 
arXiv:1911.02986v1 fatcat:tw55krk3hbeodiek3js7kj2tfm

Adaptive Influence Maximization in Social Networks: Why Commit when You can Adapt? [article]

Sharan Vaswani, Laks V.S. Lakshmanan
2016 arXiv   pre-print
Most previous work on influence maximization in social networks is limited to the non-adaptive setting in which the marketer is supposed to select all of the seed users, to give free samples or discounts  ...  In this paper, we study adaptive offline strategies for two problems: (a) MAXSPREAD -- given a budget on number of seeds and a time horizon, maximize the spread of influence and (b) MINTSS -- given a time  ...  For example, if p = 2 and s1 = 2, t1 = 5, s2 = 3, t2 = 7 we initially seed 2 nodes, wait for 5 time-steps, then seed 3 nodes, wait for 7 time-steps before the next intervention.  ... 
arXiv:1604.08171v1 fatcat:bjiuth5sjnfrrddayfvrhgxkse

Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization [article]

Kaixuan Huang, Yu Wu, Xuezhou Zhang, Shenyinying Tu, Qingyun Wu, Mengdi Wang, Huazheng Wang
2022 arXiv   pre-print
Online influence maximization aims to maximize the influence spread of a content in a social network with unknown network model by selecting a few seed nodes.  ...  We consider an adaptive version of content-dependent online influence maximization problem where the seed nodes are sequentially activated based on real-time feedback.  ...  In contrast to the non-adaptive setting, adaptive influence maximization allows the agent to select seed nodes in a sequential manner after observing partial diffusion results [12, 27, 22] .  ... 
arXiv:2206.14846v1 fatcat:lliotclb2fbkhd6eldeknjxfk4

How Does Active Participation Affect Consensus: Adaptive Network Model of Opinion Dynamics and Influence Maximizing Rewiring

Markus Brede
2019 Complexity  
not subject to influence adaptively attempt to maximize their influence.  ...  Comparing to adaptive processes of random and deliberately spread-reducing rewiring, we demonstrate that in regime (iii) competitive influence maximization can achieve near-minimal opinion spread within  ...  This work was supported by the University of Southampton and by the Turing-sponsored pilot project "Strategic Influence in Dynamic Opinion Formation."  ... 
doi:10.1155/2019/1486909 fatcat:k3ncq2s6jrd7bnh4wcwejrbg7e

Signaling between time steps prohibits nonlocality beyond hidden nonlocality [article]

Cornelia Spee
2020 arXiv   pre-print
We first determine the extreme points of the polytope defined by the no-signaling conditions within the same time step and the arrow-of-time constraints.  ...  In this work we show that if signaling between time steps is allowed then these states remain local even when considering the complete statistics of arbitrary sequences and therefore no advantage can be  ...  In order to achieve the maximal violation of the CHSH inequality in the first time step projective measurements are needed, which lead to a separable state to begin with in the second time step, which  ... 
arXiv:2011.12774v1 fatcat:orwzaq7omzdwjhfckaaih2ouxm

Optimizing fixed observational assets in a coastal observatory

Sergey Frolov, António Baptista, Michael Wilkin
2008 Continental Shelf Research  
In this article, we used our experience in the coastal observatory for the Columbia River estuary and plume to identify and address common problems in managing of fixed observational assets, such as salinity  ...  Proliferation of coastal observatories necessitates an objective approach to managing of observational assets.  ...  One such challenge is an optimal co-placement of fixed sensors; that is, a placement that will maximize the amount of collected information, maximize the synergy with existing observational networks, and  ... 
doi:10.1016/j.csr.2008.08.009 fatcat:6oadfyaj25fwvf4vpt6wtfbgoy

Towards optimal explicit time-stepping schemes for the gyrokinetic equations

H. Doerk, F. Jenko
2014 Computer Physics Communications  
Explicit Runge-Kutta schemes are considered to be well suited for time-stepping.  ...  Although the numerical algorithms are often highly optimized, performance can still be improved by a suitable choice of the time-stepping scheme, based on spectral analysis of the underlying operator.  ...  The time-stepping schemes RK vl {·, ∆t} and RK c {·, ∆t} can now be chosen individually.  ... 
doi:10.1016/j.cpc.2014.03.024 fatcat:5hns4qr37nbljlf4trvpsm6pzu

Adaptive time stepping for fluid-structure interaction solvers

M. Mayr, W.A. Wall, M.W. Gee
2018 Finite elements in analysis and design  
A novel adaptive time stepping scheme for fluid-structure interaction (FSI) problems is proposed that allows for controlling the accuracy of the time-discrete solution.  ...  The adaptive time stepping scheme is incorporated into a monolithic solution framework, but can straightforwardly be applied to partitioned solvers as well.  ...  Besides these local phenomena, the spatial discretization does not influence the adaptive time stepping as expected.  ... 
doi:10.1016/j.finel.2017.12.002 fatcat:dflgi2hlkrdwhjmy7ltrwzttca

Time-stepping and Krylov methods for large-scale instability problems [article]

Jean-Christophe Loiseau, Michele Alessandro Bucci, Stefania Cherubini, Jean-Christophe Robinet
2018 arXiv   pre-print
The aim of this chapter is thus to provide an overview of well-grounded matrix-free methods for fixed points computations and linear stability analyses of very large-scale nonlinear dynamical systems.  ...  Time-stepping and Krylov methods for large-scale instability problems 9 2.3.1 Optimal perturbation analysis Having observed that a random initial condition can experience  ...  Figure has been adapted from [4].  ... 
arXiv:1804.03859v1 fatcat:k56sfxl2cjg37ke4r26hnmjiku

Effect of time stepping strategy on adjoint-based production optimization

O. Volkov, D. V. Voskov
2015 Computational Geosciences  
In both strategies, we observe that the progress of the optimization process is greatly influenced by the degree of the time step refinement after control update.  ...  In the case of constrained simulations, the presence of control switches combined with large time steps after control update forces adaptive refinement to vary the time step size significantly.  ...  The influence of the time step refinement on the computation of NPV This section investigates the response of the objective function to the time step refinement in reservoir simulation with fixed control  ... 
doi:10.1007/s10596-015-9528-1 fatcat:2dpvzlcskbdilausupggv5dyxi

An adaptive multiresolution method for parabolic PDEs with time-step control

M. O. Domingues, O. Roussel, K. Schneider
2009 International Journal for Numerical Methods in Engineering  
Non-admissible choices of the time step are avoided by limiting its variation.  ...  Compact RK methods of second and third order are then used to choose automatically the new time step while controlling the approximation error in time.  ...  The time step in the above presented method is fixed for all scales, and hence the finest spatial scale present in the computations imposes the maximal time-step size, in order to guarantee the stability  ... 
doi:10.1002/nme.2501 fatcat:aa5mwqvcbrb43lobgyj6wybeqq

Local Time Stepping Method for District Heating Networks [chapter]

Matthias Eimer, Raul Borsche, Norbert Siedow
2019 Mathematics in Industry  
The numerical method applies the local time stepping introduced in [11] to networks of linear advection equations.  ...  A local time stepping scheme. Motivated by the above observation we will construct a procedure which decouples the time step in the network.  ...  This synchronized time step is determined by the minimal bound of the CFL conditions in all edges ∆t net = min e ∆t e , where ∆t e is the maximal time step allowed on edge e.  ... 
doi:10.1007/978-3-030-27550-1_50 fatcat:odhtsek6azal3dkcyjirce2ybm

A time-stepping scheme for inelastic collisions

B. Maury
2006 Numerische Mathematik  
The two other sets of results show the good behaviour of the scheme for large time steps.  ...  [0, 3], for a "small" time step h = 0.01, and two larger time steps h = 0.5 and h = 1.5.  ...  One can observe that for time steps of the type 2 −2n , we have convergence to a solution (Figure 3) , and for h = 2 −2(n+1) , we have convergence to the other solution (which corresponds to Figure 4  ... 
doi:10.1007/s00211-005-0666-6 fatcat:2d5mkzuakrb7vp7ijeq4xuexyi
« Previous Showing results 1 — 15 out of 42,287 results