Best approximation of $(\mathcal{G}_{1},\mathcal{G}_{2})$-random operator inequality in matrix Menger Banach algebras with application of stochastic Mittag-Leffler and $\mathbb{H}$-Fox control functions

We stabilize pseudostochastic $(\mathcal{G}_{1},\mathcal{G}_{2})$ ( G 1 , G 2 ) -random operator inequality using a class of stochastic matrix control functions in matrix Menger Banach algebras. We get an approximation for stochastic $(\mathcal{G}_{1},\mathcal{G}_{2})$ ( G 1 , G 2 ) -random operator inequality by means of both direct and fixed point methods. As an application, we apply both stochastic Mittag-Leffler and $\mathbb{H}$ H -fox control functions to get a better approximation in a random operator inequality.

Optimal Poisson Cognitive System with Markov Learning Model

The aim of the study is to develop a mathematical model of the trained Markov cognitive system in the presence of discrete training and interfering random stimuli arising at random times at its input. The research method consists in the application of the simplest Markov learning model of Estes with a stochastic matrix with two states, in which the transition probabilities are calculated in accordance with the optimal Neуman-Pearson algorithm for detecting stimuli affecting the system. The paper proposes a model of the random appearance of images at the input of the cognitive system (in terms of learning theory, these are stimuli to which the system reacts). The model assumes an exponential distribution of the system’s response time to stimuli that is widely used to describe intellectual work, while their number is distributed according to the Poisson law. It is assumed that the cognitive system makes a decision about the presence or absence of a stimulus at its input in accordance with the Neуman-Pearson optimality criterion, i.e. maximizes the probability of correct detection of the stimulus with a fixed probability of false detection. The probabilities calculated in this way are accepted as transition probabilities in the stochastic learning matrix of the system. Thus, the following assumptions are accepted in the work, apparently corresponding to the behavior of the system assuming human reactions, i.e. the cognitive system.The images analyzed by the system arise at random moments of time, while the duration of time between neighboring appearances of images is distributed exponentially.The system analyzes the resulting images and makes a decision about the presence or absence of an image at its input in accordance with the optimal Neуman-Pearson algorithm that maximizes the probability of correct identification of the image with a fixed probability of false identification.The system is trainable in the sense that decisions about the presence or absence of an image are made sequentially on a set of identical situations, and the probability of making a decision depends on the previous decision of the system.The new results of the study are analytical expressions for the probabilities of the system staying in each of the possible states, depending on the number of steps of the learning process and the intensities of useful and interfering stimuli at the input of the system. These probabilities are calculated for an interesting case in which the discreteness of the appearance of stimuli in time is clearly manifested and the corresponding graphs are given. Stationary probabilities are also calculated, i.e. for an infinite number of training steps, the probabilities of the system staying in each of the states and the corresponding graph is presented.In conclusion, it is noted that the presented graphs of the behavior of the trained system correspond to an intuitive idea of the reaction of the cognitive system to the appearance of stimuli. Some possible directions of further research on the topic mentioned in the paper are indicated.

Emergent fractal phase in energy stratified random models

We study the effects of partial correlations in kinetic hopping terms of long-range disordered random matrix models on their localization properties. We consider a set of models interpolating between fully-localized Richardson’s model and the celebrated Rosenzweig-Porter model (with implemented translation-invariant symmetry). In order to do this, we propose the energy-stratified spectral structure of the hopping term allowing one to decrease the range of correlations gradually. We show both analytically and numerically that any deviation from the completely correlated case leads to the emergent non-ergodic delocalization in the system unlike the predictions of localization of cooperative shielding. In order to describe the models with correlated kinetic terms, we develop the generalization of the Dyson Brownian motion and cavity approaches basing on stochastic matrix process with independent rank-one matrix increments and examine its applicability to the above set of models.

G-tridiagonal majorization on M n,m

For X, Y ∈ M n,m , it is said that X is g-tridiagonal majorized by Y (and it is denoted by X ≺ gt Y) if there exists a tridiagonal g-doubly stochastic matrix A such that X = AY. In this paper, the linear preservers and strong linear preservers of ≺ gt are characterized on M n,m .

The Inequalities of Merris and Foregger for Permanents

Conjectures on permanents are well-known unsettled conjectures in linear algebra. Let A be an n×n matrix and Sn be the symmetric group on n element set. The permanent of A is defined as perA=∑σ∈Sn∏i=1naiσ(i). The Merris conjectured that for all n×n doubly stochastic matrices (denoted by Ωn), nperA≥min1≤i≤n∑j=1nperA(j|i), where A(j|i) denotes the matrix obtained from A by deleting the jth row and ith column. Foregger raised a question whether per(tJn+(1−t)A)≤perA for 0≤t≤nn−1 and for all A∈Ωn, where Jn is a doubly stochastic matrix with each entry 1n. The Merris conjecture is one of the well-known conjectures on permanents. This conjecture is still open for n≥4. In this paper, we prove the Merris inequality for some classes of matrices. We use the sub permanent inequalities to prove our results. Foregger’s inequality is also one of the well-known inequalities on permanents, and it is not yet proved for n≥5. Using the concepts of elementary symmetric function and subpermanents, we prove the Foregger’s inequality for n=5 in [0.25, 0.6248]. Let σk(A) be the sum of all subpermanents of order k. Holens and Dokovic proposed a conjecture (Holen–Dokovic conjecture), which states that if A∈Ωn,A≠Jn and k is an integer, 1≤k≤n, then σk(A)≥(n−k+1)2nkσk−1(A). In this paper, we disprove the conjecture for n=k=4.

A probabilistic model for risk assessment and predicting the health risk of occupational exposure to pesticides in agriculture

Introduction. The main point is the influence of a complex of chemical and physical stressors on agricultural machine operators. The processes of occurrence and interaction of harmful factors are probable. Markov processes are a convenient model that can describe the behaviour of physical processes with random dynamics. Purpose of the work: was to develop a probabilistic model of risk assessment for agriculture workers during the application of pesticides based on Markov processes’ theory and evaluate with the help of the developed model the probability of occurrence, the degree of severity and the prediction of the different influence of adverse factors on the operator. Materials and methods. The mechanized treatment of pesticide is presented in the form of a system, the states of which are ranked according to the degree of danger to the operator: from non-dangerous to dangerous. The transition occurs under the influence of negative factors and is characterized by the probability of pij transition. Based on the marked graph of the system states, a stochastic matrix P[ij] of transition probabilities was constructed in one step. There are formulas by which it is possible to calculate the state of systems in k steps for a homogeneous and non-homogeneous Markov chain. Results. Based on Markov chains’ theory, the system’s behaviour is modelled when using single-component preparations based on imidacloprid for rod spraying of field crops. Received vector of probabilities of possible hazardous conditions for the employee after each hour of spraying within 10 hours. After 6 hours of working, the probabilistic risk for the operator to stay in a non-dangerous state is about 50 %, and the probability risk of going into a dangerous - at 24 %. The stationary probability distribution results show the inevitability of the transition to a hazardous state of the system if enough steps have been taken. Conclusion. With this model, you can supplement the operator’s health risk assessment system, analyze, compare and summarize the results of years of research. The calculated statistical probabilities can be used in the development of new hygiene regulations with using pesticides.

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

Design of Improved Version of Sigmoidal Function with Biases for Classification Task in ELM Domain

Extreme Learning Machine (ELM) is one of the latest trends in learning algorithm, which can provide a good recognition rate within less computation time. Therefore, the algorithm can sustain for a faster response application by utilizing a feed-forward neural network. In this research article, the ELM method has been designed with the presence of sigmoidal function of biases in the hidden nodes to perform the classification task. The classification task is very challenging with the existing learning algorithm and increased computation time due to the huge amount of dataset. While handling of the stochastic matrix for hidden layer, output provides the lower performance for learning rate and robustness in the determination. To address these issues, the modified version of ELM has been developed to obtain better accuracy and minimize the classification error. This research article includes the mathematical proof of sigmoidal activation function with biases of the hidden nodes present in the networks. The output matrix maintains the column rank in order to improve the speed of the training output weights (β). The proposed improved version of ELM leverages better accuracy and efficacy in classification and regression problems as well. Due to the inclusion of matrix column ranking in mathematical proof, the proposed improved version of ELM solves the slow training speed and over-fitting problems present in the existing learning approach.

Doubly stochastic matrices and the quantum channels

The main object of this paper is to study doubly stochastic matrices with majorization and the Birkhoff theorem. The Perron-Frobenius theorem on eigenvalues is generalized for doubly stochastic matrices. The region of all possible eigenvalues of n-by-n doubly stochastic matrix is the union of regular (n – 1) polygons into the complex plane. This statement is ensured by a famous conjecture known as the Perfect-Mirsky conjecture which is true for n = 1, 2, 3, 4 and untrue for n = 5. We show the extremal eigenvalues of the Perfect-Mirsky regions graphically for n = 1, 2, 3, 4 and identify corresponding doubly stochastic matrices. Bearing in mind the counterexample of Rivard-Mashreghi given in 2007, we introduce a more general counterexample to the conjecture for n = 5. Later, we discuss different types of positive maps relevant to Quantum Channels (QCs) and finally introduce a theorem to determine whether a QCs gives rise to a doubly stochastic matrix or not. This evidence is straightforward and uses the basic tools of matrix theory and functional analysis.