Erdős measures,sofic measures,and Markov chains

We consider the random variable ζ = ξ₁ρ+ξ₂ρ²+…, where ξ₁, ξ₂, … are independent identically distibuted random variables taking the values 0 and 1 with probabilities P(ξ_i = 0) = p₀, P(ξ_i = 1) = p₁, 0 < p₀ < 1. Let β = 1/ρ be the golden number. The Fibonacci expansion for a random point ρζ from [0, 1] is of the form η₁ρ + η₂ρ² + … where the random variables η_k are {0, 1}-valued and η_kη_k+1 = 0. The infinite random word η = η₁η₂ … η_n … takes values in the Fibonacci compactum and determines the so-called Erdős measure μ(A) = P(η ∈ A) on it. The invariant Erdős measure is the shift-invariant measure with respect to which the Erdős measure is absolutely continuous. We show that the Erdős measures are sofic. Recall that a sofic system is a symbolic system that is a continuous factor of a topological Markov chain. A sofic measure is a one-block (or symbol-to-symbol) factor of the measure corresponding to a homogeneous Markov chain. For the Erdős measures, the corresponding regular Markov chain has 5 states. This gives ergodic properties of the invariant Erdős measure. We give a new ergodic theory proof of the singularity of the distribution of the random variable ζ. Our method is also applicable when ξ₁, ξ₂, … is a stationary Markov chain with values 0, 1. In particular, we prove that the distribution of ζ is singular and that the Erdős measures appear as the result of gluing together states in a regular Markov chain with 7 states. Bibliography: 3 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 326, 2005, pp. 28–47.     

Trees with Equal Domination and Restrained Domination Numbers

Let G = (V,E) be a graph and let S V. The set S is a packing in G if the vertices of S are pairwise at distance at least three apart in G. The set S is a dominating set (DS) if every vertex in V − S is adjacent to a vertex in S. Further, if every vertex in V − S is also adjacent to a vertex in V − S, then S is a restrained dominating set (RDS). The domination number of G, denoted by γ(G), is the minimum cardinality of a DS of G, while the restrained domination number of G, denoted by γ_r(G), is the minimum cardinality of a RDS of G. The graph G is γ-excellent if every vertex of G belongs to some minimum DS of G. A constructive characterization of trees with equal domination and restrained domination numbers is presented. As a consequence of this characterization we show that the following statements are equivalent: (i) T is a tree with γ(T)=γ_r(T); (ii) T is a γ-excellent tree and T ≠ K₂; and (iii) T is a tree that has a unique maximum packing and this set is a dominating set of T. We show that if T is a tree of order n with ℓ leaves, then γ_r(T) ≤ (n + ℓ + 1)/2, and we characterize those trees achieving equality.     

Central extensions of current groups

 In this paper we study central extensions of the identity component G of the Lie group C ^∞ (M,K) of smooth maps from a compact manifold M into a Lie group K which might be infinite-dimensional. We restrict our attention to Lie algebra cocycles of the form ω(ξ,η)=[κ(ξ,dη)], where κ:𝔨×𝔨→Y is a symmetric invariant bilinear map on the Lie algebra 𝔨 of K and the values of ω lie in Ω¹(M,Y)/dC ^∞ (M,Y). For such cocycles we show that a corresponding central Lie group extension exists if and only if this is the case for M=𝕊¹. If K is finite-dimensional semisimple, this implies the existence of a universal central Lie group extension of G. The groups Diff(M) and C ^∞ (M,K) act naturally on G by automorphisms. We also show that these smooth actions can be lifted to smooth actions on the central extension if it also is a central extension of the universal covering group G˜ of G. Received: 11 April 2002 / Revised version: 28 August 2002 / Published online: 28 March 2003     

Invariant Palm and related disintegrations via skew factorization

Let G be a measurable group with Haar measure ??, acting properly on a space S and measurably on a space T. Then any ??-finite, jointly invariant measure M on S?× T admits a disintegration ${\nu \otimes \mu}$ into an invariant measure ?? on S and an invariant kernel ?? from S to T. Here we construct ?? and??? by a general skew factorization, which extends an approach by Rother and Z?hle for homogeneous spaces S over G. This leads to easy extensions of some classical propositions for invariant disintegration, previously known in the homogeneous case. The results are applied to the Palm measures of jointly stationary pairs (??, ??), where ?? is a random measure on S and ?? is a random element in T.     

Conjecture of Li and Praeger concerning the isomorphisms of Cayley graphs of A5

LetG be a finite group, andS a subset ofG \ |1| withS =S ⁻¹. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ Aut(G) such thatS ^α =T. Assume that m is a positive integer.G is called anm-Cl-group if every subsetS ofG withS =S ⁻¹ and | S | ≤m is Cl. In this paper we prove that the alternating groupA ₅ is a 4-Cl-group, which was a conjecture posed by Li and Praeger.     

Tail behavior of random sums under consistent variation with applications to the compound renewal risk model

In this paper, we consider the random sums of i.i.d. random variables ξ ₁,ξ ₂,... with consistent variation. Asymptotic behavior of the tail P(ξ₁ + ... + ξ_η > x), where η is independent of ξ ₁,ξ ₂,..., is obtained for different cases of the interrelationships between the tails of ξ ₁ and η. Applications to the asymptotic behavior of the finite-time ruin probability ψ(x,t) in a compound renewal risk model, earlier introduced by Tang et al. (Stat Probab Lett 52, 91–100 (2001)), are given. The asymptotic relations, as initial capital x increases, hold uniformly for t in a corresponding region. These asymptotic results are illustrated in several examples.      

Age-dependent branching processes in random environments

We consider an age-dependent branching process in random environments. The environments are represented by a stationary and ergodic sequence ξ = (ξ0,ξ1,...) of random variables. Given an environment ξ, the process is a non-homogenous Galton-Watson process, whose particles in n-th generation have a life length distribution G(ξn) on R , and reproduce independently new particles according to a probability law p(ξn) on N. Let Z(t) be the number of particles alive at time t. We first find a characterization of the conditional probability generating function of Z(t) (given the environment ξ) via a functional equation, and obtain a criterion for almost certain extinction of the process by comparing it with an embedded Galton-Watson process. We then get expressions of the conditional mean EξZ(t) and the global mean EZ(t), and show their exponential growth rates by studying a renewal equation in random environments.     

Dye’s theorem in the almost continuous category

Suppose X and Y are Polish spaces with non-atomic Borel probability measures μ and ν and suppose that T and S are ergodic measure-preserving homeomorphisms of (X, μ) and (Y, ν). Then there are invariant G _δ subsets X′ ⊂ X and Y′ ⊂ Y of full measure and a homeomorphism ϕ: X′ → Y′ which maps μ|X′ to ν|Y′ and maps T-orbits onto S-orbits. We also deal with the case where T and S preserve infinite invariant measures.     

Noded Teichmüller spaces

LetG be a finitely generated Kleinian group and let Δ be an invariant collection of components in its region of discontinuity. The Teichmüller spaceT(Δ,G) supported in Δ is the space of equivalence classes of quasiconformal homeomorphisms with complex dilatation invariant underG and supported in Δ. In this paper we propose a partial closure ofT(Δ,G) by considering certain deformations of the above hemeomorphisms. Such a partial closure is denoted byNT(Δ,G) and called thenoded Teichmüller space ofG supported in Δ. Some concrete examples are discussed. Partially supported by Projects Fondecyt 1030252, 1030373, 1040333, Projects UTFSM 12.05.21, 12.05.23 and by grant of the University of Bergen.     

Estimates for the closeness of successive convolutions of multidimensional symmetric distributions

Summary Let ξ₁, ξ₂,... be i.i.d random vectors in ℝ ^k with a common distribution ℒ(ξ_i),... = F, i = 1, 2,.... Let S _n = ξ₁+...+ξ _n . We investigate how small is the difference between ℒ(S _n ) and ℒ(S _{n+ m} ) in the case when ξ _i have symmetric distributions.     

Relative entropy and mixing properties of infinite dimensional diffusions

Summary. Let η be a diffusion process taking values on the infinite dimensional space T ^Z , where T is the circle, and with components satisfying the equations dη _i =σ _i (η) dW _i +b _i (η) dt for some coefficients σ _i and b _i , i∈Z. Suppose we have an initial distribution μ and a sequence of times t _n →∞ such that lim _{n →∞}μS _tn =ν exists, where S _t is the semi-group of the process. We prove that if σ _i and b _i are bounded, of finite range, have uniformly bounded second order partial derivatives, and inf _{i ,η}σ _i (η)>0, then ν is invariant. Received: 12 September 1996 / In revised form: 10 November 1997     

Graph-directed systems and self-similar measures on limit spaces of self-similar groups

Let G be a group and ?:H→G be a contracting homomorphism from a subgroup H<G of finite index. V. Nekrashevych (2005) [25] associated with the pair (G,?) the limit dynamical system (JG,s) and the limit G-space XG together with the covering _?g∈GT⋅g by the tile T. We develop the theory of self-similar measures m on these limit spaces. It is shown that (JG,s,m) is conjugated to the one-sided Bernoulli shift. Using sofic subshifts we prove that the tile T has integer measure and we give an algorithmic way to compute it. In addition we give an algorithm to find the measure of the intersection of tiles T∩(T⋅g) for g∈G. We present applications to the invariant measures for the rational functions on the Riemann sphere and to the evaluation of the Lebesgue measure of integral self-affine tiles.     

The Convexity Number of a Graph

 For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented. Received: August 19, 1998 Final version received: May 17, 2000     

Full Lutz twist along the binding of an open book

Let T denote a binding component of an open book (S, f){(\Sigma, \phi)} compatible with a closed contact 3-manifold (M, ξ). We describe an explicit open book (S￠, f￠){(\Sigma', \phi')} compatible with (M, ζ), where ζ is the contact structure obtained from ξ by performing a full Lutz twist along T. Here, (S￠, f￠){(\Sigma', \phi')} is obtained from (S, f){(\Sigma, \phi)} by a local modification near the binding.     

Closed Separator Sets

A smallest separator in a finite, simple, undirected graph G is a set S ⊆ V (G) such that G–S is disconnected and |S|=κ(G), where κ(G) denotes the connectivity of G. A set S of smallest separators in G is defined to be closed if for every pair S,T ∈ S, every component C of G–S, and every component S of G–T intersecting C either X(C,D) := (V (C) ∩ T) ∪ (T ∩ S) ∪ (S ∩ V (D)) is in S or |X(C,D)| > κ(G). This leads, canonically, to a closure system on the (closed) set of all smallest separators of G. A graph H with is defined to be S-augmenting if no member of S is a smallest separator in G ∪ H:=(V (G) ∪ V (H), E(G) ∪ E(H)). It is proved that if S is closed then every minimally S-augmenting graph is a forest, which generalizes a result of Jordán. Several applications are included, among them a generalization of a Theorem of Mader on disjoint fragments in critically k-connected graphs, a Theorem of Su on highly critically k-connected graphs, and an affirmative answer to a conjecture of Su on disjoint fragments in contraction critically k-connected graphs of maximal minimum degree.     

On amenable groups of automorphisms on Von Neumann algebras

LetG ⊂ Aut ℳ be a countable group, ℳ a Von Neumann algebra. LetE be a set of pure states on ℳ such thatG*E ⊂E, S ^G be the set ofG invariant states on ℳ andS _E ^G =S ^G ∩w* cl coE. We investigate in this paper some geometric properties for the setS _E ^G which turn out to be equivalent to amenability for the groupG. For example, we show thatS _E ^G ⊂ ℳ_* (S _E ^G has the WRNP) implies that ℳ contains minimal projections (ê containsfinite G invariant orbits) hold true, for all ℳ iffG is amenable. Furthermore we show that ifG is amenable thenS ^G ∩M _* ^⊥ contains a big set, thus improving results obtained by Ching Chou in [2]. These results imply that no action of an amenable countable groupG on an arbitraryW* algebra ℳ iss — strongly ergodic. Moreover cardS ^G ∩M _* ^⊥ ≧2 ^c (see M. Choda [4], K. Schmidt [21] and compare with A. Connes and B. Weiss [5]). The author gratefully acknowledges the support of an Izaak Walton Killam Memorial Senior Fellowship.     

Transient phenomena for random walks in the absence of the expected value of jumps

Let ξ, ξ₁, ξ₂, ... be independent identically distributed random variables, and S _n :=Σ _j=1 ⁿ ,ξ _j , $ \bar S $ \bar S := sup _n≥0 S _n . If Eξ = −a < 0 then we call transient those phenomena that happen to the distribution $ \bar S $ \bar S as a → 0 and $ \bar S $ \bar S tends to infinity in probability. We consider the case when Eξ fails to exist and study transient phenomena as a → 0 for the following two random walk models:

Statistical Problems Related to Irrational Rotations

Let be random variables as functions of β in the probability space [0,1) with the Lebesgue measure, where is considered to be an unknown parameter which we want to estimate from the observation ξ :=ξ₁, ξ₂...ξ _m . Let an observation ξ be given, which is a finite Sturmian sequence. We determine the likelihood function P _α(ξ) as a function of parameter α, and obtain the maximum likelihood estimator as the relative frequency of 1s in a minimal cycle of ξ, where a factor η of ξ is called a minimal cycle if ξ is a factor of η^∞ and η has the minimum length among them. We also obtain a minimum sufficient statistics. The sample mean (ξ₁ + ξ₂ + ... + ξ _m )/m which is an unbiased estimator of α is not admissible if m=6 or m ≥ 8 since it is not based on the minimum sufficient statistics.     

On Isomorphisms of Minimal Cayley Graphs and Digraphs

 A Cayley graph or digraph Cay(G,S) is called a CI-graph of G if, for any T⊂G, Cay(G,S)≅Cay(G,T) if and only if S ^σ=T for some σ∈Aut(G). The aim of this paper is to characterize finite abelian groups for which all minimal Cayley graphs and digraphs are CI-graphs. Received: February 13, 1998 Final version received: May 7, 1999     

Homeomorphic measures on stationary Bratteli diagrams

We study the set S of ergodic probability Borel measures on stationary non-simple Bratteli diagrams which are invariant with respect to the tail equivalence relation R. Equivalently, the set S is formed by ergodic probability measures invariant with respect to aperiodic substitution dynamical systems. The paper is devoted to the classification of measures μ from S with respect to a homeomorphism. The properties of the clopen values set S(μ) are studied. It is shown that for every measure μ∈S there exists a subgroup G⊂R such that S(μ)=G∩[0,1]. A criterion of goodness is proved for such measures. Based on this result, the measures from S are classified up to a homeomorphism. We prove that for every good measure μ∈S there exist countably many measures {μi}_i∈N⊂S such that the measures μ and μi are homeomorphic but the tail equivalence relations on the corresponding Bratteli diagrams are not orbit equivalent.