RISK FUNCTION AND OPTIMALITY OF STATISTICAL PROCEDURES FOR IDENTIFICATION OF NETWORK STRUCTURES
Identification of network structures using the finite-size sample has been considered.
The concepts of random variables network and network model, which is a complete weighted
graph, have been introduced. Two types of network structures have been investigated: network
structures with an arbitrary number of elements and network structures with a fixed number
of elements of the network model. The problem of identification of network structures has
been investigated as a multiple testing problem. The risk function of statistical procedures for
identification of network structures can be represented as a linear combination of expected
numbers of incorrectly included elements and incorrectly non-included elements. The sufficient
conditions of optimality for statistical procedures for network structures identification with
an arbitrary number of elements have been given. The concept of statistical uncertainty of
statistical procedures for identification of network structures has been introduced.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
A common network representation of the stock market is based on correlations of time series of return fluctuations. It is well known that financial time series have a stochastic nature. Therefore there is uncertainty in inference about filtered structures in market network. Thus market network analysis need to be complemented by estimation of uncertainty of the obtained results. However as far as we know there are no relevant research in the literature. In the present paper we maake the first step in this direction. We propose the approach to measure statistical uncertainty of different market network structures. This approach is based on conditional risk for corresponding multiple decision statistical procedures. The proposed appoach is illustrated by numerical evaluation of statistical ucertainty for popular network structures. Our experimental study validates the possibility of application of the approach for comparison of uncerttainty of different network structures.
We consider the dependence of the growth arte on the elasticity of substitution within the framework of a model with the agents' mutual dependence. This model is interpreted as a network structure. the development is explined as the agents' valus increase in a dynamic system described by functions which display constant elasticity of substitution (CES). We investigate the cases of high and low complementarity of activities. In particular, we receive conditions allowing to identify the cases when the elasticity of substitution has the positive (negative) effect on growth rate under high (low) complementarity of activities. Additionally we analyse the influence of the individual agent's productivities on the growth rate. Finally we give a potential generalisation of the model allowing for different growth rates of the agents.
We consider a game equilibrium in a network in each node of which an economy is described by the simple two-period model of endogenous growth with production and knowledge externalities. Each node of the network obtains an externality produced by the sum of knowledge in neighbor nodes. Uniqueness of the inner equilibrium is proved. Three ways of behavior of each agent are distinguished: active, passive, hyperactive. Behavior of agents in dependence on received externalities is studied. It is shown that the equilibrium depends on the network structure. We study the role of passive agents; in particular, possibilities of connection of components of active agents through components of passive agents. A notion of type of node is introduced and classification of networks based on this notion is provided. It is shown that the inner equilibrium depends not on the size of network but on its structure in terms of the types of nodes, and in similar networks of different size agents of the same type behave in similar way.
We discuss the efficiency of the quadratic bridge volatility estimator in comparison with Parkinson, Garman-Klass and Roger-Satchell estimators. It is shown in particular that point and interval estimations of volatility, resting on the bridge estimator, are considerably more efficient than analogous estimations, resting on the Parkinson, Garman-Klass and Roger-Satchell ones. © 2012 Elsevier B.V. All rights reserved.
Research into the market graph is attracting increasing attention in stock market analysis. One of the important problems connected with the market graph is its identification from observations. The standard way of identifying the market graph is to use a simple procedure based on statistical estimations of Pearson correlations between pairs of stocks. Recently a new class of statistical procedures for market graph identification was introduced and the optimality of these procedures in the Pearson correlation Gaussian network was proved. However, the procedures obtained have a high reliability only for Gaussian multivariate distributions of stock attributes. One of the ways to correct this problem is to consider different networks generated by different measures of pairwise similarity of stocks. A new and promising model in this context is the sign similarity network. In this paper the market graph identification problem in the sign similarity network is reviewed. A new class of statistical procedures for the market graph identification is introduced and the optimality of these procedures is proved. Numerical experiments reveal an essential difference in the quality between optimal procedures in sign similarity and Pearson correlation networks. In particular, it is observed that the quality of the optimal identification procedure in the sign similarity network is not sensitive to the assumptions on the distribution of stock attributes.
We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.
We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.
We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.
The problem of minimizing the root mean square deviation of a uniform string with clamped ends from an equilibrium position is investigated. It is assumed that the initial conditions are specified and the ends of the string are clamped. The Fourier method is used, which enables the control problem with a partial differential equation to be reduced to a control problem with a denumerable system of ordinary differential equations. For the optimal control problem in the l2 space obtained, it is proved that the optimal synthesis contains singular trajectories and chattering trajectories. For the initial problem of the optimal control of the vibrations of a string it is also proved that there is a unique solution for which the optimal control has a denumerable number of switchings in a finite time interval.
For a class of optimal control problems and Hamiltonian systems generated by these problems in the space l 2, we prove the existence of extremals with a countable number of switchings on a finite time interval. The optimal synthesis that we construct in the space l 2 forms a fiber bundle with piecewise smooth two-dimensional fibers consisting of extremals with a countable number of switchings over an infinite-dimensional basis of singular extremals.
In this paper, we construct a new distribution corresponding to a real noble gas as well as the equation of state for it.