Related papers: Rational Krylov methods for fractional diffusion p…

In this paper, we develop a numerical multiscale method to solve the fractional Laplacian with a heterogeneous diffusion coefficient. When the coefficient is heterogeneous, this adds to the computational costs. Moreover, the fractional…

This paper establishes explicit solutions for fractional diffusion problems on bounded domains. It also gives stochastic solutions, in terms of Markov processes time-changed by an inverse stable subordinator whose index equals the order of…

In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient…

In this paper, we present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and…

We tackle the network topology inference problem by utilizing Laplacian constrained Gaussian graphical models, which recast the task as estimating a precision matrix in the form of a graph Laplacian. Recent research \cite{ying2020nonconvex}…

We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…

This paper considers the numerical analysis of a semilinear fractional diffusion equation with nonsmooth initial data. A new Gr\"onwall's inequality and its discrete version are proposed. By the two inequalities, error estimates in three…

This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…

Cylindrical lattice Diffusion Limited Aggregation (DLA), with a narrow width N, is solved using a Markovian matrix method. This matrix contains the probabilities that the front moves from one configuration to another at each growth step,…

Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We…

Graph-based analysis holds both theoretical and applied significance, attracting considerable attention from researchers and yielding abundant results in recent years. However, research on fractional problems remains limited, with most of…

We propose a novel robust decentralized graph clustering algorithm that is provably equivalent to the popular spectral clustering approach. Our proposed method uses the existing wave equation clustering algorithm that is based on…

The heat equation is often used in order to inpaint dropped data in inpainting-based lossy compression schemes. We propose an alternative way to numerically solve the heat equation by an extended Krylov subspace method. The method is very…

A finite difference method is constructed to solve singularly perturbed convection-diffusion problems posed on smooth domains. Constraints are imposed on the data so that only regular exponential boundary layers appear in the solution. A…

We consider a group of computation units trying to cooperatively solve a distributed optimization problem with shared linear equality and inequality constraints. Assuming that the computation units are communicating over a network whose…

This work is on a user-friendly reduced basis method for solving a family of parametric PDEs by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and bi-conjugate gradient…

The Laplacian-constrained Gaussian Markov Random Field (LGMRF) is a common multivariate statistical model for learning a weighted sparse dependency graph from given data. This graph learning problem can be formulated as a maximum likelihood…

Some properties of a Local discontinuous Galerkin (LDG) algorithm are demonstrated for the problem of evaluting a second derivative $g = f_{xx}$ for a given $f$. (This is a somewhat unusual problem, but it is useful for understanding the…

We present a general framework for the rigorous numerical analysis of time-fractional nonlinear parabolic partial differential equations, with a fractional derivative of order $\alpha\in(0,1)$ in time. The framework relies on three…

We propose a discontinuous Galerkin method for convection-subdiffusion equations with a fractional operator of order $\alpha (1<\alpha<2)$ defined through the fractional Laplacian. The fractional operator of order $\alpha$ is expressed as a…