Some patterned matrices with independent entries

2020 ◽  
pp. 2150030
Author(s):  
Arup Bose ◽  
Koushik Saha ◽  
Priyanka Sen
Keyword(s):  
Random Matrices ◽  
Spectral Distribution ◽  
Finite Variance ◽  
Weighted Sum ◽  
Hankel Matrices ◽  
Special Cases ◽  
Common Thread ◽  
Different Types ◽  
Patterned Matrices ◽  
Variance Profile

Patterned random matrices such as the reverse circulant, the symmetric circulant, the Toeplitz and the Hankel matrices and their almost sure limiting spectral distribution (LSD), have attracted much attention. Under the assumption that the entries are taken from an i.i.d. sequence with finite variance, the LSD are tied together by a common thread — the [Formula: see text]th moment of the limit equals a weighted sum over different types of pair-partitions of the set [Formula: see text] and are universal. Some results are also known for the sparse case. In this paper, we generalize these results by relaxing significantly the i.i.d. assumption. For our models, the limits are defined via a larger class of partitions and are also not universal. Several existing and new results for patterned matrices, their band and sparse versions, as well as for matrices with continuous and discrete variance profile follow as special cases.

Patterned sparse random matrices: A moment approach

2017 ◽  
Vol 06 (03) ◽  
pp. 1750011
Author(s):  
Debapratim Banerjee ◽  
Arup Bose
Keyword(s):  
Random Matrices ◽  
Limit Distribution ◽  
Spectral Distribution ◽  
Explicit Description ◽  
Circulant Matrices ◽  
Hankel Matrices ◽  
Largest Eigenvalue ◽  
Empirical Spectral Distribution ◽  
Moment Approach ◽  
The Largest Eigenvalue

We consider four specific [Formula: see text] sparse patterned random matrices, namely the Symmetric Circulant, Reverse Circulant, Toeplitz and the Hankel matrices. The entries are assumed to be Bernoulli with success probability [Formula: see text] such that [Formula: see text] with [Formula: see text]. We use the moment approach to show that the expected empirical spectral distribution (EESD) converges weakly for all these sparse matrices. Unlike the Sparse Wigner matrices, here the random empirical spectral distribution (ESD) converges weakly to a random distribution. This weak convergence is only in the distribution sense. We give explicit description of the random limits of the ESD for Reverse Circulant and Circulant matrices. As in the non-sparse case, explicit description of the limits appears to be difficult to obtain in the Toeplitz and Hankel cases. We provide some properties of these limits. We then study the behavior of the largest eigenvalue of these matrices. We prove that for the Reverse Circulant and Symmetric Circulant matrices the limit distribution of the largest eigenvalue is a multiple of the Poisson. For Toeplitz and Hankel matrices we show that the non-degenerate limit distribution exists, but again it does not seem to be easy to obtain any explicit description.

Bulk behavior of Schur–Hadamard products of symmetric random matrices

2014 ◽  
Vol 03 (02) ◽  
pp. 1450007 ◽  
Author(s):  
Arup Bose ◽  
Soumendu Sundar Mukherjee
Keyword(s):  
Random Matrices ◽  
Hadamard Product ◽  
Hankel Matrices ◽  
Hadamard Products ◽  
Spectral Distributions ◽  
Patterned Matrices ◽  
Invariance Theorem ◽  
Bulk Behavior ◽  
General Method

We develop a general method for establishing the existence of the Limiting Spectral Distributions (LSD) of Schur–Hadamard products of independent symmetric patterned random matrices. We apply this method to show that the LSD of Schur–Hadamard products of some common patterned matrices exist and identify the limits. In particular, the Schur–Hadamard product of independent Toeplitz and Hankel matrices has the semi-circular LSD. We also prove an invariance theorem that may be used to find the LSD in many examples.

scholarly journals Spectral properties for the Laplacian of a generalized Wigner matrix

2021 ◽  
Author(s):  
Anirban Chatterjee ◽  
Rajat Subhra Hazra
Keyword(s):  
Random Graphs ◽  
Spectral Distribution ◽  
Spectral Properties ◽  
Laplacian Matrix ◽  
Maximum Eigenvalue ◽  
Wigner Matrix ◽  
Graph Homomorphisms ◽  
Special Cases ◽  
The Matrix ◽  
Variance Profile

In this paper, we consider the spectrum of a Laplacian matrix, also known as Markov matrices where the entries of the matrix are independent but have a variance profile. Motivated by recent works on generalized Wigner matrices we assume that the variance profile gives rise to a sequence of graphons. Under the assumption that these graphons converge, we show that the limiting spectral distribution converges. We give an expression for the moments of the limiting measure in terms of graph homomorphisms. In some special cases, we identify the limit explicitly. We also study the spectral norm and derive the order of the maximum eigenvalue. We show that our results cover Laplacians of various random graphs including inhomogeneous Erdős–Rényi random graphs, sparse W-random graphs, stochastic block matrices and constrained random graphs.

Circles on the Complex Plane

2021 ◽  
pp. 3-12
Author(s):  
A. Girsh
Keyword(s):  
Euclidean Space ◽  
Complex Plane ◽  
Euclidean Plane ◽  
Complex Space ◽  
Radical Center ◽  
Special Cases ◽  
Different Types ◽  
Different Dimensions ◽  
The Given ◽  
Made In

The Euclidean plane and Euclidean space themselves do not contain imaginary elements by definition, but are inextricably linked with them through special cases, and this leads to the need to propagate geometry into the area of imaginary values. Such propagation, that is adding a plane or space, a field of imaginary coordinates to the field of real coordinates leads to various variants of spaces of different dimensions, depending on the given axiomatics. Earlier, in a number of papers, were shown examples for solving some urgent problems of geometry using imaginary geometric images [2, 9, 11, 13, 15]. In this paper are considered constructions of orthogonal and diametrical positions of circles on a complex plane. A generalization has been made of the proposition about a circle on the complex plane orthogonally intersecting three given spheres on the proposition about a sphere in the complex space orthogonally intersecting four given spheres. Studies have shown that the diametrical position of circles on the Euclidean E-plane is an attribute of the orthogonal position of the circles’ imaginary components on the pseudo-Euclidean M-plane. Real, imaginary and degenerated to a point circles have been involved in structures and considered, have been demonstrated these circles’ forms, properties and attributes of their orthogonal position. Has been presented the construction of radical axes and a radical center for circles of the same and different types. A propagation of 2D mutual orthogonal position of circles on 3D spheres has been made. In figures, dashed lines indicate imaginary elements.

A Novel Approach for Analyzing Single Buffer Queueing Systems with State-Dependent Vacation and Correlated Input Process under Four Different Service Disciplines

2015 ◽  
Vol 6 (3) ◽  
pp. 19-59 ◽  
Author(s):  
Thomas Yew Sing Lee
Keyword(s):  
Performance Measures ◽  
Probability Generating Function ◽  
Performance Measure ◽  
Idle Time ◽  
Separate Analysis ◽  
Input Process ◽  
State Dependent ◽  
Special Cases ◽  
Service Disciplines ◽  
Different Types

The author presents performance analysis of a single buffer multiple-queue system. Four different types of service disciplines (i.e., non-preemptive, pre-emptive repeat different, state dependent random polling and globally gated) are analyzed. His model includes correlated input process and three different types of non-productive time (i.e., switchover, vacation and idle time). Special cases of the model includes server with mixed multiple and single vacations, stopping server with delayed vacation and stopping server with alternating vacation and idle time. For each of the four service disciplines the key performance measures such as average customer waiting time, loss probability, and throughput are computed. The results permit a detailed discussion of how these performance measures depends on the customer arrival rate, the customer service time, the switchover time, the vacation time, and the idle time. Moreover, extensive numerical results are presented and the four service disciplines are compared with respect to the performance measure. Previous studies of the single buffer multiple-queue systems tend to provide separate analysis for the two cases of zero and nonzero switchover time. The author is able to provide a unified analysis for the two cases. His results generalize and improve a number of known results on single buffer multiple-queue systems. Furthermore, this method does not require differentiation while it is needed if one uses the probability generating function approach. Lastly, the author's approach works for all single buffer multiple-queue systems in which the next queue to be served is determines solely on the basis of the occupancy states at the end of the cycle time.

scholarly journals Theoretical framework for higher-order quantum theory

2019 ◽  
Vol 475 (2225) ◽  
pp. 20180706 ◽  
Author(s):  
Alessandro Bisio ◽  
Paolo Perinotti
Keyword(s):  
Quantum Theory ◽  
Convex Sets ◽  
Mathematical Structure ◽  
Higher Order ◽  
Equivalence Relations ◽  
Full Generality ◽  
Special Cases ◽  
Different Types ◽  
Causal Structures

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.

Sign in / Sign up

Export Citation Format

Share Document