课题基金 / 基金详情

III: Small: Influence and Virus Propagation in Large Graphs - Theory and Algorithms

III: Small: Influence and Virus Propagation in Large Graphs - Theory and Algorithms
III:小:大图中的影响和病毒传播 - 理论和算法
批准号:
1017415
负责人:
Christos Faloutsos
金额:
$49.97万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2010
资助国家:
美国
项目状态:
已结题
起止时间:
2010-09-01 至 2013-08-31

项目摘要

项目成果

Christos Faloutsos的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Given a graph, such as a social/computer network, or the blogo-sphere, how will a virus (or rumor or new product) propagate init? Will it take over, creating a pandemic? How to select the'k' best nodes/edges for immunization, or, conversely, the best'k' blogs for the fastest dissemination of a new idea? The an-swer to such questions is vital, for public health, for networksecurity, for market penetration, for blog monitoring and manymore applications.In the PI's past work, they studied arbitrary graphs, and showedthat propagation depends on a single number, namely, the firsteigenvalue of the adjacency matrix of the network. Specifically,they studied the so-called 'epidemic threshold' for flu-likepropagation (``SIS'' model = susceptible-infectious-susceptible),on un-directed, un-weighted static graphs. All earlier work fo-cused on full cliques, or homogeneous graphs, or specific casesof power-law graphs - *all* of which are special cases of thePI's eigenvalue result.The major thrusts of the current proposal are two. The first is*theory*: For a mumps-like model (``SIR'' = susceptible - infect-ed - recovered), and for additional models, when will a virus re-sult in a pandemic? What can we say about weighted graphs? Abouttime-evolving graphs, like an ad-hoc network of mobile phoneusers? The second thrust is on *algorithms*: Given a graph, avirus model (SIS, SIR, etc), and a fixed budget of 'k'nodes/edges to immunize, how can we quickly find an optimal ornear-optimal solution, to best contain the virus? How can wemodify the algorithm, when the network changes over time?The TECHNICAL MERIT of the work is that it is the first to focuson *arbitrary* graphs, thus including real ones. In contrast,the vast majority of past analytical work makes unrealistic as-sumptions about the graph topology (cliques, homogeneous graphsetc.).The BROADER IMPACT is high, as dynamics of large-scale graphs ap-pear in numerous settings: cascades on blogs; product penetrationand viral marketing; rumor/information propagation; immunizationpolicies; advertisement policies etc.For further information see the project web page: URL:http://www.cs.cmu.edu/~christos/NSF-PROJECTS/Immunization/
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
III: Medium: Collaborative Research: Collective Opinion Fraud Detection: Identifying and Integrating Cues from Language, Behavior, and Networks
  • 批准号:
    1408924
  • 项目类别:
    Standard Grant
  • 资助金额:
    $29.99万
  • 财政年份:
    2014
  • 负责人:
    Christos Faloutsos
  • 依托单位:
TWC: Medium: Collaborative: Know Thy Enemy: Data Mining Meets Networks for Understanding Web-Based Malware Dissemination
  • 批准号:
    1314632
  • 项目类别:
    Standard Grant
  • 资助金额:
    $33.33万
  • 财政年份:
    2013
  • 负责人:
    Christos Faloutsos
  • 依托单位:
CGV: Small: Making Sense out of Large Graphs - Bridging HCI with Data Mining
  • 批准号:
    1217559
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $49.98万
  • 财政年份:
    2012
  • 负责人:
    Christos Faloutsos
  • 依托单位:
BIGDATA: Mid-Scale: DA: Collaborative Research: Big Tensor Mining: Theory, Scalable Algorithms and Applications
  • 批准号:
    1247489
  • 项目类别:
    Standard Grant
  • 资助金额:
    $89.49万
  • 财政年份:
    2012
  • 负责人:
    Christos Faloutsos
  • 依托单位:
国内基金
海外基金
昼夜节律性small RNA在血斑形成时间推断中的法医学应用研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2024
  • 负责人:
  • 依托单位:
tRNA-derived small RNA上调YBX1/CCL5通路参与硼替佐米诱导慢性疼痛的机制研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    10.0万元
  • 批准年份:
    2022
  • 负责人:
    张祥忠
  • 依托单位:
Small RNA调控I-F型CRISPR-Cas适应性免疫性的应答及分子机制
Small RNAs调控解淀粉芽胞杆菌FZB42生防功能的机制研究
  • 批准号:
    31972324
  • 项目类别:
    面上项目
  • 资助金额:
    58.0万元
  • 批准年份:
    2019
  • 负责人:
    高学文
  • 依托单位: