Ancestors and descendants in evolving k‐tree models

We consider several random graph models based on k‐trees, which can be generated by applying the probabilistic growth rules “uniform attachment”, “preferential attachment”, or a “saturation”‐rule, respectively, but which also can be described in a combinatorial way. For all of these models we study the number of ancestors and the number of descendants of nodes in the graph by carrying out a precise analysis which leads to exact and limiting distributional results. © 2014 Wiley Periodicals, Inc. Random Struct. Alg. 44, 465–489, 2014     

Deformation and rigidity results for the 2k‐Ricci tensor and the 2k‐Gauss‐Bonnet curvature

We present several deformation and rigidity results within the classes of closed Riemannian manifolds which either are 2k‐Einstein (in the sense that their 2k‐Ricci tensor is constant) or have constant 2k‐Gauss‐Bonnet curvature. The results hold for a family of manifolds containing all non‐flat space forms and the main ingredients in the proofs are explicit formulae for the linearizations of the above invariants obtained by means of the formalism of double forms.     

New characterizations of inhomogeneous Besov and Triebel-Lizorkin spaces over spaces of homogeneous type

In this paper we use the T1 theorem to prove a new characterization with minimum regularity and cancellation conditions for inhomogeneous Besov and Triebel-Lizorkin spaces over spaces of homogeneous type. These results are new even for R^n.     

Two‐sided error proximity oblivious testing

Loosely speaking, a proximity‐oblivious (property) tester is a randomized algorithm that makes a constant number of queries to a tested object and distinguishes objects that have a predetermined property from those that lack it. Specifically, for some threshold probability c, objects having the property are accepted with probability at least c, whereas objects that are ‐far from having the property are accepted with probability at most , where F: (0,1] → (0,1] is some fixed monotone function. (We stress that, in contrast to standard testers, a proximity‐oblivious tester is not given the proximity parameter.) The foregoing notion, introduced by Goldreich and Ron (STOC 2009), was originally defined with respect to c = 1, which corresponds to one‐sided error (proximity‐oblivious) testing. Here we study the two‐sided error version of proximity‐oblivious testers; that is, the (general) case of arbitrary c ? (0,1]. We show that, in many natural cases, two‐sided error proximity‐oblivious testers are more powerful than one‐sided error proximity‐oblivious testers; that is, many natural properties that have no one‐sided error proximity‐oblivious testers do have a two‐sided error proximity‐oblivious tester. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 48, 341–383, 2016     

Set Systems with L‐Intersections and k‐Wise L‐Intersecting Families

In this paper, by employing linear algebra methods we obtain the following main results:

• (i) Let and be two disjoint subsets of such that Suppose that is a family of subsets of such that for every pair and for every i. Then Furthermore, we extend this theorem to k‐wise L‐intersecting and obtain the corresponding result on two cross L‐intersecting families. These results show that Snevily's conjectures proposed by Snevily (2003) are true under some restricted conditions. This result also gets an improvement of a theorem of Liu and Hwang (2013).
• (ii) Let p be a prime and let and be two subsets of such that or and Suppose that is a family of subsets of [n] such that (1) for every pair (2) for every i. Then This result improves the existing upper bound substantially.

     

Non‐Abelian homomorphism testing,and distributions close to their self‐convolutions

In this paper, we study two questions related to the problem of testing whether a function is close to a homomorphism. For two finite groups G,H (not necessarily Abelian), an arbitrary map f : G,H, and a parameter 0 < ε < 1, say that f is ε‐close to a homomorphism if there is some homomorphism g such that g and f differ on at most ε | G | elements of G, and say that f is ε‐far otherwise. For a given f and ε, a homomorphism tester should distinguish whether f is a homomorphism, or if f is ε‐far from a homomorphism. When G is Abelian, it was known that the test which picks O(1/ε) random pairs x,y and tests that f(x) + f(y) = f(x + y) gives a homomorphism tester. Our first result shows that such a test works for all groups G. Next, we consider functions that are close to their self‐convolutions. Let A = {a_g | g ε G} be a distribution on G. The self‐convolution of A, A^′ = {a | g ε G}, is defined by It is known that A= A^′ exactly when A is the uniform distribution over a subgroup of G. We show that there is a sense in which this characterization is robust—that is, if A is close in statistical distance to A^′, then A must be close to uniform over some subgroup of G. Finally, we show a relationship between the question of testing whether a function is close to a homomorphism via the above test and the question of characterizing functions that are close to their self‐convolutions. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Local decoding and testing of polynomials over grids

We study the local decodability and (tolerant) local testability of low‐degree n‐variate polynomials over arbitrary fields, evaluated over the domain {0,1}ⁿ. We show that for every field there is a tolerant local test whose query complexity depends only on the degree. In contrast we show that decodability is possible over fields of positive characteristic, but not over the reals.     

On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph

The Erd?s‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that in many cases, this upper bound is sharp in the order of magnitude. Our result for the Erd?s‐Rényi graph has the following reformulation: the maximum size of a family of mutually non‐orthogonal lines in a vector space of dimension three over the finite field of order q is of order q^3/2. We also prove that every subset of vertices of size greater than q^2/2 + q^3/2 + O(q) in the Erd?s‐Rényi graph contains a triangle. This shows that an old construction of Parsons is asymptotically sharp. Several related results and open problems are provided. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 113–127, 2007     

A short proof of some recent results related to Cesàro function spaces

We give a short proof of the recent results that, for every 1≤p<∞$1\le p<\infty$, the Cesàro function space Ce_sp(I)$Ce{s}_p\left(I\right)$ is not a dual space, has the weak Banach–Saks property and does not have the Radon–Nikodym property.     

1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem

We consider k‐factorizations of the complete graph that are 1‐rotational under an assigned group G, namely that admit G as an automorphism group acting sharply transitively on all but one vertex. After proving that the k‐factors of such a factorization are pairwise isomorphic, we focus our attention to the special case of k = 2, a case in which we prove that the involutions of G necessarily form a unique conjugacy class. We completely characterize, in particular, the 2‐factorizations that are 1‐rotational under a dihedral group. Finally, we get infinite new classes of previously unknown solutions to the Oberwolfach problem via some direct and recursive constructions. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 87–100, 2008     

Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs

It is proved that for every positive integers k, r and s there exists an integer n = n(k,r,s) such that every k‐connected graph of order at least n contains either an induced path of length s or a subdivision of the complete bipartite graph K_k,r. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 270–274, 2004     

The block sphericity test—exact and near‐exact distributions for the likelihood ratio statistic

Using a suitable decomposition of the null hypothesis of the sphericity test for several blocks of variables, into a sequence of conditionally independent null hypotheses, we show that it is possible to obtain the expressions for the likelihood ratio test statistic, for its hth null moment, and for the characteristic function of its logarithm. The exact distribution of the logarithm of the likelihood ratio test statistic is obtained in the form of a sum of a generalized integer gamma distribution with the sum of a given number of independent logbeta distributions, taking the form of a single generalized integer gamma distribution when each set of variables has two variables. The development of near‐exact distributions arises, from the previous decomposition of the null hypothesis and from the consequent‐induced factorization of the characteristic function, as a natural and practical way to approximate the exact distribution of the test statistic. A measure based on the exact and approximating characteristic functions, which gives an upper bound on the distance between the corresponding distribution functions, is used to assess the quality of the near‐exact distributions proposed and to compare them with an asymptotic approximation on the basis of Box's method. Copyright © 2011 John Wiley & Sons, Ltd.     

Multiple positive fixed points for the sum of expansive mappings and k‐set contractions

In this work, we are concerned with the existence of multiple positive fixed points for the sum of an expansive mapping with constant h > 1 and a k‐set contraction when 0 ≤ k < h ? 1. In particular, the case of the sum of an expansive mapping with constant h > 1 and an e‐concave operator and an e‐convex operator is considered. Two examples of application illustrate some of the theoretical results.     

Existence and regularizing rate estimates of solutions to the 3‐D generalized micropolar system in Fourier‐Besov spaces

In this paper, we study global existence and asymptotic stability of solutions for the initial value problem of the three‐dimensional (3‐D) generalized incompressible micropolar system in Fourier‐Besov spaces. Besides, we also establish some regularizing rate estimates of the higher‐order spatial derivatives of solutions, which particularly imply the spatial analyticity and the temporal decay of global solutions.     

Nonexistence and existence results for a class of fourth‐order difference Dirichlet boundary value problems

This paper is concerned with a class of fourth‐order nonlinear difference equations. By using the critical point theory, we establish various sets of sufficient conditions of the nonexistence and existence of solutions for Dirichlet boundary value problems and give some new results. Our results successfully complement the existing ones. Copyright © 2014 John Wiley & Sons, Ltd.     

Bayesian‐type count data models with varying coefficients: estimation and testing in the presence of overdispersion

In this paper we study varying‐coefficient models for count data. A Bayesian approach is taken to model the variability of the regression parameters. Based on a Kalman filter procedure the varying coefficients are estimated as the mode of the posterior distribution. All hyperparameters, including an overdispersion parameter in the negative binomial varying‐coefficient model (NBVC), are estimated as ML‐estimators using an EM‐type algorithm. A bootstrapping test of the fixed‐coefficient hypothesis against a varying‐coefficient alternative is proposed, which is evaluated running a simulation study. The study shows that the choice of a suitable count data model is of special importance in the framework of varying‐coefficient models. The methodology is illustrated analysing the determinants of the number of individual doctor visits. Copyright © 2001 John Wiley & Sons, Ltd.     

On the generic behavior of the metric entropy, and related quantities,of uniformly continuous maps over Polish metric spaces

In this work, we show that if f is a uniformly continuous map defined over a Polish metric space, then the set of f-invariant measures with zero metric entropy is a $G_{\delta }$ set (in the weak topology). In particular, this set is generic if the set of f-periodic measures is dense in the set of f-invariant measures. This settles a conjecture posed by Sigmund (Trans. Amer. Math. Soc. 190 (1974), 285–299), which states that the metric entropy of an invariant measure of a topological dynamical system that satisfies the periodic specification property is typically zero. We also show that if X is compact and if f is an expansive or a Lipschitz map with a dense set of periodic measures, typically the lower correlation entropy for $q\in (0,1)$ is equal to zero. Moreover, we show that if X is a compact metric space and if f is an expanding map with a dense set of periodic measures, then the set of invariant measures with packing dimension, upper rate of recurrence and upper quantitative waiting time indicator equal to zero is residual.