Bounds of eigenvalues of a graph

LetG be a simple graph withn vertices. We denote by _i(G) thei-th largest eigenvalue ofG. In this paper, several results are presented concerning bounds on the eigenvalues ofG. In particular, it is shown that –1₂(G)(n–2)/2, and the left hand equality holds if and only ifG is a complete graph with at least two vertices; the right hand equality holds if and only ifn is even andG2K _n/2.     

Isotropic random walks in a tree

Summary Let T be an infinite homogeneous tree of order a+1. We study Markov chains {X _n} in T whose transition functions p(x, y)=A[d(x,y)] depend only on the shortest distance between x and y in the graph. The graph T can be represented as a symmetric space of a p-adic matrix group; we prove a series of results using essentially the spherical functions of this symmetric space. Theorem 1. d(X _n,x) n a.s., where >0 if A(0) 1, X ₀=x. Assuming {X _n} is strongly aperiodic, Theorem 2. p ₂(x, y)CRⁿ/n^3/2 for fixed x, y where R=(d) A(d)<1, and if E[d(X₁, X₀)²]<, Theorem 3. R(1–u, x, y) = (1–u)ⁿp_n(x, y)=Ca^–d[exp(–du/)+o_d(1)] as d=d(x,y) uniformly for 0u2. Using Theorem 3, we calculate the Martin boundary Dirichlet kernel of p(x, y) on T, which turns out to be independent of {itA(d)}. We also consider a stepping-stone model of a randomly-mating-and-migrating population on the nodes of T. If initially all individuals are distinct, then in generation n approximately half of the individuals of a given type are within n of a typical one and essentially all are within 2n.This work was partially supported by the National Science Foundation under grant number MCS 75-08098-A01For the academic year 1977–78: Department of Mathematics GN-50, University of Washington, Seattle, Washington 98195 USA     

Packing random items of three colors

Consider three colors 1,2,3, and forj3, considern items (X _i,j)in of colorj. We want to pack these items inn bins of equal capacity (the bin size is not fixed, and is to be determined once all the objects are known), subject to the condition that each bin must contain exactly one item of each color, and that the total item sizes attributed to any given bin does not exceed the bin capacity. Consider the stochastic model where the random variables (X _i,jj)in,j3 are independent uniformly distributed over [0,1]. We show that there is a polynomial-time algorithm that produces a packing which has a wasted spaceK logn with overwhelming probability.Work partially supported by an N.S.F. grant.     

An Inequality for Tail Probabilities of Martingales with Bounded Differences

Let M _n =X₁+...+X_n be a martingale with bounded differences X_m=M_m-M_m-1 such that {|X_m| _m}=1 with some nonnegative _m. Write ²= ₁ ² + ... + _n ² . We prove the inequalities {M _nx}c(1-(x/)), {M _n x} 1- c(1- (-x/)) with a constant . The result yields sharp inequalities in some models related to the measure concentration phenomena.     

On Meta-Thin Association Schemes

An association scheme is a combinatorial object derived from the orbitals of a transitive permutation group. Let G be a transitive permutation group acting on a finite set X. Then _{x X}G_x is a normal subgroup of G where G_x:={g G x^g=x}. A meta-thin association scheme can be considered as a generalization of the situation where _{x X}G_x normalizes G_x. In this paper, we consider the automorphism group of a meta-thin association scheme, and obtain a sufficient condition for a meta-thin association scheme to have a transitive automorphism group. This enables us to conclude that every meta-thin association scheme with its thin residue isomorphic to the cyclic group of order pq, where p and q are primes, has a transitive automorphism group.     

The absolute convergence of weighted sums of dependent sequences of random variables

Summary The sum a _n X _n of a weighted series of a sequence {X _n } of identically distributed (not necessarily independent) random variables (r.v.s.) is a.s. absolutely convergent if for some in 0<1, ¦a _n ¦ < and E¦X _n ¦ < ; if a _n =z ⁿ for some ¦z¦<1 then it suffices that E(log¦X _n ¦)₊<. Examples show that these sufficient conditions are not necessary. For mutually independent {X _n } necessary conditions can be given: the a.s. absolute convergence of X _n z ⁿ (all ¦z¦<1) then implies E(log¦X _n ¦)₊ < , while if the X _n are non-negative stable r.v.s. of index , ¦a _n X _n ¦< if and only if ¦a _n ¦ < .     

A combinatorial property of points and ellipsoids

For eachd1 there is a constantc _d>0 such that any finite setXR ^d contains a subsetYX, |Y|[1/4d(d+3)]+1 having the following property: ifEY is an ellipsoid, then |E X|c _d |X|.On leave from the Mathematical Institute of the Hungarian Academy of Sciences, 1364 Budapest, P.O. Box 127, Hungary. Supported by a research fellowship from the Science and Engineering Research Council, U.K., and by Hungarian National Foundation for Scientific Research Grant No. 1812.     

Semistable measures and limit theorems on real andp-adic groups

For any locally compact groupG, we show that any locally tight homomorphism from a real directed semigroup intoM ¹ (G) (semigroup of probability measures onG) has a shift which extends to a continuous one-parameter semigroup. IfG is ap-adic algebraic group then the above holds even iff is not locally tight. These results are applied to give sufficient conditions for embeddability of some translate of limits of sequences of the form {v _n ^kn } and M ¹ (G) such that ()= ^M , for somek>1 and AutG (cf. Theorems 2.1, 2.4, 3.7).     

A combinatorial result about points and balls in euclidean space

For eachn1 there isc _n >0 such that for any finite sexX there isA X, |A|1/2(n+3), having the following property: ifB A is ann-ball, then |B X|c _n |X|. This generalizes a theorem of Neumann-Lara and Urrutia which states thatc ₂1/60.     

Sample behavior of some random series

The scaled-sample property ({X ^j / _n } _j=1 ⁿ K a.s. asn, where _n <0 andX( ^j ) are i.i.d. with law ) is investigated for distributions which are the laws of random series of form _i=1 X _i v _i . Herev _i are fixed vectors in a Banach space, andX _i are i.i.d. real-valued with common law ₁. The main result presented here establishes this convergence for a large collection of possible distributions ₁, including some discrete examples. The main tools used are probability inequalities on the tails of the series, and concentration of measure arguments.Supported by NSF Grant No. DMS-9024961. This work will be included in the author's Ph.D. thesis.     

Characterization,structure and analysis on abelian ℒ∞ groups

An abelian topological group is an group if and only if it is a locally -compactk-space and every compact subset in it is contained in a compactly generated locally compact subgroup. Every abelian groupG is topologically isomorphic to G ₀ where ₀ andG ₀ is an abelian group where every compact subset is contained in a compact subgroup. Intrinsic definitions of measures, convolution of measures, measure algebra,L ₁-algebra, Fourier transforms of abelian groups are given and their properties are studied.     

Long paths and cycles in tough graphs

For a graphG, letp(G) andc(G) denote the length of a longest path and cycle, respectively. Let (t,n) be the minimum ofp(G), whereG ranges over allt-tough connected graphs onn vertices. Similarly, let (t,n) be the minimum ofc(G), whereG ranges over allt-tough 2-connected graphs onn vertices. It is shown that for fixedt>0 there exist constantsA, B such that (t,n)A·log(n) and (t,n)·log((t,n))B·log(n). Examples are presented showing that fort1 there exist constantsA, B such that (t,n)A·log(n) and (t,n)B· log(n). It is conjectured that (t,n) B·log(n) for some constantB. This conjecture is shown to be valid within the class of 3-connected graphs and, as conjectured in Bondy [1] forl=3, within the class of 2-connectedK _1.l-free graphs, wherel is fixed.     

Convergence of random products of compact contractions in Hilbert space

Let {T₁, ..., T_N} be a finite set of linear contraction mappings of a Hilbert space H into itself, and let r be a mapping from the natural numbers N to {1, ..., N}. One can form S_n=T_r(n)...T_r(1) which could be described as a random product of the T_i's. Roughly, the S_n converge strongly in the mean, but additional side conditions are necessary to ensure uniform, strong or weak convergence. We examine contractions with three such conditions. (W): x_n1, Tx_n1 implies (I-T)x_n0 weakly, (S): x_n1, Tx_n1 implies (I-T)x_n0 strongly, and (K): there exists a constant K>0 such that for all x, (I-T)x²K(x²–Tx²).We have three main results in the event that the T_i's are compact contractions. First, if r assumes each value infinitely often, then S_n converges uniformly to the projection Q on the subspace _i= ₁ ^N [x|T_ix=x]. Secondly we prove that for such compact contractions, the three conditions (W), (S), and (K) are equivalent. Finally if S=S(T₁, ..., T_N) denotes the algebraic semigroup generated by the T_i's, then there exists a fixed positive constant K such that each element in S satisfies (K) with that K.     

Limit Theorems for the Maximum Terms of a Sequence of Random Variables with Marginal Geometric Distributions

Let X _n1 ^* , ... X _nn ^* be a sequence of n independent random variables which have a geometric distribution with the parameter p _n = 1/n, and M _n ^* = \max\{X _n1 ^* , ... X _nn ^* }. Let Z ₁, Z₂, Z₃, ... be a sequence of independent random variables with the uniform distribution over the set N _n = {1, 2, ... n}. For each j N _n let us denote X _nj = min{k : Z_k = j}, M _n = max{X_n1, ... X_nn}, and let S _n be the 2nd largest among X _n1, X_n2, ... X_nn. Using the methodology of verifying D(u_n) and D'(u_n) mixing conditions we prove herein that the maximum M _n has the same type I limiting distribution as the maximum M _n ^* and estimate the rate of convergence. The limiting bivariate distribution of (S_n, M_n) is also obtained. Let _n, _n N_n, , and T _n = min{M(A_n), M(B_n)}. We determine herein the limiting distribution of random variable T _n in the case _n , _n/_n > 0, as n .     

Approximation of the viability kernel

We study recursive inclusionsx ⁿ⁺¹ G(x ⁿ ). For instance, such systems appear for discrete finite-difference inclusionsx ⁿ⁺¹ G (x ⁿ) whereG :=1+F. The discrete viability kernel ofG , i.e., the largest discrete viability domain, can be an internal approximation of the viability kernel ofK underF. We study discrete and finite dynamical systems. In the Lipschitz case we get a generalization to differential inclusions of the Euler and Runge-Kutta methods. We prove first that the viability kernel ofK underF can be approached by a sequence of discrete viability kernels associated withx ⁿ⁺¹ (xⁿ) where (x) =x + F(x) + (ML/2) ². Secondly, we show that it can be approached by finite viability kernels associated withx _h ⁿ⁺¹ ( (x _h ⁿ⁺¹ ) +(h) X _h .     

Combinatorial Properties of Brownian Motion on the Compact Classical Groups

We consider the probability distribution on a classical group G which naturally generalizes the normal distribution (the heat kernel), defined in terms of Brownian motions on G. As Brownian motion can be defined in terms of the Laplacian on G, much of this work involves the computation of the Laplacian. These results are then used to study the behavior of the normal distribution on U(n( as . In addition, we show how the results on computing the Laplacian on the classical groups can be used to compute expectations with respect to Haar measure on those groups.     

Sur les équations fonctionnelles auxq-différences

Summary In this paper, we study the convergence of formal power series solutions of functional equations of the formP _k(x)(^[k](x))=(x), where ^[k] (x) denotes thek-th iterate of the function.We obtain results similar to the results of Malgrange and Ramis for formal solutions of differential equations: if(0) = 0, and(0) =q is a nonzero complex number with absolute value less than one then, if(x)=a(n)x ⁿ is a divergent solution, there exists a positive real numbers such that the power seriesa(n)q ^sn(n+1)2 x ⁿ has a finite and nonzero radius of convergence.

     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

Characterization of distributions by the local asymptotic optimality property of tests statistics

Let X₁, X₂,... be a sequence of independent, identically distributed random variables with density f(x–), R¹. We consider the problem of testing the hypothesis H₀=0 against H₁ 0 on the basis of a sequence of test statistics {T_n(X₁,...,X_n). In accordance with the Bahadur theory, a measure of the asymptotic efficiency of {T_n} is its exact slope C_t(). One says that {T_n} is locally asymptotically optimal in the Bahadur sense if C_t() ip 2K(), 0, where.The purpose of the paper is to characterize densities f for which the property of local asymptotic optimality is shared by such commonly used statistics as the sample mean, the Kolmogorov-Smirnov statistic, the sign statistic, ², etc. Under certain restrictions on f one proves, for example, that the sequence of statistics u is locally asymptotically optimal only for the hyperbolic cosine distribution, while the Kolmogorov statistic only for the Laplace distribution. At the end of the paper one obtains similar results for the two-sample case, in particular, for a large class of linear rank statistics.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 108, pp. 119–133, 1981.     

The existence of probability measures with specified projections

Let X and Y be locally compact-compact topological spaces, F X×Y is closed, and P(F) is the set of all Borel probability measures on F. For us to find, for the pair of probability measures (_x, _y P (X)×P(Y), a probability measure P(F) such that _X = _X ^–1 , _Y = _Y ^–1 it is necessary and sufficient that, for any pair of Borel sets A X, B Y for which (A× B) F=Ø, the condition _XA+ _YB 1 holds.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 573–576, October, 1973.