Critical exponents of graphs

  title={Critical exponents of graphs},
  author={Dominique Guillot and Apoorva Khare and Bala Rajaratnam},
  journal={J. Comb. Theory, Ser. A},

Tables from this paper

The blowup-polynomial of a metric space: connections to stable polynomials, graphs and their distance spectra
To every finite metric space X, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial pX({nx : x ∈ X}). This is
The critical exponent: a novel graph invariant
This work considers the refined problem of characterizing the set of entrywise powers preserving positivity for matrices with a zero pattern encoded by G, and studies how the geometry of $G$ influences the set $\mathcal{H}_G$.
Positivity preservers forbidden to operate on diagonal blocks
The question of which functions acting entrywise preserve positive semidefiniteness has a long history, beginning with the Schur product theorem [Crelle 1911], which implies that absolutely monotonic
Critical exponents for total positivity, individual kernel encoders, and the Jain-Karlin-Schoenberg kernel.
We prove the converse to a result of Karlin [Trans. AMS 1964], and also strengthen his result and two results of Schoenberg [Ann. of Math. 1955]. One of the latter results concerns zeros of Laplace
Blowup polynomials and delta-matroids of graphs
For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix
Positivity of Hadamard powers of tridiagonal matrices
Let Mn(R) denotes the set of all n× n matrices over R. A matrix A ∈ Mn(R) is called nonnegative if all its entries are nonnegative. In this paper, every matrix belongs to Mn(R), and is nonnegative
Positivity of Hadamard powers of a few band matrices
Let $\mathbb{P}_G([0,\infty))$ and $\mathbb{P}_G^{'}([0,\infty))$ be the sets of positive semidefinite and positive definite matrices of order $n$, respectively, with nonnegative entries, where some
Post-composition transforms of totally positive kernels
Author(s): Belton, Alexander; Guillot, Dominique; Khare, Apoorva; Putinar, Mihai | Abstract: The composition operators preserving total non-negativity and total positivity for various classes of
A Panorama of Positivity. I: Dimension Free
This survey contains a selection of topics unified by the concept of positive semidefiniteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks)
Totally positive kernels, Polya frequency functions, and their transforms
The composition operators preserving total non-negativity and total positivity for various classes of kernels are classified, following three themes. Letting a function act by post composition on


Preserving positivity for matrices with sparsity constraints
Functions preserving Loewner positivity when applied entrywise to positive semidefinite matrices have been widely studied in the literature. Following the work of Schoenberg [Duke Math. J. 9], Rudin
Preserving positivity for rank-constrained matrices
Entrywise functions preserving the cone of positive semidefinite matrices have been studied by many authors, most notably by Schoenberg [Duke Math. J. 9, 1942] and Rudin [Duke Math. J. 26, 1959].
Functions preserving positive definiteness for sparse matrices
We consider the problem of characterizing entrywise functions that preserve the cone of positive definite matrices when applied to every off-diagonal element. Our results extend theorems of
Schur Products and Matrix Completions
On a Parametrization of Positive Semidefinite Matrices with Zeros
This work gives a semialgebraic description of the images of the parametrizations for chordless cycles and is motivated by the fact that the considered maps correspond to Gaussian statistical models with hidden variables.
Functions operating on positive definite matrices and a theorem of Schoenberg
We prove that the set of all functions/: [-1, l]-»[-l, 1] operating on real positive definite matrices and normalized such that/(l) = 1, is a Bauer simplex, and we identify its extreme points. As an
The theory of infinitely divisible matrices and kernels
when he showed recently that the Green's function for Laplace's equation is, under certain conditions, an infinitely divisible kernel. In this paper we shall develop a general theory of infinitely
Extreme points in convex sets of symmetric matrices
This paper deals with the following problem: What are the extreme points of a convex set K of n X n matrices, which is the intersection of the set S" of symmetric matrices of nonnegative type, with