English
Related papers

Related papers: A fast and stable test to check if a weakly diagon…

200 papers

Biclustering is a method for detecting homogeneous submatrices in a given observed matrix, and it is an effective tool for relational data analysis. Although there are many studies that estimate the underlying bicluster structure of a…

Methodology · Statistics 2021-07-16 Chihiro Watanabe , Taiji Suzuki

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Optimization and Control · Mathematics 2019-03-14 Amir Ali Ahmadi , Georgina Hall

It is known that supercyclicity implies strong stability. It is not known whether weak l-sequential supercyclicity implies weak stability. In this paper we prove that weak l-sequential supercyclicity implies weak quasistability. Corollaries…

Functional Analysis · Mathematics 2024-12-11 C. S. Kubrusly , B. P. Duggal

In this paper, we introduce the class of diagonally dominant (with respect to a given LMI region ${\mathfrak D} \subset {\mathbb C}$) matrices that possesses the analogues of well-known properties of (classical) diagonally dominant…

Spectral Theory · Mathematics 2021-03-09 Olga Y. Kushel , Raffaella Pavani

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Probability · Mathematics 2007-05-23 Kevin Costello , Terence Tao , Van Vu

Given any square matrix, $\mathbf{M}$, whose diagonal elements are negative, and which is multiplied by a variable, $\sigma$, we wish to find the minimal $\sigma$ such that the eigenvalue of $\mathbf{M}_{\sigma}$ is exactly zero. By…

Optimization and Control · Mathematics 2024-08-06 Michael Thorne

The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption is often false for real-world matrices. We consider the…

Data Structures and Algorithms · Computer Science 2025-11-05 Martino Ciaperoni , Aristides Gionis , Heikki Mannila

In this work, we present a new characterization of symmetric $H^+$-tensors. It is known that a symmetric tensor is an $H^+$-tensor if and only if it is a generalized diagonally dominant tensor with nonnegative diagonal elements. By…

Spectral Theory · Mathematics 2025-06-24 Xin Shi , Luis F. Zuluaga

The nonlinear dynamics of a system with periodic structure can be analyzed using a square matrix. We show that because the special property of the square matrix constructed for nonlinear dynamics, we can reduce the dimension of the matrix…

Classical Physics · Physics 2018-09-11 Li Hua Yu

A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). Characterizing…

Data Structures and Algorithms · Computer Science 2018-11-21 Ranveer Singh , Naomi Shaked-Monderer , Avi Berman

A random vector ${\bf X}$ is weakly stable iff for all $a,b\in \mathbb{R}$ there exists a random variable $\Theta$ such that $a{\bf X}+b{\bf X}'\stackrel{d}{=}{\bf X}\Theta$. This is equivalent (see \cite{MOU}) with the condition that for…

Probability · Mathematics 2007-05-23 Jolanta K. Misiewicz

We investigate the properties of uniform doubly stochastic random matrices, that is non-negative matrices conditioned to have their rows and columns sum to 1. The rescaled marginal distributions are shown to converge to exponential…

Probability · Mathematics 2010-11-01 Sourav Chatterjee , Persi Diaconis , Allan Sly

If $(X,d)$ is a metric space then the map $f\colon X\to X$ is defined to be a weak contraction if $d(f(x),f(y))<d(x,y)$ for all $x,y\in X$, $x\neq y$. We determine the simplest non-closed sets $X\subseteq \mathbb{R}^n$ in the sense of…

Classical Analysis and ODEs · Mathematics 2014-10-01 Richárd Balka

Kwapien and Woyczynski asked in their monograph (1992) whether their notion of superstrong domination is inherited when taking sums of independent symmetric random vectors (one vector dominates another if, essentially, tail probabilities of…

Probability · Mathematics 2020-12-08 Witold Bednorz , Tomasz Tkocz

We present an approach for testing for the existence of continuous generators of discrete stochastic transition matrices. Typically, the known approaches to ascertain the existence of continuous Markov processes are based in the assumption…

Data Analysis, Statistics and Probability · Physics 2016-03-23 Pedro Lencastre , Frank Raischel , Tim Rogers , Pedro G. Lind

Precision matrix, which is the inverse of covariance matrix, plays an important role in statistics, as it captures the partial correlation between variables. Testing the equality of two precision matrices in high dimensional setting is a…

Methodology · Statistics 2018-10-23 Mingjuan Zhang , Yong He , Cheng Zhou , Xinsheng Zhang

The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…

Numerical Analysis · Mathematics 2020-09-16 Daniel Boley

This paper introduces two new families of non-parametric tests of goodness-of-fit on the compact classical groups. One of them is a family of tests for the eigenvalue distribution induced by the uniform distribution, which is consistent…

Statistics Theory · Mathematics 2018-02-27 Amir Sepehri

The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of…

Operator Algebras · Mathematics 2012-11-14 Corey O'Meara , Rajesh Pereira

Let $G = (A \cup B, E)$ be an instance of the stable marriage problem with strict preference lists. A matching $M$ is popular in $G$ if $M$ does not lose a head-to-head election against any matching where vertices are voters. Every stable…

Discrete Mathematics · Computer Science 2021-06-10 Agnes Cseh , Yuri Faenza , Telikepalli Kavitha , Vladlena Powers
‹ Prev 1 3 4 5 6 7 10 Next ›