Page 1

Displaying 1 – 8 of 8

Showing per page

Signatura of magic and Latin integer squares: isentropic clans and indexing

Ian Cameron, Adam Rogers, Peter D. Loly (2013)

Discussiones Mathematicae Probability and Statistics

The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin squares are included, including the order eight Franklin subset which is of direct relevance...

Smallest singular value of sparse random matrices

Alexander E. Litvak, Omar Rivasplata (2012)

Studia Mathematica

We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition of uniform boundedness of the variances from below. This allows us to consider matrices with null entries or, more generally, with entries having small variances. Our results do not assume identical distribution of the entries of a random matrix and help to clarify the role of the variances of the entries....

Some Properties of Mittag-Leffler Functions and Matrix-Variate Analogues: A Statistical Perspective

Mathai, A. (2010)

Fractional Calculus and Applied Analysis

Mathematical Subject Classification 2010:26A33, 33E99, 15A52, 62E15.Mittag-Leffler functions and their generalizations appear in a large variety of problems in different areas. When we move from total differential equations to fractional equations Mittag-Leffler functions come in naturally. Fractional reaction-diffusion problems in physical sciences and general input-output models in other disciplines are some of the examples in this direction. Some basic properties of Mittag-Leffler functions are...

Sparse recovery with pre-Gaussian random matrices

Simon Foucart, Ming-Jun Lai (2010)

Studia Mathematica

For an m × N underdetermined system of linear equations with independent pre-Gaussian random coefficients satisfying simple moment conditions, it is proved that the s-sparse solutions of the system can be found by ℓ₁-minimization under the optimal condition m ≥ csln(eN/s). The main ingredient of the proof is a variation of a classical Restricted Isometry Property, where the inner norm becomes the ℓ₁-norm and the outer norm depends on probability distributions.

Currently displaying 1 – 8 of 8

Page 1