Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs

Let γ(G) be the domination number of graph G, thus a graph G is k‐edge‐critical if γ (G) = k, and for every nonadjacent pair of vertices u and υ, γ(G + uυ) = k?1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjecture of E. Wojcicka under the form “3‐connected 4‐critical graphs are Hamiltonian and perhaps, in general (i.e., for any k ≥ 4), (k?1)‐connected, k‐edge‐critical graphs are Hamiltonian.” In this paper, we prove that the conjecture is not true for k = 4 by constructing a class of 3‐connected 4‐edge‐critical non‐Hamiltonian graphs. © 2005 Wiley Periodicals, Inc.     

Using self‐dissimilarity to quantify complexity

For many systems characterized as “complex” the patterns exhibited on different scales differ markedly from one another. For example, the biomass distribution in a human body “looks very different” depending on the scale at which one examines it. Conversely, the patterns at different scales in “simple” systems (e.g., gases, mountains, crystals) vary little from one scale to another. Accordingly, the degrees of self‐dissimilarity between the patterns of a system at various scales constitute a complexity “signature” of that system. Here we present a novel quantification of self‐dissimilarity. This signature can, if desired, incorporate a novel information‐theoretic measure of the distance between probability distributions that we derive here. Whatever distance measure is chosen, our quantification of self‐dissimilarity can be measured for many kinds of real‐world data. This allows comparisons of the complexity signatures of wholly different kinds of systems (e.g., systems involving information density in a digital computer vs. species densities in a rain forest vs. capital density in an economy, etc.). Moreover, in contrast to many other suggested complexity measures, evaluating the self‐dissimilarity of a system does not require one to already have a model of the system. These facts may allow self‐dissimilarity signatures to be used as the underlying observational variables of an eventual overarching theory relating all complex systems. To illustrate self‐dissimilarity, we present several numerical experiments. In particular, we show that the underlying structure of the logistic map is picked out by the self‐dissimilarity signature of time series produced by that map. © 2007 Wiley Periodicals, Inc. Complexity 12: 77–85, 2007     

New Solvable Variants of the Goldfish Many‐Body Problem

A technique to manufacture solvable variants of the “goldfish” many‐body problem is introduced, and several many‐body problems yielded by it are identified and discussed, including cases featuring multiperiodic or isochronous dynamics.     

An optimal family of exponentially accurate one‐bit Sigma‐Delta quantization schemes

Sigma‐delta modulation is a popular method for analog‐to‐digital conversion of bandlimited signals that employs coarse quantization coupled with oversampling. The standard mathematical model for the error analysis of the method measures the performance of a given scheme by the rate at which the associated reconstruction error decays as a function of the oversampling ratio λ. It was recently shown that exponential accuracy of the form O(2^−rλ) can be achieved by appropriate one‐bit sigma‐delta modulation schemes. By general information‐entropy arguments, r must be less than 1. The current best‐known value for r is approximately 0:088. The schemes that were designed to achieve this accuracy employ the “greedy” quantization rule coupled with feedback filters that fall into a class we call “minimally supported.” In this paper, we study the discrete minimization problem that corresponds to optimizing the error decay rate for this class of feedback filters. We solve a relaxed version of this problem exactly and provide explicit asymptotics of the solutions. From these relaxed solutions, we find asymptotically optimal solutions of the original problem, which improve the best‐known exponential error decay rate to r ≈ 0.102. Our method draws from the theory of orthogonal polynomials; in particular, it relates the optimal filters to the zero sets of Chebyshev polynomials of the second kind. © 2011 Wiley Periodicals, Inc.     

The computational complexity of two‐state spin systems

The subject of this article is spin‐systems as studied in statistical physics. We focus on the case of two spins. This case encompasses models of physical interest, such as the classical Ising model (ferromagnetic or antiferromagnetic, with or without an applied magnetic field) and the hard‐core gas model. There are three degrees of freedom, corresponding to our parameters β, γ, and μ. Informally, β represents the weights of edges joining pairs of “spin blue” sites, γ represents the weight of edges joining pairs of “spin green” sites, and μ represents the weight of “spin green” sites. We study the complexity of (approximately) computing the partition function in terms of these parameters. We pay special attention to the symmetric case μ = 1. Exact computation of the partition function Z is NP‐hard except in the trivial case βγ = 1, so we concentrate on the issue of whether Z can be computed within small relative error in polynomial time. We show that there is a fully polynomial randomised approximation scheme (FPRAS) for the partition function in the “ferromagnetic” region βγ ≥ 1, but (unless RP = NP) there is no FPRAS in the “antiferromagnetic” region corresponding to the square defined by 0 < β < 1 and 0 < γ < 1. Neither of these “natural” regions—neither the hyperbola nor the square—marks the boundary between tractable and intractable. In one direction, we provide an FPRAS for the partition function within a region which extends well away from the hyperbola. In the other direction, we exhibit two tiny, symmetric, intractable regions extending beyond the antiferromagnetic region. We also extend our results to the asymmetric case μ ≠ 1. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 133–154, 2003     

Nontopological N‐vortex condensates for the self‐dual Chern‐Simons theory

We prove the existence of nontopological N‐vortex solutions for an arbitrary number N of vortex points for the self‐dual Chern‐Simons‐Higgs theory with 't Hooft “periodic” boundary conditions. We use a shadowing‐type lemma to glue together any number of single vortices obtained as a perturbation of a radially symmetric entire solution of the Liouville equation. © 2003 Wiley Periodicals, Inc.     

POPULATION‐LEVEL ANALYSIS AND VALIDATION OF AN INDIVIDUAL‐BASED CUTTHROAT TROUT MODEL

ABSTRACT. An individual‐based model of stream trout is analyzed by testing its ability to reproduce patterns of population‐level behavior observed in real trout: (1) “self‐thinning,” a negative power relation between weight and abundance; (2) a “critical period” of density‐dependent mortality in young‐of‐the‐year; (3) high and age‐specific inter‐annual variability in abundance; (4) density dependence in growth; and (5) fewer large trout when pool habitat is eliminated. The trout model successfully reproduced these patterns and was useful for evaluating their theoretical basis. The model analyses produced new explanations for some field observations and indicated that some patterns are less general than field studies indicate. The model did not reproduce field‐observed patterns of population variability by age class, discrepancies potentially explained by site differences, predation mortality being more stochastic than the model assumes, or uncertainty in the field study's age estimates.     

The multipliers‐free domain decomposition methods

This article concludes the development and summarizes a new approach to dual‐primal domain decomposition methods (DDM), generally referred to as “the multipliers‐free dual‐primal method.” Contrary to standard approaches, these new dual‐primal methods are formulated without recourse to Lagrange‐multipliers. In this manner, simple and unified matrix‐expressions, which include the most important dual‐primal methods that exist at present are obtained, which can be effectively applied to floating subdomains, as well. The derivation of such general matrix‐formulas is independent of the partial differential equations that originate them and of the number of dimensions of the problem. This yields robust and easy‐to‐construct computer codes. In particular, 2D codes can be easily transformed into 3D codes. The systematic use of the average and jump matrices, which are introduced in this approach as generalizations of the “average” and “jump” of a function, can be effectively applied not only at internal‐boundary‐nodes but also at edges and corners. Their use yields significant advantages because of their superior algebraic and computational properties. Furthermore, it is shown that some well‐known difficulties that occur when primal nodes are introduced are efficiently handled by the multipliers‐free dual‐primal method. The concept of the Steklov–Poincaré operator for matrices is revised by our theory and a new version of it, which has clear advantages over standard definitions, is given. Extensive numerical experiments that confirm the efficiency of the multipliers‐free dual‐primal methods are also reported here. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Global existence and uniqueness of measure valued solutions to a Vlasov‐type equation with local alignment

We use a particle method to study a Vlasov‐type equation with local alignment, which was proposed by Sebastien Motsch and Eitan Tadmor [J. Statist. Phys., 141(2011), pp. 923‐947]. For N‐particle system, we study the unconditional flocking behavior for a weighted Motsch‐Tadmor model and a model with a “tail”. When N goes to infinity, global existence and stability (hence uniqueness) of measure valued solutions to the kinetic equation of this model are obtained. We also prove that measure valued solutions converge to a flock. The main tool we use in this paper is Monge‐Kantorovich‐Rubinstein distance.     

Nonlocal Tug‐of‐War and the Infinity Fractional Laplacian

Motivated by the “tug‐of‐war” game studied by Peres et al. in 2009, we consider a nonlocal version of the game that goes as follows: at every step two players pick, respectively, a direction and then, instead of flipping a coin in order to decide which direction to choose and then moving a fixed amount ϵ > 0 (as is done in the classical case), it is an s‐stable Levy process that chooses at the same time both the direction and the distance to travel. Starting from this game, we heuristically derive a deterministic nonlocal integrodifferential equation that we call the “infinity fractional Laplacian.” We study existence, uniqueness, and regularity, both for the Dirichlet problem and for a double‐obstacle problem, both problems having a natural interpretation as tug‐of‐war games. © 2011 Wiley Periodicals, Inc.     

On the structure of clique‐free graphs

Using a clever inductive counting argument Erd?s, Kleitman and Rothschild showed in 1976 that almost all triangle‐free graphs are bipartite, i.e., that the cardinality of the two graph classes is asymptotically equal. In this paper we investigate the structure of the “few” triangle‐free graphs which are not bipartite. As it turns out, with high probability, these graphs are bipartite up to a few vertices. More precisely, almost all of them can be made bipartite by removing just one vertex. Almost all others can be made bipartite by removing two vertices, and then three vertices and so on. We also show that similar results hold if we replace “triangle‐free” by K_??+1‐free and “bipartite” by ??‐partite. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 37–53, 2001     

Algebraization of the Three‐valued BCK‐logic

In this paper a definition of n‐valued system in the context of the algebraizable logics is proposed. We define and study the variety V₃, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three‐valued BCK‐logic”. As a consequence we find an axiomatic definition of the above system.     

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     

A perfect one‐factorization of K52

A starter derived even starter that induces a perfect one‐factorization of K₅₂ is presented. This is the smallest order for which a perfect one‐factorization was not previously known and is the first new “small” order for which a perfect one‐factorization has been found in nearly 20 years. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 190–196, 2009     

Perfect Graphs with No Balanced Skew‐Partition are 2‐Clique‐Colorable

A graph G is perfect if for all induced subgraphs H of G, . A graph G is Berge if neither G nor its complement contains an induced odd cycle of length at least five. The Strong Perfect Graph Theorem [9] states that a graph is perfect if and only if it is Berge. The Strong Perfect Graph Theorem was obtained as a consequence of a decomposition theorem for Berge graphs [M. Chudnovsky, Berge trigraphs and their applications, PhD thesis, Princeton University, 2003; M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Ann Math 164 (2006), 51–229.], and one of the decompositions in this decomposition theorem was the “balanced skew‐partition.” A clique‐coloring of a graph G is an assignment of colors to the vertices of G in such a way that no inclusion‐wise maximal clique of G of size at least two is monochromatic, and the clique‐chromatic number of G, denoted by , is the smallest number of colors needed to clique‐color G. There exist graphs of arbitrarily large clique‐chromatic number, but it is not known whether the clique‐chromatic number of perfect graphs is bounded. In this article, we prove that every perfect graph that does not admit a balanced skew‐partition is 2‐clique colorable. The main tool used in the proof is a decomposition theorem for “tame Berge trigraphs” due to Chudnovsky et al. ( http://arxiv.org/abs/1308.6444 ).     

The Effects of Project‐Based Learning on Students' Academic Achievement,Attitude, and Retention of Knowledge: The Subject of “Electricity in Our Lives”

The aim of this study is to analyze the effects of project‐based learning on students' academic achievement, attitude, and retention of knowledge in relation to the subject of “Electricity in Our Lives” in a fourth‐grade science course. The study was conducted in a quasi‐experimental design as a “pre‐test, post‐test with control group.” In the experimental group, the unit was taught through the project‐based learning method. The measuring tools were administered to both groups before and after the applications. To perfectly analyze the “process” of the method, seven different learning assessment “forms” were administered to the students. The findings of the forms indicated that the students learn to construct their own learning and to evaluate changes in their own behavior through the application of the method. The application of different methods between both groups had a statistically significant effect in terms of academic achievement, (F(1,112) = 46.78, p = .000) and of retention of knowledge (F(1,112) = 35.24, p = .000). However, there were no statistically significant effects from being in different groups for the attitudes of students (F(1,112) = .99, p = .321). For the students, being in the project‐based learning groups resulted in better academic achievement and retention of knowledge than being in the traditional teaching group.     

Agent‐based computational models and generative social science

This article argues that the agent‐based computational model permits a distinctive approach to social science for which the term “generative” is suitable. In defending this terminology, features distinguishing the approach from both “inductive” and “deductive” science are given. Then, the following specific contributions to social science are discussed: The agent‐based computational model is a new tool for empirical research. It offers a natural environment for the study of connectionist phenomena in social science. Agent‐based modeling provides a powerful way to address certain enduring—and especially interdisciplinary—questions. It allows one to subject certain core theories—such as neoclassical microeconomics—to important types of stress (e.g., the effect of evolving preferences). It permits one to study how rules of individual behavior give rise—or “map up”—to macroscopic regularities and organizations. In turn, one can employ laboratory behavioral research findings to select among competing agent‐based (“bottom up”) models. The agent‐based approach may well have the important effect of decoupling individual rationality from macroscopic equilibrium and of separating decision science from social science more generally. Agent‐based modeling offers powerful new forms of hybrid theoretical‐computational work; these are particularly relevant to the study of non‐equilibrium systems. The agent‐based approach invites the interpretation of society as a distributed computational device, and in turn the interpretation of social dynamics as a type of computation. This interpretation raises important foundational issues in social science—some related to intractability, and some to undecidability proper. Finally, since “emergence” figures prominently in this literature, I take up the connection between agent‐based modeling and classical emergentism, criticizing the latter and arguing that the two are incompatible. © 1999 John Wiley & Sons, Inc.     

Noise Prevents Collapse of Vlasov‐Poisson Point Charges

We elucidate the effect of noise on the dynamics of N point charges in a Vlasov‐Poisson model with a singular bounded interaction force. A too simple noise does not affect the structure inherited from the deterministic system and, in particular, cannot prevent coalescence of point charges. Inspired by the theory of random transport of passive scalars, we identify a class of random fields generating random pulses that are chaotic enough to disorganize the structure of the deterministic system and prevent any collapse of particles. We obtain the strong unique solvability of the stochastic model for any initial configuration of distinct point charges. In the case where there are exactly two particles, we implement the “vanishing noise method” for determining the continuation of the deterministic model after collapse. © 2014 Wiley Periodicals, Inc.     

A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut‐free logic

A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is developed. For the semantics presented CPQ is a paraconsistent logic, i.e. there are non‐trivial CPQ models in which some sentences are both true and false. Two systems of arithmetic minus induction are introduced, CL‐A and CPQ‐A based on CL and CPQ, respectively. The realisability theorem for CPQ‐A is proved: It is shown constructively that to each theorem A of CPQ‐A there is a formula A *, a so‐called “realised disjunctive form of A ”, such that variables bound by essentially existential quantifiers in A * can be written as recursive functions of free variables and variables bound by essentially universal quantifiers. Realisability is then applied to prove the consistency of CL‐A, making use of certain finite non‐trivial inconsistent models of CPQ‐A. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)