[{"id":19351,"title":"Nonprogressive Diffusion on Social Networks: Approximation and Applications","permalink":"https:\/\/bschool.nus.edu.sg\/biz-events\/event\/nonprogressive-diffusion-on-social-networks-approximation-and-applications\/","category":"Seminars and talks","event_dept":{"value":"analytics-operations","label":"Analytics & Operations"},"event_sec_dept":false,"event_details":{"event_start_date":"4  December  2023","event_end_date":"4  December  2023","event_start_time":"10:00 am","event_end_time":"11:30 am","event_dress_code":"NA"},"event_loc":{"eve_address_selection":"1","eve_location_1":{"eve_org":"NUS Business School","eve_build":"Mochtar Riady Building","eve_room":"BIZ1 0302","eve_add":"15 Kent Ridge Drive","eve_count":"Singapore","eve_copos":"119245","eve_map_url":"https:\/\/goo.gl\/maps\/Q1kyjwxHNE22"},"eve_location_2":{"eve_org":"Shaw Foundation Alumni House","eve_build":"","eve_room":"Clove and Lemongrass Room Level 2","eve_add":"11 Kent Ridge Drive","eve_count":"Singapore","eve_copos":119244,"eve_map_url":"https:\/\/goo.gl\/maps\/docgThkDWFxKdb9c7"},"eve_location_3":{"eve_org":"Hon Sui Sen Memorial Library Auditorium","eve_build":"","eve_room":"","eve_add":"1 Hon Sui Sen Drive","eve_count":"Singapore","eve_copos":117588,"eve_map_url":"https:\/\/goo.gl\/maps\/NJjWK4RMpC92"},"eve_location_4":{"eve_org":"NUSS Kent Ridge Guild House","eve_build":"","eve_room":"Dalvey Room","eve_add":"9 Kent Ridge Drive","eve_count":"Singapore","eve_copos":119241,"eve_map_url":"https:\/\/goo.gl\/maps\/nXn2Luh96pH2"},"eve_location_5":{"eve_org":"Institute of Data Science","eve_build":"Innovation 4.0","eve_room":"1-3","eve_add":"3 Research Link","eve_count":"Singapore","eve_copos":117602,"eve_map_url":"https:\/\/goo.gl\/maps\/i1xocvvDh27QUXem7"},"eve_location_6":{"eve_org":"","eve_build":"","eve_room":"","eve_add":"","eve_count":"","eve_copos":"","eve_map_url":""},"eve_location_7":""},"event_introduction":"","event_short_intro":"","event_topic":null,"event_banner":false,"event_external_url":"","event_registration_details":{"event_registration_form":false,"event_registration_message":"","event_registration_deadline":null,"eve_registration_url":"","event_form":"","event_registration_ack":""},"event_speaker":[{"event_speaker_name":"Yunduan Lin","event_speaker_designation":"","event_speaker_affiliation":"University of California Berkeley","event_speaker_picture":false,"event_speaker_url":"","event_speaker_introduction":"<p>Yunduan Lin is a fifth-year Ph.D. candidate from the Systems Engineering program in the Department of Civil and Environmental Engineering, UC Berkeley, advised by Zuo-Jun Max Shen. Her research focuses on navigating the operations\u00a0of complex societal systems by\u00a0leveraging the vast wealth of data and information available. Her recent work addresses real-world challenges on social networks, online marketplaces and healthcare systems. She is the winner of INFORMS Social Media Analytics Best Student Paper Award,\u00a0first-place prize of the POMS-HK Best Student Paper Award and a finalist of the INFORMS Data Mining and Decision Analytics Workshop Best Paper award in theoretical track.<\/p>\n"}],"event_agenda":false,"event_photo_gallery":false,"event_presentations":false,"event_custom_heading":[{"event_custom_title":"Abstract","event_custom_details":"<p>Nonprogressive diffusion describes the spread of behavior on a social network, where agents are allowed to reverse their decisions as time evolves. It has a wide variety of applications in service adoption, opinion formation, epidemiology, etc. To offer an efficient framework for evaluating and optimizing nonprogressive diffusion, we introduce a comprehensive model and a Fixed-Point Approximation (FPA) scheme. This approximation scheme admits both a theoretical guarantee and computational efficiency. We establish that the approximation error is inherently related to the network structure, and derive order-optimal bounds for the error using two novel metrics of network characteristics. We show that the FPA scheme is most powerful for dense and large networks that are generally prohibitive to analyze by simulation. Taking the widely studied influence maximization and pricing problems on a social network as examples, we further illustrate the broad applications of our FPA scheme. Finally, we conduct comprehensive numerical studies with synthetic and real-world networks. In real networks, the FPA scheme shows 70-230 times more speed up in computation time than simulation while achieving a mean absolute percentage error of less than 3.48%. Moreover, our proposed two network metrics are reliable indicators of the FPA scheme&#8217;s performance.<\/p>\n"}],"event_enquiry_details":{"event_enq_full_name":"","event_enq_department":"","event_enq_email":"","event_enq_telephone":"","event_enq_website":""}}]