Testing properties of graphs and functions

We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the function values as edge probabilities. We give a characterization of properties testable this way, and extend a number of results about “large graphs” to this setting.     

A correction to and improvement of ‘Strong approximations of some biometric estimates under random censorship’

Summary In the proof of the main result of the original paper there is an error. Instead of repairing that proof to get just the original result, at the critical spot we improve the proof and obtain a much better result. In particular, we approximate the product-limit and empirical cumulative hazard processes by suitable copies of the corresponding limiting Gaussian processes with rates of approximation that on appropriate fixed half lines reduce to the rates of Komlós, Major and Tusnády for the uncensored empirical process.     

On the Operation sup for Subcategories of mer

We study properties of the operation , defined for structures corresponding to different subcategories of MER, as merotopies, filter merotopies, contiguities, -contiguities and closures. In particular, we examine commutativity of and the operation according to which a structure induces a structure of another type (as e.g.\ a merotopy induces a closure) and the inverse operations of the former.     

Strong approximations of the Hoeffding,Blum, Kiefer,Rosenblatt multivariate empirical process

Hoeffding (Ann. Math. Statist. 1948) and Blum, Kiefer and Rosenblatt (Ann. Math. Statist. 1961) constructed distribution free tests of independence based on a multivariate empirical process. We establish strong invariance principles for the latter and also for appropriate functionals of it.     

Some Periodic and Non-Periodic Recursions

 It is well known that the recurrence relations

Balancedness conditions for exact games

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced. The condition of exact balancedness is identical to the one of balancedness, except that one of the balancing weights may be negative, while for overbalancedness one of the balancing weights is required to be non-positive and no weight is put on the grand coalition. Exact balancedness and overbalancedness are both easy to formulate conditions with a natural game-theoretic interpretation and are shown to be useful in applications. Using exact balancedness we show that exact games are convex for the grand coalition and we provide an alternative proof that the classes of convex and totally exact games coincide. We provide an example of a game that is totally balanced and convex for the grand coalition, but not exact. Finally we relate classes of balanced, totally balanced, convex for the grand coalition, exact, totally exact, and convex games to one another.     

Open Problems

Periodica Mathematica Hungarica -     

A flexible framework for Group Decision Support: WINGDSS version 3.0

A flexible framework for Group Decision Support on PCs in Microsoft Windows environment is presented. WINGDSS does not replace human judgment but highly supports the entire process of decision making, from problem structuring to post-decision analysis. The latest version of WINGDSS is a modular, open system with a dynamical connection to relational databases, an interpreter for defining problem specific evaluation procedures, a lot of interactive features from setting up the tree of criteria until the sensitivity analysis on individual/group ranking. By providing tools for recursively redefining the decision problem, WINGDSS helps the decision makers in achieving a result satisfactory to the whole group.Research supported in part by the Hungarian Foundation for Scientific Research, Grant No. 2568 and by the Hungarian National Committee for Technical Research and Development, Grant No. 93-97-67-0553.     

Increment sizes of the principal value of Brownian local time

Let W be a standard Brownian motion, and define Y(t)= ∫₀ ^t ds/W(s) as Cauchy's principal value related to local time. We determine: (a) the modulus of continuity of Y in the sense of P. Lévy; (b) the large increments of Y. Received: 1 April 1999 / Revised version: 27 September 1999 / Published online: 14 June 2000