نتایج جستجو برای: asymptotic techniques

تعداد نتایج: 690150  

2013
LU WANG

In this paper, we show the uniqueness of smooth embedded selfshrinkers asymptotic to generalized cylinders of infinite order. Also, we construct non-rotationally symmetric self-shrinking ends asymptotic to generalized cylinders with rate as fast as any given polynomial.

2017
Alexander Bufetov Sevak Mkrtchyan Maria Shcherbina Alexander Soshnikov ALEXANDER BUFETOV SEVAK MKRTCHYAN MARIA SHCHERBINA

We show that beta ensembles in Random Matrix Theory with generic real analytic potential have the asymptotic equipartition property. In addition, we prove a Central Limit Theorem for the density of the eigenvalues of these ensembles.

Journal: :Finance and Stochastics 2008
Dmitry B. Rokhlin

This paper deals with the notion of a large financial market and the concepts of asymptotic arbitrage and strong asymptotic arbitrage (both of the first kind), introduced in [13], [14]. We show that the arbitrage properties of a large market are completely determined by the asymptotic behavior of the sequence of the numéraire portfolios, related to small markets. The obtained criteria can be ex...

2015
Robert H. Reynolds

Far too many courts lack interest in either education or engineering. This also can be applied to the police departments. In too many in­ stances educators are indifferent to the courts, police and engineering. Not desiring to point an accusing finger, it is felt that traffic engineer­ ing falls as short of perfection in this regard as the other fields of re­ sponsibility in traffic safety. If,...

Journal: :IEEE Trans. Information Theory 1989
Thomas M. Cover Sandeep Pombra

Abstracl-The capacity of time-varying additive Gaussian noise cbannels with feedback is characterized. Toward this end, an asymptotic equipartition theorem for nonstationary Gaussian processes is proved. Then, with the aid of certain matrix inequalities, it is proved that the feedback capacity C,, in bits per transmission and the nonfeedback capacity C satisfy C 5 CFB < 2C (a result obtained by...

Let U(t, ) be solution of the Dirichlet problem y''+( t-q(t))y= 0 - 1 t l y(-l)= 0 = y(x), with variabIe t on (-1, x), for fixed x, which satisfies the initial condition U(-1, )=0 , (-1, )=1. In this paper, the asymptotic representation of the corresponding eigenfunctions of the eigen values has been investigated . Furthermore, the leading term of the asymptotic formula for ...

Journal: :journal of sciences, islamic republic of iran 2014
v. fakoor

kernel density estimators are the basic tools for density estimation in non-parametric statistics.  the k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in  which  the  bandwidth  is varied depending on the location of the sample points. in this paper‎, we  initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...

2000
Stephen D.H. Hsu

We review recent progress on the phenomena of color superconductivity in high density quark matter. We begin with a brief overview of the unique aspects of physics near a Fermi surface and the implications for renormalization group (RG) techniques. We next discuss the qualitative differences between asymptotic densities, where the effective coupling constant can be made arbitrarily small, and i...

2008
Jean-André Marti

We introduce a general context involving a presheaf A and a subpresheaf B of A. We show that all previously considered cases of local analysis of generalized functions (defined from duality or algebraic techniques) can be interpretated as the B-local analysis of sections of A. But the microlocal analysis of the sections of sheaves or presheaves under consideration is dissociated into a ”frequen...

Journal: :Des. Codes Cryptography 1995
Tuvi Etzion Victor K.-W. Wei Zhen Zhang

Motivated by applications in universal data compression algorithms we study the problem of bounds on the sizes of constant weight covering codes. We are concerned with the minimal sizes of codes of length n and constant weight u such that every word of length n and weight v is within Hamming distance d from a codeword. In addition to a brief summary of part of the relevant literature, we also g...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید