Nodal domain count for the generalized graph p-Laplacian

DOI10.1016/J.ACHA.2022.12.003MaRDI QIDQ2689133zbMATH OpenOpenAlexFDO

Authors P. Deidda, Mario Putti, Francesco Tudisco

Publication date 9 March 2023

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2201.01248

zbMATH Keywords

graph \(p\)-Laplaciannodal domainsvariational eigenpairsWeyl's inequalities

Mathematics Subject Classification ID

Quasilinear elliptic equations with (p)-Laplacian (35J92) Operator theory (47-XX)

Recommendations

• A lower bound for nodal count on discrete and metric graphs
• A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
• Nodal domain and eigenvalue multiplicity of graphs
• Nodal decompositions of graphs
• On the generalization of the Courant nodal domain theorem

Cites work

• A discrete nodal domain theorem for trees
• A lower bound for nodal count on discrete and metric graphs
• A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
• An algebraic analysis of the graph modularity
• Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
• Analysis of p-Laplacian regularization in semisupervised learning
• Bounds for the largest \(p\)-Laplacian eigenvalue for graphs
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Can one count the shape of a drum?
• Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
• Discrete nodal domain theorems
• Eigenvalues and expanders
• Eigenvectors of acyclic matrices
• Handbook of applied analysis
• scientific article; zbMATH DE number 2191998 (Why is no real title available?)
• scientific article; zbMATH DE number 3081828 (Why is no real title available?)
• Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
• Multiplicity techniques for problems without compactness
• Nodal domain and eigenvalue multiplicity of graphs
• Nodal domain counts and the chromatic number of graphs
• Nodal domain theorems and bipartite subgraphs
• Nodal domains of eigenvectors for 1-Laplacian on graphs
• Nodal domains on graphs - How to count them and why?
• Note on a nonlinear eigenvalue problem
• On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
• On the p-Laplacian and -Laplacian on graphs with applications in image and data processing
• On the Equation div( | ∇u | p-2 ∇u) + λ | u | p-2 u = 0
• On the generalization of the Courant nodal domain theorem
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms
• Resolving isospectral ‘drums’ by counting nodal domains
• Some geometric aspects of graphs and their eigenfunctions
• Spectral sparsification of graphs
• The game theoretic p-Laplacian and semi-supervised learning with few labels
• Variational Methods

Cited in

(7)

• Nodal domain theorems for p-Laplacians on signed graphs
• Nodal domain count for the generalized graph p-Laplacian
• Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent
• The graph -Laplacian eigenvalue problem
• Graph p-Laplacian eigenpairs as saddle points of a family of spectral energy functions
• Variational graph p-Laplacian eigendecomposition under p-orthogonality constraints
• Homological eigenvalues of graph p-Laplacians

This page was built for publication: Nodal domain count for the generalized graph \(p\)-Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689133)