paper-with-me

홈 › Papers

Energy Approach from $\varepsilon$-Graph to Continuum Diffusion Model with Connectivity Functional

2025-10-29 · Yahong Yang, Sun Lee, Jeff Calder, Wenrui Hao arxiv

We derive an energy-based continuum limit for $\varepsilon$-graphs endowed with a general connectivity functional. We prove that the discrete energy and its continuum counterpart differ by at most $O(\varepsilon)$; the prefactor involves only the $W^{1,1}$-norm of the connectivity density as $\varepsilon\to0$, so the error bound remains valid even when that density has strong local fluctuations. As an application, we introduce a neural-network procedure that reconstructs the connectivity density from edge-weight data and then embeds the resulting continuum model into a brain-dynamics framework. In this setting, the usual constant diffusion coefficient is replaced by the spatially varying coefficient produced by the learned density, yielding dynamics that differ significantly from those obtained with conventional constant-diffusion models.

📄 PDF Abstract BibTeX arXiv:2510.25114

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Improved spectral convergence rates for graph Laplacians on epsilon-graphs and k-NN graphs

2019-10-29 · Jeff Calder, Nicolas Garcia Trillos

In this paper we improve the spectral convergence rates for graph-based approximations of Laplace-Beltrami operators constructed from random data. We utilize regularity of the continuum eigenfunctions and strong pointwis…

Convergence rates for Poisson learning to a Poisson equation with measure data

2024-07-09 · Leon Bungert, Jeff Calder, Max Mihailescu, Kodjo Houssou 외

In this paper we prove discrete to continuum convergence rates for Poisson Learning, a graph-based semi-supervised learning algorithm that is based on solving the graph Poisson equation with a source term consisting of a…

Rates of Convergence for Laplacian Semi-Supervised Learning with Low Labeling Rates

2020-06-04 · Jeff Calder, Dejan Slepčev, Matthew Thorpe

We study graph-based Laplacian semi-supervised learning at low labeling rates. Laplacian learning uses harmonic extension on a graph to propagate labels. At very low label rates, Laplacian learning becomes degenerate and…

CNFP: Optimizing Cloud-Native Network Function Placement with Diffusion Models on the Cloud Continuum

2025-11-03 · Álvaro Vázquez Rodríguez, Manuel Fernández-Veiga, Carlos Giraldo-Rodríguez arxiv

The placement of Cloud-Native Network Functions across the Cloud-Continuum represents a core challenge in the orchestration of current 5G and future 6G networks. The process entails the implementation of interdependent c…

Reinforcement LearningGraph Neural Network

A variational approach to the consistency of spectral clustering

2015-08-08 · Nicolás García Trillos, Dejan Slepčev

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by …

Clustering