Collaborative Research: AF: Small: Graph Analysis: Integrating Metric and Topological Perspectives

合作研究:AF:小:图分析:整合度量和拓扑视角

基本信息

  • 批准号:
    2310412
  • 负责人:
  • 金额:
    $ 30万
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Standard Grant
  • 财政年份:
    2023
  • 资助国家:
    美国
  • 起止时间:
    2023-06-01 至 2026-05-31
  • 项目状态:
    未结题

项目摘要

Graphs are one of the most common types of data across various application fields in science and engineering. Graph analysis has been central for multiple communities, including the classical graph theory community, network analysis, graph optimization, as well as the modern day graph learning communities. Traditionally, graphs are regarded as purely combinatorial objects. However, as applications of graphs proliferate, they tend to be regarded as much richer structures. For example, a graph might be viewed as a noisy skeleton of a hidden geometric domain, and there could be rich, complex data associated with its nodes or edges. While this viewpoint is not new, existing algorithmic treatments of graphs have not yet fully leveraged this perspective. In this project, the investigators aim to further integrate various (geo)metric and topological perspectives into graph analysis in order to enrich graph analysis algorithms and broaden the range of methodologies one can use to tackle diverse graph related tasks. This project will integrate ideas and notions from metric geometry, applied topology, spectral geometry and also algorithms to develop new perspectives and effective methods to analyze complex graphs. It will inject new ideas to graph analysis and learning, while at the same time also advancing the field of geometric and topological data analysis. Given the ubiquity of graphs data, methods resulting from this project can potentially impact various application fields, from scientific domains such as molecular biology, materials science, neuroscience, to engineering domains such as chip design. Results from this project will be integrated into the data science curriculum, strengthening the workforce by training undergraduates and graduates in data science.More specifically, the investigators will consider a range of important problems related to the study of individual as well as of collections of graphs. A central theme of this project is to view graphs as objects enriched beyond their combinatorial structures. Two specific research thrusts that the investigators will focus on are: (1) various graph distances, trade-offs between their discriminating power and computational complexity, and potential applications in graph sparsification and in the study of graph neural networks; and (2) modeling, recovering and using (potentially higher order) structures in graphs. To tackle the challenges emerging from these two research thrusts, the investigators will use various metric and topological methods. Examples include viewing graphs as metric spaces and bringing in topological tools (e.g., the interleaving distance from applied topology) to compare them; viewing graphs as metric measure spaces so as to use optimal transport ideas; and bringing together topological persistence through the high dimensional Laplace operator to study spectral structures induced by graphs.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
图是科学和工程各个应用领域最常见的数据类型之一。图分析一直是多个社区的核心,包括经典图论社区、网络分析、图优化以及现代图学习社区。传统上,图被视为纯粹的组合对象。然而,随着图的应用激增,它们往往被认为是更丰富的结构。例如,图可能被视为隐藏几何域的嘈杂骨架,并且可能存在与其节点或边关联的丰富、复杂的数据。虽然这种观点并不新鲜,但现有的图算法处理尚未充分利用这种观点。在这个项目中,研究人员的目标是进一步将各种(几何)计量和拓扑视角整合到图分析中,以丰富图分析算法并扩大可用于解决各种图相关任务的方法范围。该项目将整合度量几何、应用拓扑、谱几何和算法的思想和概念,以开发新的视角和有效的方法来分析复杂的图形。它将为图分析和学习注入新的思路,同时也推进几何和拓扑数据分析领域的发展。鉴于图形数据无处不在,该项目产生的方法可能会影响各个应用领域,从分子生物学、材料科学、神经科学等科学领域到芯片设计等工程领域。该项目的结果将被纳入数据科学课程,通过培训数据科学的本科生和研究生来加强劳动力队伍。更具体地说,研究人员将考虑与个人以及图表集合的研究相关的一系列重要问题。该项目的中心主题是将图视为超出其组合结构的丰富对象。研究人员将重点关注的两个具体研究重点是:(1)各种图距离,其判别能力和计算复杂性之间的权衡,以及图稀疏化和图神经网络研究中的潜在应用; (2) 建模、恢复和使用图中的(可能更高阶的)结构。为了应对这两个研究方向出现的挑战,研究人员将使用各种度量和拓扑方法。示例包括将图视为度量空间并引入拓扑工具(例如,与应用拓扑的交错距离)来比较它们;将图表视为度量测量空间,以便使用最佳传输思想;并通过高维拉普拉斯算子将拓扑持久性结合起来,研究由图引起的谱结构。该奖项反映了 NSF 的法定使命,并通过使用基金会的智力价值和更广泛的影响审查标准进行评估,被认为值得支持。

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Facundo Memoli其他文献

The Wasserstein Transform
Wasserstein 变换
The Wasserstein Transform
Wasserstein 变换
Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications
基于 Zigzag 持久性计算 2 参数持久性模块的广义秩不变量及其应用

Facundo Memoli的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Facundo Memoli', 18)}}的其他基金

Collaborative Research: Multiparameter Topological Data Analysis
合作研究:多参数拓扑数据分析
  • 批准号:
    2301359
  • 财政年份:
    2023
  • 资助金额:
    $ 30万
  • 项目类别:
    Continuing Grant
RI: Medium:Collaborative Research: Through synapses to spatial learning: a topological approach
RI:媒介:协作研究:通过突触进行空间学习:拓扑方法
  • 批准号:
    1901360
  • 财政年份:
    2019
  • 资助金额:
    $ 30万
  • 项目类别:
    Continuing Grant
TRIPODS: Topology, Geometry, and Data Analysis (TGDA@OSU):Discovering Structure, Shape, and Dynamics in Data
TRIPODS:拓扑、几何和数据分析 (TGDA@OSU):发现数据中的结构、形状和动力学
  • 批准号:
    1740761
  • 财政年份:
    2017
  • 资助金额:
    $ 30万
  • 项目类别:
    Continuing Grant
Collaborative Research: The Topology of Functional Data on Random Metric Spaces, Graphs, and Graphons
协作研究:随机度量空间、图和图子上函数数据的拓扑
  • 批准号:
    1723003
  • 财政年份:
    2017
  • 资助金额:
    $ 30万
  • 项目类别:
    Continuing Grant
RI: Small: Collaborative Research: Robustness of spatial learning in flickering networks: the case of the hippocampus
RI:小:协作研究:闪烁网络中空间学习的鲁棒性:海马体的案例
  • 批准号:
    1422400
  • 财政年份:
    2014
  • 资助金额:
    $ 30万
  • 项目类别:
    Standard Grant

相似国自然基金

剪接因子U2AF1突变在急性髓系白血病原发耐药中的机制研究
  • 批准号:
    82370157
  • 批准年份:
    2023
  • 资助金额:
    49 万元
  • 项目类别:
    面上项目
间充质干细胞微粒通过U2AF1负调控pDC活化改善系统性红斑狼疮的机制研究
  • 批准号:
    82302029
  • 批准年份:
    2023
  • 资助金额:
    30 万元
  • 项目类别:
    青年科学基金项目
AF9通过ARRB2-MRGPRB2介导肠固有肥大细胞活化促进重症急性胰腺炎发生MOF的研究
  • 批准号:
    82300739
  • 批准年份:
    2023
  • 资助金额:
    30 万元
  • 项目类别:
    青年科学基金项目
tsRNA-14765结合U2AF2抑制巨噬细胞自噬调节铁死亡对动脉粥样硬化的影响及机制研究
  • 批准号:
  • 批准年份:
    2022
  • 资助金额:
    52 万元
  • 项目类别:
    面上项目
circPOLB-MYC-U2AF2正反馈环路上调FSCN1促进舌鳞状细胞癌进展的作用研究
  • 批准号:
  • 批准年份:
    2022
  • 资助金额:
    30 万元
  • 项目类别:
    青年科学基金项目

相似海外基金

Collaborative Research: AF: Small: New Directions in Algorithmic Replicability
合作研究:AF:小:算法可复制性的新方向
  • 批准号:
    2342245
  • 财政年份:
    2024
  • 资助金额:
    $ 30万
  • 项目类别:
    Standard Grant
Collaborative Research: AF: Small: Structural Graph Algorithms via General Frameworks
合作研究:AF:小型:通过通用框架的结构图算法
  • 批准号:
    2347321
  • 财政年份:
    2024
  • 资助金额:
    $ 30万
  • 项目类别:
    Standard Grant
Collaborative Research: AF: Small: Exploring the Frontiers of Adversarial Robustness
合作研究:AF:小型:探索对抗鲁棒性的前沿
  • 批准号:
    2335412
  • 财政年份:
    2024
  • 资助金额:
    $ 30万
  • 项目类别:
    Standard Grant
Collaborative Research: AF: Medium: Fast Combinatorial Algorithms for (Dynamic) Matchings and Shortest Paths
合作研究:AF:中:(动态)匹配和最短路径的快速组合算法
  • 批准号:
    2402284
  • 财政年份:
    2024
  • 资助金额:
    $ 30万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Small: New Connections between Optimization and Property Testing
合作研究:AF:小型:优化和性能测试之间的新联系
  • 批准号:
    2402572
  • 财政年份:
    2024
  • 资助金额:
    $ 30万
  • 项目类别:
    Standard Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了