[BOOK][B] Variational and diffusion problems in random walk spaces
The digital world has brought with it many different kinds of data of increasing size and
complexity. Indeed, modern devices allow us to easily obtain images of higher resolution, as …
complexity. Indeed, modern devices allow us to easily obtain images of higher resolution, as …
[HTML][HTML] Dirichlet p-Laplacian eigenvalues and Cheeger constants on symmetric graphs
B Hua, L Wang - Advances in Mathematics, 2020 - Elsevier
In this paper, we study eigenvalues and eigenfunctions of p-Laplacians with Dirichlet
boundary condition on graphs. We characterize the first eigenfunction (and the maximum …
boundary condition on graphs. We characterize the first eigenfunction (and the maximum …
The total variation flow in metric random walk spaces
In this paper we study the total variation flow (TVF) in metric random walk spaces, which
unifies into a broad framework the TVF on locally finite weighted connected graphs, the TVF …
unifies into a broad framework the TVF on locally finite weighted connected graphs, the TVF …
Principled and efficient motif finding for structure learning of lifted graphical models
Abstract Structure learning is a core problem in AI central to the fields of neuro-symbolic AI
and statistical relational learning. It consists in automatically learning a logical theory from …
and statistical relational learning. It consists in automatically learning a logical theory from …
The Cheeger cut and Cheeger problem in metric graphs
JM Mazón - Analysis and Mathematical Physics, 2022 - Springer
For discrete weighted graphs there is sufficient literature about the Cheeger cut and the
Cheeger problem, but for metric graphs there are few results about these problems. Our aim …
Cheeger problem, but for metric graphs there are few results about these problems. Our aim …
An entropy-regularized ADMM for binary quadratic programming
We propose an entropy regularized splitting model using low-rank factorization for solving
binary quadratic programming with linear inequality constraints. Different from the …
binary quadratic programming with linear inequality constraints. Different from the …
Invariants for incidence matrix of a tree
Y Dai, S Chen - Journal of Algebraic Combinatorics, 2024 - Springer
For an oriented tree, we compute several graph invariants, including the minimal norm of the
generalized inverse and the norm of the Moore–Penrose inverse of its incidence matrix. We …
generalized inverse and the norm of the Moore–Penrose inverse of its incidence matrix. We …
Nonsmooth critical point theory and applications to the spectral graph theory
Existing critical point theories including metric and topological critical point theories are
difficult to be applied directly to some concrete problems in particular polyhedral settings …
difficult to be applied directly to some concrete problems in particular polyhedral settings …
Gradient flows in metric random walk spaces
Recently, motivated by problems in image processing, by the analysis of the peridynamic
formulation of the continuous mechanic and by the study of Markov jump processes, there …
formulation of the continuous mechanic and by the study of Markov jump processes, there …
Delta invariant for Eulerian digraphs
S Chen, Y Dai - Theoretical Computer Science, 2022 - Elsevier
Delta invariant for Eulerian digraphs - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …