On Osgood theorem in Banach spaces

Let X be a real Banach space, ω : [0, +∞) → ? be an increasing continuous function such that ω(0) = 0 and ω(t + s) ≤ ω(t) + ω(s) for all t, s ∈ [0, +∞). According to the infinite dimensional analog of the Osgood theorem if ∫¹₀ (ω(t))^?1 dt = ∞, then for any (t₀, x₀) ∈ ?×X and any continuous map f : ?×X → X such that ∥f(t, x) – f(t, y)∥ ≤ ω(∥x – y∥) for all t ∈ ?, x, y ∈ X, the Cauchy problem (t) = f(t, x(t)), x(t₀) = x₀ has a unique solution in a neighborhood of t₀. We prove that if X has a complemented subspace with an unconditional Schauder basis and ∫¹₀ (ω(t))^?1 dt < ∞ then there exists a continuous map f : ? × X → X such that ∥f(t, x) – f(t, y)∥ ≤ ω(∥x – y∥) for all (t, x, y) ∈ ? × X × X and the Cauchy problem (t) = f(t, x(t)), x(t₀) = x₀ has no solutions in any interval of the real line.     

Graph diameter in long‐range percolation

We study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in ${\mathbb Z}^dWe study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in ${\mathbb Z}^d$. We focus on the cases when an edge between x and y is added with probability decaying with the Euclidean distance as |x ? y|^?s+o(1) when |x ? y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for the graph reduced to a box of side L scales like (log L)^Δ+o(1) where Δ^?1 := log₂(2d/s). In particular, the diameter grows about as fast as the typical graph distance between two vertices at distance L. We also show that a ball of radius r in the intrinsic metric on the (infinite) graph will roughly coincide with a ball of radius exp{r^1/Δ+o(1)} in the Euclidean metric. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 210‐227, 2011     

Zero product determined classical Lie algebras

We show that the Lie algebra ? of skew-symmetric matrices with respect to either transpose or symplectic involution is zero product determined. This means that every bilinear map {·,·} from ? × ? into a vector space X is of the form {x, y} = T ([x, y]) for some linear map T provided that the following condition is fulfilled: [x, y] = 0 implies {x, y} = 0.     

Spectra of Extended Double Cover Graphs

The construction of the extended double cover was introduced by N. Alon [1] in 1986. For a simple graph G with vertex set V = {v ₁, v ₂, ..., v _n }, the extended double cover of G, denoted G ^*, is the bipartite graph with bipartition (X, Y) where X = {x ₁, x ₂, ..., x _n } and Y = {y ₁, y ₂, ..., y _n }, in which x _i and y _j are adjacent iff i = j or v _i and v _j are adjacent in G.In this paper we obtain formulas for the characteristic polynomial and the spectrum of G ^* in terms of the corresponding information of G. Three formulas are derived for the number of spanning trees in G ^* for a connected regular graph G. We show that while the extended double covers of cospectral graphs are cospectral, the converse does not hold. Some results on the spectra of the nth iterared double cover are also presented.     

Diameters of finite upper half plane graphs

Let GF(q) be a finite field of q elements. Let G denote the group of matrices M(x, y) = (^{y x}_{0 1}) over GF(q) with y ≠ 0. Fix an irreducible polynomial For each a ϵ GF(q), let X_a be the graph whose vertices are the q² − q elements of G, with two vertices M(x, y), M(v, w) joined by an edge if and only if The graphs X_a with a ϵ/ {0, t² − 4n} are (q + 1)-regular connected graphs which have received recent attention, as they've been shown to be Ramanujan graphs. We determine the diameter of these graphs X_a. © 1996 John Wiley & Sons, Inc.     

Maximum hitting time for random walks on graphs

For x and y vertices of a connected graph G, let T_G(x, y) denote the expected time before a random walk starting from x reaches y. We determine, for each n > 0, the n-vertex graph G and vertices x and y for which T_G(x, y) is maximized. the extremal graph consists of a clique on ?(2n + 1)/3?) (or ?)(2_n ? 2)/3?) vertices, including x, to which a path on the remaining vertices, ending in y, has been attached; the expected time T_G(x, y) to reach y from x in this graph is approximately 4_n³/27.     

A note on Cayley graphs

An example is given of a finite group A of order 144, with a generating set X = {x, y} such that x³ = y² = 1 and such that the Cayley graph C(A, X) has genus 4 and characteristic −6 (both of which are small relative to the order of A), although there is no short relator of the form (xy)^r with r < 12 or of the form [x, y]^r with r < 6. Accordingly this and other possible examples do not fit into a pattern suggested by [5.], 244–268).     

Almost-sure central limit theorem for a Markov model of random walk in dynamical random environment

Summary We consider a model of random walk on ℤ^ν, ν≥2, in a dynamical random environment described by a field ξ={ξ _t (x): (t,x)∈ℤ^ν+1}. The random walk transition probabilities are taken as P(X _{t +1}= y|X _t = x,ξ _t =η) =P ₀( y−x)+ c(y−x;η(x)). We assume that the variables {ξ _t (x):(t,x) ∈ℤ^ν+1} are i.i.d., that both P ₀(u) and c(u;s) are finite range in u, and that the random term c(u;·) is small and with zero average. We prove that the C.L.T. holds almost-surely, with the same parameters as for P ₀, for all ν≥2. For ν≥3 there is a finite random (i.e., dependent on ξ) correction to the average of X _t , and there is a corresponding random correction of order to the C.L.T.. For ν≥5 there is a finite random correction to the covariance matrix of X _t and a corresponding correction of order to the C.L.T.. Proofs are based on some new L ^p estimates for a class of functionals of the field. Received: 4 January 1996/In revised form: 26 May 1997     

On a multiplicative functional transformation arising in nonlinear filtering theory

Summary This paper concerns the nonlinear filtering problem of calculating estimates E[f(x_t)¦y _s, st] where {x _t} is a Markov process with infinitesimal generator A and {y _t} is an observation process given by dy _t=h(x_t)dt +dw_twhere {w _t} is a Brownian motion. If h(x_t) is a semimartingale then an unnormalized version of this estimate can be expressed in terms of a semigroup T _s,t ^y obtained by a certain y-dependent multiplicative functional transformation of the signal process {x _t}. The objective of this paper is to investigate this transformation and in particular to show that under very general conditions its extended generator is A _t ^y f=e^y(t)h(A– 1/2h²)(e^–y(t)h f).Work partially supported by the U.S. Department of Energy (Contract ET-76-C-01-2295) at the Massachusetts Institute of Technology     

On the existence of certain measures appearing in distance geometry

Abstract. We prove the following result: Let X be a compact connected Hausdorff space and f be a continuous function on X x X. There exists some regular Borel probability measure m\mu on X such that the value of¶¶ ò\limit _X f(x,y)dm(y)\int\limit _X f(x,y)d\mu (y) is independent of the choice of x in X if and only if the following assertion holds: For each positive integer n and for all (not necessarily distinct) x₁,x₂,...,x_n,y₁,y₂,...,y_n in X, there exists an x in X such that¶¶ ?_i=1ⁿ f(x_i,x)=?_i=1ⁿ f(y_i,x).\sum\limits _{i=1}^n f(x_i,x)=\sum\limits _{i=1}^n f(y_i,x).     

RETRACTED ARTICLE: Some applications of BP-theorem in approximation theory

In this paper we apply Bishop-Phelps property to show that if X is a Banach space and G X is the maximal subspace so that G⊥ = {x* ∈ X*|x*(y) = 0; y∈ G} is an L-summand in X*, then L1(Ω,G) is contained in a maximal proximinal subspace of L1(Ω,X).     

Characterizations of generalized quadrangles by generalized homologies

Let S = (P, B, I) be a generalized quadrangle of order (s, t). For x, y P, x y, let (x, y) be the group of all collineations of S fixing x and y linewise. If z {x, y}, then the set of all points incident with the line xz (resp. yz) is denoted by (resp. ). The generalized quadrangle S = (P, B, I) is said to be (x, y)-transitive, x y, if (x, y) is transitive on each set and . If S = (P, B, I) is a generalized quadrangle of order (s, t), s > 1 and t > 1, which is (x, y)-transitive for all x, y P with x y, then it is proved that we have one of the following: (i) S W(s), (ii) S Q(4, s), (iii) S H(4, s), (iv) S Q(5, s), (v) s = t² and all points are regular.     

Some path properties of generalized Lévy sheet

Let X(t) be an N parameter generalized Lévy sheet taking values in ℝ^d with a lower index α, ℜ = {(s, t] = ∏ _i=1 ^N (s _i, t _i], s _i < t _i}, E(x, Q) = {t ∈ Q: X(t) = x}, Q ∈ ℜ be the level set of X at x and X(Q) = {x: ∃t ∈ Q such that X(t) = x} be the image of X on Q. In this paper, the problems of the existence and increment size of the local times for X(t) are studied. In addition, the Hausdorff dimension of E(x, Q) and the upper bound of a uniform dimension for X(Q) are also established.     

On the structure of cluster point sets of iteratively generated sequences

LetX be a closed subset of a topological spaceF; leta(·) be a continuous map fromX intoX; let {x _i} be a sequence generated iteratively bya(·) fromx ₀ inX, i.e.,x _i+1 =a(x _i),i=0, 1, 2, ...; and letQ(x ₀) be the cluster point set of {x _i}. In this paper, we prove that, if there exists a pointz inQ(x ₀) such that (i)z is isolated with respect toQ(x ₀), (ii)z is a periodic point ofa(·) of periodp, and (iii)z possesses a sequentially compact neighborhood, then (iv)Q(x ₀) containsp points, (v) the sequence {x _i} is contained in a sequentially compact set, and (vi) every point inQ(x ₀) possesses properties (i) and (ii). The application of the preceding results to the caseF=E ⁿ leads to the following: (vii) ifQ(x ₀) contains one and only one point, then {x _i} converges; (viii) ifQ(x ₀) contains a finite number of points, then {x _i} is bounded; and (ix) ifQ(x ₀) containsp points, then every point inQ(x ₀) is a periodic point ofa(·) of periodp.     

On the average distance property and certain energy integrals

One of our main results is the following: LetX be a compact connected subset of the Euclidean spaceR ⁿ andr(X, d ₂) the rendezvous number ofX, whered ₂ denotes the Euclidean distance inR ⁿ . (The rendezvous numberr(X, d ₂) is the unique positive real number with the property that for each positive integern and for all (not necessarily distinct)x ₁,x ₂,...,x _n inX, there exists somex inX such that .) Then there exists some regular Borel probability measure μ₀ onX such that the value of ∫ _X d ₂(x, y)dμ₀ (y) is independent of the choicex inX, if and only ifr(X, d ₂) = sup_μ ∫ _X ∫ _X d ₂(x, y)dμ(x)dμ(y), where the supremum is taken over all regular Borel probability measures μ onX.     

Two-Parameter Lévy Processes Along Decreasing Paths

Let {X_t1,t2:t₁,t₂ 3 0}\{X_{t_{1},t_{2}}:t_{1},t_{2}\geq0\} be a two-parameter Lévy process on ℝ ^d . We study basic properties of the one-parameter process {X _x(t),y(t):t∈T} where x and y are, respectively, nondecreasing and nonincreasing nonnegative continuous functions on the interval T. We focus on and characterize the case where the process has stationary increments.     

Applications of utility functions defined on quasi-metric spaces

A quasi-metric space (X,d) is called sup-separable if (X,d^s) is a separable metric space, where d^s(x,y)=max{d(x,y),d(y,x)} for all x,y∈X. We characterize those preferences, defined on a sup-separable quasi-metric space, for which there is a semi-Lipschitz utility function. We deduce from our results that several interesting examples of quasi-metric spaces which appear in different fields of theoretical computer science admit semi-Lipschitz utility functions. We also apply our methods to the study of certain kinds of dynamical systems defined on quasi-metric spaces.     

Weak-Geodetically Closed Subgraphs in Distance-Regular Graphs

 Let Γ=(X,R) denote a distance-regular graph with diameter D≥2 and distance function δ. A (vertex) subgraph Ω⊆X is said to be weak-geodetically closed whenever for all x,y∈Ω and all z∈X,

The Pointwise Densities of the Cantor Measure

Let be the classical middle-third Cantor set and let μ be the Cantor measure. Set s = log 2/log 3. We will determine by an explicit formula for every point x the upper and lower s-densities Θ*^s(μ , x), Θ*^s(μ , x) of the Cantor measure at the point x, in terms of the 3-adic expansion of x. We show that there exists a countable set F such that 9(Θ*^s(μ , x))^{− 1/s} + (Θ*^s(μ , x))^{− 1/s} = 16 holds for x \F. Furthermore, for μ_C almost all x, Θ*^s(μ , X) − 2 · 4^{− s} and Θ*^s(μ , x) = 4^{− s}. As an application, we will show that the s-dimensional packing measure of the middle-third Cantor set is 4^s.