银凯体育在线入口app

3月23日上午10:00-12:00，应计算机科学与技术银凯体育app官网下载安装邀请，中科院计算所研究员孙晓明博士将在我校明向校区计算机银凯体育app官网下载安装实验楼报告厅作“The Routing of Complex Contagion in Kleinberg’s Small-World Networks”的专题讲座，欢迎广大师生准时参加。

3月23日上午10:00-12:00，应计算机科学与技术银凯体育app官网下载安装邀请，中科院计算所研究员孙晓明博士将在我校明向校区计算机银凯体育app官网下载安装实验楼报告厅作“The Routing of Complex Contagion in Kleinberg’s Small-World Networks”的专题讲座，欢迎广大师生准时参加。

报告时间：2017年3月23日上午10:00

报告地点：计算机银凯体育app官网下载安装实验楼报告厅

报告主题：The Routing of Complex Contagion in Kleinberg’s Small-World Networks

Abstract: In Kleinberg’s small-world network model, strong ties are modeled as deterministic edges in the underlying base grid and weak ties are modeled as random edges connecting remote nodes. In this talk I will propose the concept of routing of complex contagion (or complex routing), where at each time step we can select one eligible node (nodes already having two active neighbors) to activate, with the goal of activating the pre-selected target node in the end. We consider decentralized routing scheme where only the links connected to already activated nodes are known to the selection strategy. Our results indicate that complex routing is exponentially harder than both simple routing and complex diffusion at the sweetspot ofα = 2.

报告人：孙晓明，中科院计算所研究员。2005年毕业于清华大学计算机系，获博士学位。曾任清华大学高等研究院助理研究员、副研究员。主要研究方向理论计算机科学，曾获得首批自然科学基金优秀青年基金资助，入选万人计划首批青年拔尖人才，还曾获中国密码学会优秀青年奖、密码创新奖二等奖。目前担任CCF学术工作委员会委员，理论计算机专委会副主任，作为项目负责人主持国家自然科学基金重点项目一项，曾主持自然科学基金优秀青年基金等。