惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

宝玉的分享
宝玉的分享
H
Hackread – Cybersecurity News, Data Breaches, AI and More
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
小众软件
小众软件
月光博客
月光博客
D
DataBreaches.Net
L
LangChain Blog
美团技术团队
S
SegmentFault 最新的问题
MyScale Blog
MyScale Blog
大猫的无限游戏
大猫的无限游戏
博客园 - 司徒正美
aimingoo的专栏
aimingoo的专栏
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
H
Help Net Security
阮一峰的网络日志
阮一峰的网络日志
Y
Y Combinator Blog
I
InfoQ
U
Unit 42
Microsoft Azure Blog
Microsoft Azure Blog
J
Java Code Geeks
博客园 - 三生石上(FineUI控件)
腾讯CDC
Martin Fowler
Martin Fowler

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Homological eigenvalues of graph $p$-Laplacians
Dong Zhang · 2021-10-12 · via math.CO updates on arXiv.org

Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $Δ_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of homological eigenvalues, and we prove that for any homological eigenvalue $λ(Δ_p)$, the function $p\mapsto p(2λ(Δ_p))^{\frac1p}$ is locally increasing, while the function $p\mapsto 2^{-p}λ(Δ_p)$ is locally decreasing. As a special class of homological eigenvalues, the min-max eigenvalues $λ_1(Δ_p)$, $\cdots$, $λ_k(Δ_p)$, $\cdots$, are locally Lipschitz continuous with respect to $p\in[1,+\infty)$. We also establish the monotonicity of $p(2λ_k(Δ_p))^{\frac1p}$ and $2^{-p}λ_k(Δ_p)$ with respect to $p\in[1,+\infty)$. These results systematically establish a refined analysis of $Δ_p$-eigenvalues for varying $p$, which lead to several applications, including: (1) settle an open problem by Amghibech on the monotonicity of some function involving eigenvalues of $p$-Laplacian with respect to $p$; (2) resolve a question asking whether the third eigenvalue of graph $p$-Laplacian is of min-max form; (3) refine the higher order Cheeger inequalities for graph $p$-Laplacians by Tudisco and Hein, and extend the multi-way Cheeger inequality by Lee, Oveis Gharan and Trevisan to the $p$-Laplacian case. Furthermore, for the 1-Laplacian case, we characterize the homological eigenvalues and min-max eigenvalues from the perspective of topological combinatorics, where our idea is similar to the authors' work on discrete Morse theory.