Metric Möbius geometry and a characterization of spheres

We obtain a Möbius characterization of the n-dimensional spheres S ⁿ endowed with the chordal metric d ₀. We show that every compact extended Ptolemy metric space with the property that every three points are contained in a circle is Möbius equivalent to (S ⁿ , d ₀) for some n ≥ 1.     

On the minimal positive homothetic image of a simplex containing a convex body

Let C be a convex body, and let S be a nondegenerate simplex in ? ⁿ . It is proved that the minimal coefficientσ > 0 for which the translate of σS contains C is $$\sum\limits_{j = 1}^{n + 1} {\mathop {\max \left( { - \lambda _j \left( x \right)} \right) + 1,}\limits_{x \in C} }$$ where λ ₁(x), ..., λ _n +1(x) are the barycentric coordinates of the point x ∈ ? ⁿ with respect to S. In the case C = [0, 1] ⁿ , this quantity is reduced to the form Σ _i=1 ⁿ 1/d _i (S), where d _i (S) is the ith axial diameter of S, i.e., the maximal length of the segment from S parallel to the ith coordinate axis.     

A law of the iterated logarithm for random walk in random scenery with deterministic normalizers

LetX, X _i ,i≥1, be a sequence of independent and identically distributed ? ^d -valued random vectors. LetS _o=0 and \(S_n = \sum\nolimits_{i = 1}^n {X_i } \) forn≤1. Furthermore letY, Y(α), α∈? ^d , be independent and identically distributed ?-valued random variables, which are independent of theX _i . Let \(Z_n = \sum\nolimits_{i = 0}^n {Y(S_i )} \) . We will call (Z _n ) arandom walk in random scenery. In this paper, we consider the law of the iterated logarithm for random walk in random scenery where deterministic normalizers are utilized. For example, we show that if (S _n ) is simple, symmetric random walk in the plane,E[Y]=0 andE[Y ²]=1, then $$\mathop {\overline {\lim } }\limits_{n \to \infty } \frac{{Z_n }}{{\sqrt {2n\log (n)\log (\log (n))} }} = \sqrt {\frac{2}{\pi }} a.s.$$      

On the supremum of some random Dirichlet polynomials

We study the average supremum of some random Dirichlet polynomials D _N (t) = Σ _n=1 ^N ? _n d(n)n ^?σ?it , where (? _n ) is a sequence of independent Rademacher random variables, the weights d(n) satisfy some reasonable conditions and 0 ≦ σ ≦ 1/2. We use an approach based on methods of stochastic processes, in particular the metric entropy method developed in [8].     

Weighted fractional Bernstein’s inequalities and their applications

This paper studies the weighted, fractional Bernstein inequality for spherical polynomials on S^d-1\(\left( {0.1} \right)\;{\left\| {{{\left( { - {\Delta _0}} \right)}^{{\raise0.7ex\hbox{$r$} \!\mathord{\left/ {\vphantom {r 2}}\right.\kern-\nulldelimiterspace}\!\lower0.7ex\hbox{$2$}}}}f} \right\|_{p,w}} \leqslant {C_w}{n^r}{\left\| f \right\|_{p,w}}\;for\;all\;f \in \Pi _n^d\), where Π_n^d denotes the space of all spherical polynomials of degree at most n on S^d-1 and (-Δ₀)^r/2 is the fractional Laplacian-Beltrami operator on S^d-1. A new class of doubling weights with conditions weaker than the A_p condition is introduced and used to characterize completely those doubling weights w on S^d-1 for which the weighted Bernstein inequality (0.1) holds for some 1 ≤ p ≤ 8 and all r > t. It is shown that in the unweighted case, if 0 < p < 8 and r > 0 is not an even integer, (0.1) with w = 1 holds if and only if r > (d - 1)((1/p) - 1). As applications, we show that every function f ∈ L_p(S^d-1) with 0 < p < 1 can be approximated by the de la Vallée Poussin means of a Fourier-Laplace series and establish a sharp Sobolev type embedding theorem for the weighted Besov spaces with respect to general doubling weights.     

Large deviations for functionals of stationary processes

Summary Let (S _n ) be a sequence ofR ^d -valued random variables adapted to the internal history of a stationary sequence of random elements (X _n ). We formulate conditions under which the principle of large deviations holds true for the sequence (S _n ).     

Circuits including a given set of vertices

Let G = (V, E) be a digraph of order n, satisfying Woodall's condition ? x, y ∈ V, if (x, y) ? E, then d⁺(x) + d^?(y) ≥ n. Let S be a subset of V of cardinality s. Then there exists a circuit including S and of length at most Min(n, 2s). In the case of oriented graphs we obtain the same result under the weaker condition d⁺(x) + d^?(y) ≥ n – 2 (which implies hamiltonism).     

The mean number of sites visited by a pinned random walk

This paper concerns the number Z _n of sites visited up to time n by a random walk S _n having zero mean and moving on the d-dimensional square lattice Z ^d . Asymptotic evaluation of the conditional expectation of Z _n given that S ₀ = 0 and S _n = x is carried out under 2 + δ moment conditions (0 ≤ δ ≤ 2) in the cases d = 2, 3. It gives an explicit form of the leading term and reasonable estimates of the remainder term (depending on δ) valid uniformly in each parabolic region of (x, n). In the case x = 0 the problem has been studied for the simple random walk and its analogue for Brownian motion; the estimates obtained here are finer than or comparable to those found in previous works. Supported in part by Monbukagakusho grand-in-aid no. 15540109.     

Asymptotic behaviour of iterated modified 401-1401-1401-1401-2401-2401-2transforms on some slowly convergent sequences

LetL(α, r) denote the class of complex sequences (x _n) having an asymptotic expansion of type $$x_n \sim \sum\limits_{i \ge 0} {c_i n^{ - (\alpha + ri)} } , c_0 \ne 0,\alpha > 0,r > 0.$$ We describe the asymptotic behaviour of sequences obtained by applying to (x _n) some specific modified versions of the iterated Δ² transform, the θ₂ transform and some combinations of them. In this paper, we study the particular casesr=1 andr=1/2, which are the most useful in practice. The results are also valid for sequences (S _n) whose error sequence (x _n) defined byx _n=S _n?S, S=limS _n, belongs to someL(α, r).     

Isomorphism of circulant graphs and digraphs

Let S? {1, …, n?1} satisfy ?S = S mod n. The circulant graph G(n, S) with vertex set {v₀, v₁,…, v_n?1} and edge set E satisfies v_iv_j?E if and only if j ? i ∈ S, where all arithmetic is done mod n. The circulant digraph G(n, S) is defined similarly without the restriction S = ? S. Ádám conjectured that $\text{G(n, S) ? G(n, S′)}$ if and only if S = uS′ for some unit u mod n. In this paper we prove the conjecture true if n = pq where p and q are distinct primes. We also show that it is not generally true when n = p², and determine exact conditions on S that it be true in this case. We then show as a simple consequence that the conjecture is false in most cases when n is divisible by p² where p is an odd prime, or n is divisible by 2⁴.     

Stochastic gradient algorithm with random truncations

Let f : R^d × R^d → R be a Borel-measurable function which satisfies ∫_R^d′|f(θ, x) < ∞, ∨θ ϵ R^d, where q₀(·) is a probability measure on (R^d′, B^d′). The problem of minimization of the function f₀(θ) = ∫_R^d′(θ, x)q₀(d), θ ϵ R^d, is considered for the case when the probability measure q₀(·) is unknown, but a realization of a non-stationary random process {X_n}_n⩾1 whose single probability measures in a certain sense tend to q₀(·), is available. The random process {X_n}_n⩾1 is defined on a common probability space, R^′-valued, correlated and satisfies certain uniform mix conditions. The function f(·, ·) is completely known. A stochastic gradient algorithm with random truncations is used for the minimization of f₀(·), and its almost sure convergence is proved.     

On the functional equationS(m,n)F[n/(m,n)] =F(n)h[n/(m,n)]

In this paper, we discuss the pairs (f, h) of arithmetical functions satisfying the functional equation in the title, whereF is the product off andh under the Dirichlet convolution; that is,F(n) = Σ _d|n ?(d)h(n/d) andS(m n) = Σd|(m, n) ?(d)h(n/d). The well-known Hölder's identity is a special case of this functional equation (?(n) =n, h(n) = μ(n)). We also generalize the functional equation in the title to any arbitrary regular arithmetical convolution and discuss the pairs of solutions (f, h) of the generalized functional equation and pose some problems relating to the characterization of all pairs of solutions.     

Compositions of linear-fractional transformations

We study the asymptotic behavior of the compositions (S_n o...o S₁)(z) and (S₁ o...o S_n)(z) of linear-fractional transformations S_n (z) (n=1,2,...) whose fixed points have limits. In particular, if S _n (z)=α _n (β _n +z)^-1, then the sequency of compositions (S₁o...o S_n)(z) at the point z=0 coincides with the sequence of convergents of the formal continued fraction $$\frac{{\alpha _1 }}{{\beta _1 + \frac{{\alpha _2 }}{{\beta _2 + \cdot \cdot \cdot }}}}.$$ The result obtained can be applied in the study of convergence of formal continued fractions.     

A central limit theorem for mixing stationary point processes

Suppose A₀ is a strictly stationary, second order point process on Z^d that is ?-mixing. The particles initially present are then continually subjected to random translations via random walks. If A_n is the point process resulting at time n, then we prove, under certain technical conditions, that the total occupation time by time n of a finite nonempty subset B of Z^d, namely, S_n(B)=Σⁿ_k=1A_k(B), is asymptotically normally distributed.     

On the Positive Definiteness of Certain Functions

For a coinmutative senugoup (S, +, *) with involution and a function f : S → [0, ∞), the set S(f) of those p ≥ 0 such that f^P is a positive definite function on S is a closed subsemigroup of [0, ∞) containing 0. For S = (IR, +, x* = -x) it may happen that S(f) = { kd : k ∈ N₀ } for some d > 0, and it may happen that S(f) = {0} ? [d, ∞) for some d > O. If α > 2 and if S = (?, +, n* = -n) and f(n) = e^?[n]α or S = (IN₀, +, n* = n) and f(n) = e^nα, then S(f) ∪ (0, c) = ? and [d, ∞) ? S(f) for some d ≥; c > 0. Although (with c maximal and d minimal) we have not been able to show c = d in all cases, this equality does hold if S = ? and α ≥ 3.4. In the last section we give sinipler proofs of previously known results concerning the positive definiteness of x → e^?||x||α on normed spaces.     

Extreme points, support points and the Loewner variation in several complex variables

In this paper we consider extreme points and support points for compact subclasses of normalized biholomorphic mappings of the Euclidean unit ball Bn in Cn. We consider the class S0(Bn) of biholomorphic mappings on Bn which have parametric representation, i.e., they are the initial elements f (·, 0) of a Loewner chain f (z, t) = etz + ··· such that {e-tf (·, t)}t 0 is a normal family on Bn. We show that if f (·, 0) is an extreme point (respectively a support point) of S0(Bn), then e-tf (·, t) is an extreme point of S0(Bn) for t 0 (respectively a support point of S0(Bn) for t ∈[0, t0] and some t0 > 0). This is a generalization to the n-dimensional case of work due to Pell. Also, we prove analogous results for mappings which belong to S0(Bn) and which are bounded in the norm by a fixed constant. We relate the study of this class to reachable sets in control theory generalizing work of Roth. Finally we consider extreme points and support points for biholomorphic mappings of Bn generated by using extension operators that preserve Loewner chains.     

A local limit theorem for random walks conditioned to stay positive

We consider a real random walk S_n=X₁+...+X_n attracted (without centering) to the normal law: this means that for a suitable norming sequence a_n we have the weak convergence S_n/a_n⇒ϕ(x)dx, ϕ(x) being the standard normal density. A local refinement of this convergence is provided by Gnedenko's and Stone's Local Limit Theorems, in the lattice and nonlattice case respectively. Now let denote the event (S₁>0,...,S_n>0) and let S_n⁺ denote the random variable S_n conditioned on : it is known that S_n⁺/a_n ↠ ϕ⁺(x) dx, where ϕ⁺(x):=x exp (−x²/2)1_(x≥0). What we establish in this paper is an equivalent of Gnedenko's and Stone's Local Limit Theorems for this weak convergence. We also consider the particular case when X₁ has an absolutely continuous law: in this case the uniform convergence of the density of S_n⁺/a_n towards ϕ⁺(x) holds under a standard additional hypothesis, in analogy to the classical case. We finally discuss an application of our main results to the asymptotic behavior of the joint renewal measure of the ladder variables process. Unlike the classical proofs of the LLT, we make no use of characteristic functions: our techniques are rather taken from the so–called Fluctuation Theory for random walks.     

Resolvability in circulant graphs

A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.     

Hole probability for entire functions represented by Gaussian Taylor series

Consider the Gaussian entire functionf(z) = ?? _n=0 ^?? ?? _n a _n z ⁿ , where {?? _n } is a sequence of independent and identically distributed standard complex Gaussians and {a _n } is some sequence of non-negative coefficients, with a ₀ > 0. We study the asymptotics (for large values of r) of the hole probability for f (z), that is, the probability P _H (r) that f(z) has no zeros in the disk {|z| < r}. We prove that log P _H (r) = ?S(r) + o(S(r)), where S(r) = 2·?? _n??0log⁺(a _n r ⁿ ) as r tends to ?? outside a deterministic exceptional set of finite logarithmic measure.