Critical exponents of graphs
From MaRDI portal
Abstract: The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that is positive semidefinite for every entrywise nonnegative positive semidefinite matrix if and only if is a positive integer or . This surprising result naturally extends the Schur product theorem, and demonstrates the existence of a sharp phase transition in preserving positivity. In this paper, we study when entrywise powers preserve positivity for matrices with structure of zeros encoded by graphs. To each graph is associated an invariant called its "critical exponent", beyond which every power preserves positivity. In our main result, we determine the critical exponents of all chordal/decomposable graphs, and relate them to the geometry of the underlying graphs. We then examine the critical exponent of important families of non-chordal graphs such as cycles and bipartite graphs. Surprisingly, large families of dense graphs have small critical exponents that do not depend on the number of vertices of the graphs.
Recommendations
- The critical exponent: a novel graph invariant
- Positivity of Hadamard powers of a few band matrices
- Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity
- The critical exponent conjecture for powers of doubly nonnegative matrices
- The critical exponent for continuous conventional powers of doubly nonnegative matrices
Cites work
- A General Framework for Weighted Gene Co-Expression Network Analysis
- Algorithmic graph theory and perfect graphs
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity
- Covariance regularization by thresholding
- Extensions of band matrices with band inverses
- Fonctions opérant sur les fonctions définies-positives
- Functions Operating on Positive Definite Matrices and a Theorem of Schoenberg
- Functions preserving positive definiteness for sparse matrices
- Functions that preserve families of positive semidefinite matrices
- scientific article; zbMATH DE number 6096647 (Why is no real title available?)
- scientific article; zbMATH DE number 3910422 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Hub Discovery in Partial Correlation Graphs
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Large-Scale Correlation Screening
- Monotonicity for entrywise functions of matrices
- On a parametrization of positive semidefinite matrices with zeros
- On fractional Hadamard powers of positive definite matrices
- On rigid circuit graphs
- Positive definite completion problems for Bayesian networks
- Positive definite completions of partial Hermitian matrices
- Positive definite functions on spheres
- Positive definite matrices and absolutely monotonic functions
- Positive definite sequences and absolutely monotonic functions
- Positive semidefinite matrices with a given sparsity pattern
- Positivity preserving Hadamard matrix functions
- Retaining positive definiteness in thresholded matrices
- Schur products and matrix completions
- Simplicial decompositions of graphs: A survey of applications
- The minimum rank of symmetric matrices described by a graph: a survey
- The Theory of Infinitely Divisible Matrices and Kernels
Cited in
(18)- The critical exponent: a novel graph invariant
- Coalescence and criticality of graphs
- The critical exponent conjecture for powers of doubly nonnegative matrices
- Critical phenomena in exponential random graphs
- The critical exponent for generalized doubly nonnegative matrices
- A panorama of positivity. II: Fixed dimension
- Positivity of Hadamard powers of a few band matrices
- THE NEW UNIVERSAL ESTIMATION FOR EXPONENTS OF GRAPHS
- Nonparametric modeling of higher-order interactions via hypergraphons
- Totally positive kernels, Pólya frequency functions, and their transforms
- Positivity preservers forbidden to operate on diagonal blocks
- Blowup polynomials and delta-matroids of graphs
- The blowup-polynomial of a metric space: connections to stable polynomials, graphs and their distance spectra
- Positivity preservers over finite fields
- The factor width rank of a matrix
- Entrywise transforms preserving matrix positivity and nonpositivity
- Corrigendum to: ``Critical exponents of graphs
- Functional calculi, positivity, and convolution of matrices
This page was built for publication: Critical exponents of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899490)