Nodal domain count for the generalized graph \(p\)-Laplacian

DOI10.1016/j.acha.2022.12.003OpenAlexW4311778527MaRDI QIDQ2689133

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

nodal domainsWeyl's inequalitiesgraph \(p\)-Laplacianvariational eigenpairs

Mathematics Subject Classification ID

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

Related Items (1)

Nodal domain theorems for \(p\)-Laplacians on signed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
• Nodal domains of eigenvectors for 1-Laplacian on graphs
• Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms
• A lower bound for nodal count on discrete and metric graphs
• Handbook of applied analysis
• Eigenvalues and expanders
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Some geometric aspects of graphs and their eigenfunctions
• On the generalization of the Courant nodal domain theorem
• A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
• Note on a nonlinear eigenvalue problem
• A discrete nodal domain theorem for trees
• Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
• Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
• Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
• Nodal domain and eigenvalue multiplicity of graphs
• Bounds for the largest \(p\)-Laplacian eigenvalue for graphs
• An Algebraic Analysis of the Graph Modularity
• Spectral Sparsification of Graphs
• Can One Count the Shape of a Drum?
• On the Equation div( | ∇u | p-2 ∇u) + λ | u | p-2 u = 0
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• On the $p$-Laplacian and $\infty$-Laplacian on Graphs with Applications in Image and Data Processing
• Nodal domains on graphs - How to count them and why?
• Eigenvectors of acyclic matrices
• The game theoreticp-Laplacian and semi-supervised learning with few labels
• Analysis of $p$-Laplacian Regularization in Semisupervised Learning
• Variational Methods
• Resolving isospectral ‘drums’ by counting nodal domains
• Nodal domain counts and the chromatic number of graphs
• Discrete nodal domain theorems

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