Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

New results for diffusion in Lorentz lattice gas cellular automata

New calculations to over ten million time steps have revealed a more complex diffusive behavior than previously reported of a point particle on a square and triangular lattice randomly occupied by mirror or rotator scatterers. For the square lattice fully occupied by mirrors where extended closed particle orbits occur, anomalous diffusion was still found. However, for a not fully occupied lattice the superdiffusion, first noticed by Owczarek and Prellberg for a particular concentration, obtains for all concentrations. For the square lattice occupied by rotators and the triangular lattice occupied by mirrors or rotators, an absence of diffusion (trapping) was found for all concentrations, except on critical lines, where anomalous diffusion (extended closed orbits) occurs and hyperscaling holds for all closed orbits withuniversal exponentsd _f =7/4 and =15/7. Only one point on these critical lines can be related to a corresponding percolation problem. The questions arise therefore whether the other critical points can be mapped onto a new percolation-like problem and of the dynamical significance of hyperscaling.     

Rate conservation laws: A survey

We survey the rate conservation law, RCL for short, arising in queues and related stochastic models. RCL was recognized as one of the fundamental principles to get relationships between time and embedded averages such as the extended Little's formulaH=G, but we show that it has other applications. For example, RCL is one of the important techniques for deriving equilibrium equations for stochastic processes. It is shown that the various techniques, including Mecke's formula for a stationary random measure, can be formulated as RCL. For this purpose, we start with a new definition of the rate with respect to a random measure, and generalize RCL by using it. We further introduce the notion of quasi-expectation, which is a certain extension of the ordinary expectation, and derive RCL applicable to the sample average results. It means that the sample average formulas such asH=G can be obtained as the stationary RCL in the quasi-expectation framework. We also survey several extensions of RCL and discuss examples. Throughout the paper, we would like to emphasize how results can be easily obtained by using a simple principle, RCL.     

On pathwise behavior of multiserver queues

In this paper, by exploiting recent results on the pathwise behavior of the workload process in single server, work conserving queues of theG/G/1/ type, we show that the workload of multiserver, work conserving queues ofG/G/m/ (m<) (andG/G/) queues satisfies an o(t) growth condition, provided that the time average of the work brought into the system is less thanm form < (and finite form=).     

Energy-level statistics of model quantum systems: Universality and scaling in a lattice-point problem

We investigate the statistics of the numberN(R, S) of lattice pointsnZ ², in an annular domain (R, w)=(R+w)A\RA, whereR, w>0. HereA is a fixed convex set with smooth boundary andw is chosen so that the area of (R, w) isS. The statistics comes fromR being taken as random (with a smooth density) in some interval [c ₁ T,c ₂,T],c ₂>c ₁>0. We find that in the limitT the variance and distribution of N=N(R; S)–S depend strongly on howS grows withT. There is a saturation regimeS/T, asT, in which the fluctuations in N coming from the two boundaries of are independent. Then there is a scaling regime,S/Tz, 0<z<, in which the distribution depends onz in an almost periodic way going to a Gaussian asz0. The variance in this limit approachesz for genericA, but can be larger for degenerate cases. The former behavior is what one would expect from the Poisson limit of a distribution for annuli of finite area.     

Absence of absolutely continuous spectrum of Floquet operators

The spectrum of the Floquet operator associated with time-periodic perturbations of discrete Hamiltonians is considered. If the gap between successive eigenvalues _j of the unperturbed Hamiltonian grows as _j - _j-1 j and the multiplicity of _j grows asj with >0 asj tends to infinity, then the corresponding Floquet operator possesses no absolutely continuous spectrum provided the perturbation is smooth enough.     

Banach spaces that admit support sets

It is shown that the existence of a closed convex set all of whose points are properly supported in a Banach space is equivalent to the existence of a certain type of uncountable ordered one-sided biorthogonal system. Under the continuum hypothesis, we deduce that this notion is weaker than the existence of an uncountable biorthogonal system.

     

Wiener's test for space-time random walks and its applications

This paper establishes a criterion for whether a -dimensional random walk on the integer lattice visits a space-time subset infinitely often or not. It is a precise analogue of Wiener's test for regularity of a boundary point with respect to the classical Dirichlet problem. The test obtained is applied to strengthen the harder half of Kolmogorov's test for the random walk.

     

Realization of fixed point sets

Letf:XX be a selfmap of a compact connected polyhedron, andA a nonempty closed subset ofX. In this paper, we shall deal with the question whether or not there is a mapg:XX homotopic tof such that the fixed point set Fixg ofg equalsA. We introduce a necessary condition for the existence of such a mapg. It is shown that this condition is easy to check, and hence some sufficient conditions are obtained.Partially supported by the Natural Science Foundation of Liaoning University.     

拟塑性流体理论中一类奇异非线性边界值问题

研究了起源于拟塑性流体理论中的一类奇异非线性两点边界值问题正确的存在性和唯一性。