Every minor-closed property of sparse graphs is testable

Suppose G is a graph of bounded degree d, and one needs to remove ?n of its edges in order to make it planar. We show that in this case the statistics of local neighborhoods around vertices of G is far from the statistics of local neighborhoods around vertices of any planar graph G^′. In fact, a similar result is proved for any minor-closed property of bounded degree graphs.The main motivation of the above result comes from theoretical computer-science. Using our main result we infer that for any minor-closed property P, there is a constant time algorithm for detecting if a graph is “far” from satisfying P. This, in particular, answers an open problem of Goldreich and Ron [STOC 1997] [20], who asked if such an algorithm exists when P is the graph property of being planar. The proof combines results from the theory of graph minors with results on convergent sequences of sparse graphs, which rely on martingale arguments.     

Modeling stock index returns by means of partial least‐squares methods: An out‐of‐sample analysis for three stock markets

We analyze the underlying economic forces of the stock markets in Germany, the U.K. and the U.S. Identifying a number of variables evincing return predictability, we follow a partial least‐squares (PLS) approach to combine these observables into a few latent factors. Conditional on European markets, our findings indicate (i) superior prediction performance of PLS‐based schemes in comparison with both, a random walk and a first‐order autoregressive benchmark model, (ii) consistent profitable trading on the German and British market, (iii) profitable linear forecast combinations, (iv) the U.S. stock market is diagnosed as informationally efficient. Copyright © 2010 John Wiley & Sons, Ltd.     

A characterization of the logistic distribution by a sample median

Summary A functional form of the characteristic function of the sample median of three variates is shown to characterize the logistic distribution. A consequence of this is a characterization of the logistic in terms of the Laplace distribution. Research sponsored in part by the Air Force Office of Scientific Research, Air Force Systems Command, USAF under Grant No. AFOSR-77-3360. The United States Govenment is authorized to reproduce and distribute reprints for governmental purposes notwith-standing any copyright notation hereon.     

On sample path properties of semistable processes

This paper contains three main results: In the first result a correspondence principle between semistable measures on L_p, 1 ≤ p < ∞, and Banach space valued semistable processes is established. In the second result it is shown that the paths of a Banach space valued semistable process belong to L_p with probability zero or one, and necessary and sufficient conditions for the two alternatives to hold are given. In the third result necessary and sufficient conditions are given for almost sure path absolute continuity for certain Banach space valued semistable processes.     

Optimal cyclic quaternary constant‐weight codes of weight three

A cyclic code is a cyclic q‐ary code of length n, constant weight w and minimum distance d. Let denote the largest possible size of a cyclic code. The pure and mixed difference method plays an important role in the determination of upper bound on . By analyzing the distribution of odd mixed and pure differences, an improved upper bound on is obtained for . A new construction based on special sequences is provided and the exact value of is almost completely determined for all d and n except when and . Our constructions reveal intimate connections between cyclic constant weight codes and special sequences, particularly Skolem‐type sequences.     

A unified framework for testing linear‐invariant properties

In the study of property testing, a particularly important role has been played by linear invariant properties, i.e., properties of Boolean functions on the hypercube which are closed under linear transformations of the domain. Examples of such properties include linearity, Reed‐Muller codes, and Fourier sparsity. In this work, we describe a framework that can lead to a unified analysis of the testability of all linear‐invariant properties, drawing on techniques from additive combinatorics and from graph theory. Our main contributions here are the following:

相似文献   

On the properties of small sample of GM(1,1) model

In grey prediction modeling, the more samples selected the more errors. This paper puts forward new explanations of “incomplete information and small sample” of grey systems and expands the suitable range of grey system theory. Based on the geometric sequence, it probes into the influence on the relative errors by selecting the different sample sizes. The research results indicate that to the non-negative increasing monotonous exponential sequence, the more samples selected, the more average relative errors. To the non-negative decreasing monotonous exponential sequence, a proper sample number exists that has the least average relative error. When the initial value of the sequence of raw data of new information GM(1,1) model changes, the development coefficient remains unchanged. The segmental correction new information GM(1,1) model (SNGM) can obviously improve the simulation accuracy. It puts forward the mathematic proofs that the small sample usually has more accuracy than the large sample when establishing GM(1,1) model in theory.     

Q‐symmetry and conditional Q‐symmetries for Drinfel'd–Sokolov–Wilson system

We study in this paper the Q‐symmetry and conditional Q‐symmetries of Drinfel'd–Sokolov–Wilson equations. The solutions which we obtain in this paper take the form of convergent power series with easily computable components. Copyright © 2014 John Wiley & Sons, Ltd.     

Lorenz‐gauged vector potential formulations for the time‐harmonic eddy‐current problem with L∞‐regularity of material properties

In this paper, we consider some Lorenz‐gauged vector potential formulations of the eddy‐current problem for the time‐harmonic Maxwell equations with material properties having only L^∞‐regularity. We prove that there exists a unique solution of these problems, and we show the convergence of a suitable finite element approximation scheme. Moreover, we show that some previously proposed Lorenz‐gauged formulations are indeed formulations in terms of the modified magnetic vector potential, for which the electric scalar potential is vanishing. Copyright © 2007 John Wiley & Sons, Ltd.     

Complexity of clique‐coloring odd‐hole‐free graphs

In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, but on the other hand it is NP‐hard to decide if they are 2‐clique‐colorable, and we do not know if there exists any bound k₀ such that they are all k₀ ‐clique‐colorable. First we will prove that (odd hole, codiamond)‐free graphs are 2‐clique‐colorable. Then we will demonstrate that the complexity of 2‐clique‐coloring odd‐hole‐free graphs is actually Σ₂ P‐complete. Finally we will study the complexity of deciding whether or not a graph and all its subgraphs are 2‐clique‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 139–156, 2009     

Bayesian optimal life‐testing plan under the balanced two sample type‐II progressive censoring scheme

Joint progressive censoring schemes are quite useful to conduct comparative life‐testing experiment of different competing products. Recently, Mondal and Kundu (“A New Two Sample Type‐II Progressive Censoring Scheme,” Commun Stat‐Theory Methods; 2018) introduced a joint progressive censoring scheme on two samples known as the balanced joint progressive censoring (BJPC) scheme. Optimal planning of such progressive censoring scheme is an important issue to the experimenter. This article considers optimal life‐testing plan under the BJPC scheme using the Bayesian precision and D‐optimality criteria, assuming that the lifetimes follow Weibull distribution. In order to obtain the optimal BJPC life‐testing plans, one needs to carry out an exhaustive search within the set of all admissible plans under the BJPC scheme. However, for large sample size, determination of the optimal life‐testing plan is difficult by exhaustive search technique. A metaheuristic algorithm based on the variable neighborhood search method is employed for computation of the optimal life‐testing plan. Optimal plans are provided under different scenarios. The optimal plans depend upon the values of the hyperparameters of the prior distribution. The effect of different prior information on optimal scheme is studied.     

Wilcoxon‐type rank‐sum statistics for selecting the best population: Some advances

In this article, we introduce three new nonparametric procedures for testing the equality of two lifetime distributions. The proposed testing processes are based on appropriately modified Wilcoxon‐type rank‐sum statistics. The exact null distribution of these statistics is studied and closed formulae for the corresponding exact probability of correct selection of the best population are derived for the class of Lehmann alternatives. A detailed numerical study is carried out to elucidate the performance of the proposed testing schemes. For illustration purposes, a real data application is presented in some detail.     

Life‐like self‐reproducers

In order to understand the interplay among information, genetic instructions, and phenotypic variations, self‐reproducers discovered in two‐dimensional cellular automata are considered as proto‐organisms, which undergo to mutations as they were in a real environmental situation. We realized a computational model through which we have been able to discover the genetic map of the self‐reproducers and the networks they use. Identifying in these maps sets of different functional genes, we found that mutations in the genetic sequences could affect both external shapes and behavior of the self‐reproducers, thus realizing different life‐like strategies in the evolution process. The results highlight that some strategies evolution uses in selecting organisms that are fitting with changing environmental situations maintain the self‐reproducing function, whereas other variations create new self‐reproducers. These self‐reproducers in turn realize different genetic networks, which can be very different from the basic ancestors pools. The mutations that are disruptive bring self‐reproducers to disappear, while other proto‐organisms are generated. © 2004 Wiley Periodicals, Inc. Complexity 9: 38–55, 2004     

On the average‐case complexity of Shellsort

We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new results, for example, determining the average‐case complexity precisely in the Yao‐Janson‐Knuth 3‐pass case.     

A note on the largest eigenvalue of a large dimensional sample covariance matrix

Let {v_ij; i, J = 1, 2, …} be a family of i.i.d. random variables with E(v₁₁⁴) = ∞. For positive integers p, n with p = p(n) and p/n → y > 0 as n → ∞, let M_n = (1/n) V_n V_n^T , where V_n = (v_ij)_{1 ≤ i ≤ p, 1 ≤ j ≤ n}, and let λ_max(n) denote the largest eigenvalue of M_n. It is shown that a.s. This result verifies the boundedness of E(v₁₁⁴) to be the weakest condition known to assure the almost sure convergence of λ_max(n) for a class of sample covariance matrices.     

A new symmetry approach to solve space–time‐dependent KdV systems

In this paper, a new method to solve space–time‐dependent non‐linear equations is proposed. After considering the variable coefficient of a non‐linear equation as a new dependent variable, some special types of space–time‐dependent equations can be solved from corresponding space–time‐independent equations by using the general classical Lie approach. The rich soliton solutions of space–time‐dependent KdV equation and mKdV equation are given with the help of the approach. Copyright © 2004 John Wiley & Sons, Ltd.     

A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems

A recent work of Shi (Numer. Linear Algebra Appl. 2002; 9 : 195–203) proposed a hybrid algorithm which combines a primal‐dual potential reduction algorithm with the use of the steepest descent direction of the potential function. The complexity of the potential reduction algorithm remains valid but the overall computational cost can be reduced. In this paper, we make efforts to further reduce the computational costs. We notice that in order to obtain the steepest descent direction of the potential function, the Hessian matrix of second order partial derivatives of the objective function needs to be computed. To avoid this, we in this paper propose another hybrid algorithm which uses a projected steepest descent direction of the objective function instead of the steepest descent direction of the potential function. The complexity of the original potential reduction algorithm still remains valid but the overall computational cost is further reduced. Our numerical experiments are also reported. Copyright © 2004 John Wiley & Sons, Ltd.     

A large deviation principle for bootstrapped sample means

A large deviation principle for bootstrapped sample means is established. It relies on the Bolthausen large deviation principle for sums of i.i.d. Banach space valued random variables. The rate function of the large deviation principle for bootstrapped sample means is the same as the classical one.

     

An analysis of the fourth‐order PDEs – ‘patterns’ and ‘di‐block polymers’

We analyze some fourth‐order partial differential equations that model the ‘propagation of hexagonal patterns’ and the ‘microphase separation of di‐block copolymers’. The underlying invariance properties and conservation laws of the models and related partial differential equations are studied. Copyright © 2017 John Wiley & Sons, Ltd.     

A new polynomial sequence as a guide to numerical solutions for applied‐physics‐related partial differential equations under Dirichlet‐Newman‐type exogenous boundary conditions

In this article, a new set of polynomials is proposed as a new tool for solving bivaried partial differential equation related with some appropriated applied physics problems. A concrete formulation of canonical expressions, with respect to more common boundary conditions, is yielded out of the recently established Boubaker polynomials. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009