Romanovski polynomials in selected physics problems

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.     

Conditional expectation of integrands and random sets

The conditional expectation of integrands and random sets is the main tool of stochastic optimization. This work wishes to make up for the lack of real synthesis about this subject. We improve the existing hypothesis and simplify the corresponding proofs. In the convex case we especially study the problem of the exchange of conditional expectation and subdifferential operators.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Idealization of a decomposition theorem

In 1986, Tong [13] proved that a function f : (X,τ)→(Y,φ) is continuous if and only if it is α-continuous and A-continuous. We extend this decomposition of continuity in terms of ideals. First, we introduce the notions of regular-I-closed sets, A _I-sets and A _I -continuous functions in ideal topological spaces and investigate their properties. Then, we show that a function f : (X,τ,I)→(Y, φ) is continuous if and only if it is α-I-continuous and A _I-continuous. This revised version was published online in June 2006 with corrections to the Cover Date.     

A note on strongly π-regular rings

Let R be an associative ring with unit and let N(R) denote the set of nilpotent elements of R. R is said to be stronglyπ-regular if for each x∈R, there exist a positive integer n and an element y∈R such that x ⁿ=x ^{n +1} y and xy=yx. R is said to be periodic if for each x∈R there are integers m,n≥ 1 such that m≠n and x ^m=x ⁿ. Assume that the idempotents in R are central. It is shown in this paper that R is a strongly π-regular ring if and only if N(R) coincides with the Jacobson radical of R and R/N(R) is regular. Some similar conditions for periodic rings are also obtained. This revised version was published online in June 2006 with corrections to the Cover Date.     

Algebras of Random Operators Associated to Delone Dynamical Systems

We carry out a careful study of operator algebras associated with Delone dynamical systems. A von Neumann algebra is defined using noncommutative integration theory. Features of these algebras and the operators they contain are discussed. We restrict our attention to a certain C ^*-subalgebra to discuss a Shubin trace formula.     

A multifractal decomposition according to rate of returns

For one‐dimensional simple symmetric random walk, the Hausdorff and packing dimensions of sets of sample paths with prescribed rate of returns to the origin are determined. This gives a multifractal decomposition of the underlying sample space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

关于“信息熵”分析及其应用的研究

本文用Ｓｈａｎｎｏｎ熵函数的观点及最大离散熵原理，探讨了对随机试验项目的优选问题：即压缩某种“不确定性”试验项目的实施与探索．并通过应用实例的计算，获得了满意的聚类效果．这种方法对于信息资料的数据处理及压缩“不确定性“验项目具有普遍意义．     

Model-dependent nature of blowtorch effect on the escape and equilibration rates

We analyze the relaxation behavior of a bistable system when the background temperature profile is inhomogeneous due to the presence of a localized hot region (blowtorch) on one side of the potential barrier. Since the diffusion equation for inhomogeneous medium is model-dependent, we consider two physical models to study the kinetics of such system. Using a conventional stochastic method, we obtain the escape and equilibration rates of the system for the two physical models. For both models, we find that the hot region enhances the escape rate from the well where it is placed while it retards the escape rate from the other well. However, the value of the escape rate from the well where the hot region is placed differs for the two models while that of the escape rate from the other well is identical for both. This work, for the first time, gives a detailed report of the similarities and differences of the escape rates and, hence, exposes the common and distinct features of the two known physical models in determining the way the bistable system relaxes. Received 25 September 2001     

Quasipotentials for simple noisy maps with complicated dynamics

The theory of nonequilibrium potentials or quasipotentials is a physically motivated approach to small random perturbations of dynamical systems, leading to exponential estimates of invariant probabilities and mean first exit times. In the present article we develop the mathematical foundation of this theory for discrete-time systems, following and extending the work of Freidlin and Wentzell, and Kifer. We discuss strategies for calculating and estimating quasipotentials and show their application to one-dimensionalS-unimodal maps. The method proves to be especially suited for describing the noise scaling behavior of invariant probabilities, e.g., for the map occurring as the limit of the Feigenbaum period-doubling sequence. We show that the method allows statements about the scaling behavior in the case of localized noise, too, which does not originally lie within the scope of the quasipotential formalism.