A deterministic‐control‐based approach motion by curvature

The level‐set formulation of motion by mean curvature is a degenerate parabolic equation. We show that its solution can be interpreted as the value function of a deterministic two‐person game. More precisely, we give a family of discrete‐time, two‐person games whose value functions converge in the continuous‐time limit to the solution of the motion‐by‐curvature PDE. For a convex domain, the boundary's “first arrival time” solves a degenerate elliptic equation; this corresponds, in our game‐theoretic setting, to a minimum‐exit‐time problem. For a nonconvex domain the two‐person game still makes sense; we draw a connection between its minimum exit time and the evolution of curves with velocity equal to the “positive part of the curvature.” These results are unexpected, because the value function of a deterministic control problem is normally the solution of a first‐order Hamilton‐Jacobi equation. Our situation is different because the usual first‐order calculation is singular. © 2005 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     

A critical Kirchhoff‐type problem involving the ‐Laplacian

In this paper we provide an existence result for a nonlocal problem of Kirchhoff‐type which involves both the p‐ and the q‐Laplacian and contains a critical term. Our approach is variational: we derive the existence of one non‐trivial solution via the multidimensional mountain pass theorem.     

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.     

A reduced theory for thin‐film micromagnetics

Micromagnetics is a nonlocal, nonconvex variational problem. Its minimizer represents the ground‐state magnetization pattern of a ferromagnetic body under a specified external field. This paper identifies a physically relevant thin‐film limit and shows that the limiting behavior is described by a certain “reduced” variational problem. Our main result is the Γ‐convergence of suitably scaled three‐dimensional micromagnetic problems to a two‐dimensional reduced problem; this implies, in particular, convergence of minimizers for any value of the external field. The reduced problem is degenerate but convex; as a result, it determines some (but not all) features of the ground‐state magnetization pattern in the associated thin‐film limit. © 2002 Wiley Periodicals, Inc.     

Homogenization and Enhancement of the G‐Equation in Random Environments

We study the homogenization of a G‐equation that is advected by a divergence free “small mean” stationary vector field in a general ergodic random environment. We prove that the averaged equation is an anisotropic deterministic G‐equation, and we give necessary and sufficient conditions for enhancement. Since the problem is not assumed to be coercive, it is not possible to have uniform bounds for the solutions. In addition, as we show, the associated minimal (first passage) time function does not satisfy, in general, the uniform integrability condition that is necessary to apply the subadditive ergodic theorem. We overcome these obstacles by (i) establishing a new reachability (controllability) estimate for the minimal function and (ii) constructing, for each direction and almost surely, a random sequence that has both a long‐time averaged limit (due to the subadditive ergodic theorem) and stays asymptotically close to the minimal time. © 2013 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     

Initial conditions for the cylindrical Korteweg‐de Vries equation

In this paper, we find suitable initial conditions for the cylindrical Korteweg‐de Vries equation by first solving exactly the initial‐value problem for localized solutions of the underlying axisymmetric linear long‐wave equation. The far‐field limit of the solution of this linear problem then provides, through matching, an initial condition for the cylindrical Korteweg‐de Vries equation. This initial condition is associated only with the leading wave front of the far‐field limit of the linear solution. The main motivation is to resolve the discrepancy between the exact mass conservation law, and the “mass” conservation law for the cylindrical Korteweg‐de Vries equation. The outcome is that in the linear initial‐value problem all the mass is carried behind the wave front, and then the “mass” in the initial condition for the cylindrical Korteweg‐de Vries equation is zero. Hence, the evolving solution in the cylindrical Korteweg‐de Vries equation has zero “mass.” This situation arises because, unlike the well‐known unidirectional Korteweg‐de Vries equation, the solution of the initial‐value problem for the axisymmetric linear long‐wave problem contains both outgoing and ingoing waves, but in the cylindrical geometry, the latter are reflected at the origin into outgoing waves, and eventually the total outgoing solution is a combination of these and those initially generated.     

Rational and semi‐rational solutions of a nonlocal (2 + 1)‐dimensional nonlinear Schrödinger equation

We consider the fully parity‐time (PT) symmetric nonlocal (2 + 1)‐dimensional nonlinear Schrödinger (NLS) equation with respect to x and y. By using Hirota's bilinear method, we derive the N‐soliton solutions of the nonlocal NLS equation. By using the resulting N‐soliton solutions and employing long wave limit method, we derive its nonsingular rational solutions and semi‐rational solutions. The rational solutions act as the line rogue waves. The semi‐rational solutions mean different types of combinations in rogue waves, breathers, and periodic line waves. Furthermore, in order to easily understand the dynamic behaviors of the nonlocal NLS equation, we display some graphics to analyze the characteristics of these solutions.     

Analyzing Risky Choices: Q‐learning for Deal‐No‐Deal

In this paper, we derive an optimal strategy for the popular Deal or No Deal game show. To do this, we use Q‐learning methods, which quantify the continuation value inherent in sequential decision making in the game. We then analyze two contestants, Frank and Susanne, risky choices from the European version of the game. Given their choices and our optimal strategy, we find what their implied bounds would be on their levels of risk aversion. Previous empirical evidence in risky decision making has suggested that past outcomes affect future choices and that contestants have time‐varying risk aversion. We demonstrate that the strategies of Frank and Susanne are consistent with constant risk aversion levels except for their final risk‐seeking choice. We conclude with directions for future research. Copyright © 2013 John Wiley & Sons, Ltd.     

Stability and Hopf bifurcation in a class of nonlocal delay differential equation with the zero‐flux boundary condition

The aim of this paper is to study the stability and Hopf bifurcation in a general class of differential equation with nonlocal delayed feedback that models the population dynamics of a two age structured spices. The existence of Hopf bifurcation is firstly established after delicately analyzing the eigenvalue problem of the linearized nonlocal equation. The direction of the Hopf bifurcation and stability of the bifurcated periodic solutions are then investigated by means of center manifold reduction. Subsequently, we apply our main results to explore the spatial‐temporal patterns of the nonlocal Mackey‐Glass equation. We obtain both spatially homogeneous and inhomogeneous periodic solutions and numerically show that the former is stable while the latter is unstable. We also show that the inhomogeneous periodic solutions will eventually tend to homogeneous periodic solutions after transient oscillations and increasing of the immature mobility constant will shorten the transient oscillation time.     

Application of a Mickens finite‐difference scheme to the cylindrical Bratu‐Gelfand problem

The boundary value problem Δu + λe^u = 0 where u = 0 on the boundary is often referred to as “the Bratu problem.” The Bratu problem with cylindrical radial operators, also known as the cylindrical Bratu‐Gelfand problem, is considered here. It is a nonlinear eigenvalue problem with two known bifurcated solutions for λ < λ_c, no solutions for λ > λ_c and a unique solution when λ = λ_c. Numerical solutions to the Bratu‐Gelfand problem at the critical value of λ_c = 2 are computed using nonstandard finite‐difference schemes known as Mickens finite differences. Comparison of numerical results obtained by solving the Bratu‐Gelfand problem using a Mickens discretization with results obtained using standard finite differences for λ < 2 are given, which illustrate the superiority of the nonstandard scheme. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 327–337, 2004     

HOW RAPID SHOULD EMISSION REDUCTION BE? A GAME‐THEORETIC APPROACH

Abstract In this paper, we search for multistage realization of international environmental agreements. To analyze countries' incentives and the results of their interactions, we mathematically represent players' strategic preferences and apply a game‐theoretic approach to make predictions about their outcomes. The initial decision on emissions reduction is determined by the Stackelberg equilibrium concept. We generalize Barrett's static “emission” model to a dynamic framework and answer the question “how rapid should the emission reduction be?” It appears that sharper abatement is desirable in the early term, which is similar to the conclusion of the Stern review. Numerical example demonstrates that abatement dynamics of the coalition and the free‐rider differ when discounting of the future payoffs increases. We show that without incentives from external organizations or governments, such pollution reduction path can actually lead to a decline in the agreement's membership size.     

Efficient algorithms for three‐dimensional axial and planar random assignment problems

Beautiful formulas are known for the expected cost of random two‐dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural “Axial” and “Planar” versions, both of which are NP‐hard. For 3‐dimensional Axial random assignment instances of size n, the cost scales as Ω(1/ n), and a main result of the present paper is a linear‐time algorithm that, with high probability, finds a solution of cost O(n^–1+o(1)). For 3‐dimensional Planar assignment, the lower bound is Ω(n), and we give a new efficient matching‐based algorithm that with high probability returns a solution with cost O(n log n). © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 160–196, 2015     

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     

The 3‐connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial

Let G be a graph of order n, maximum degree Δ, and minimum degree δ. Let P(G, λ) be the chromatic polynomial of G. It is known that the multiplicity of zero “0” of P(G, λ) is one if G is connected, and the multiplicity of zero “1” of P(G, λ) is one if G is 2‐connected. Is the multiplicity of zero “2” of P(G, λ) at most one if G is 3‐connected? In this article, we first construct an infinite family of 3‐connected graphs G such that the multiplicity of zero “2” of P(G, λ) is more than one, and then characterize 3‐connected graphs G with Δ + δ?n such that the multiplicity of zero “2” of P(G, λ) is at most one. In particular, we show that for a 3‐connected graph G, if Δ + δ?n and (Δ, δ₃)≠(n?3, 3), where δ₃ is the third minimum degree of G, then the multiplicity of zero “2” of P(G, λ) is at most one. © 2011 Wiley Periodicals, Inc. J Graph Theory     

Boundary value problem for a global‐in‐time parabolic equation

The aim of this paper is to draw attention to an interesting semilinear parabolic equation that arose when describing the chaotic dynamics of a polymer molecule in a liquid. This equation is nonlocal in time and contains a term, called the interaction potential, that depends on the time‐integral of the solution over the entire interval of solving the problem. In fact, one needs to know the “future” in order to determine the coefficient in this term, that is, the causality principle is violated. The existence of a weak solution of the initial boundary value problem is proven. The interaction potential satisfies fairly general conditions and can have arbitrary growth at infinity. The uniqueness of this solution is established with restrictions on the length of the considered time interval.     

Mixed and hybrid formulations for the three‐dimensional magnetostatic problem

We propose mixed and hybrid formulations for the three‐dimensional magnetostatic problem. Such formulations are obtained by coupling finite element method inside the magnetic materials with a boundary element method. We present a formulation where the magnetic field is the state variable and the boundary approach uses a scalar Dirichlet‐Neumann map to describe the exterior domain. Also, we propose a second formulation where the magnetic induction is the state variable and a vectorial Dirichlet‐Neumann map is used to describe the outer field. Numerical discretizations with “edge” and “face” elements are proposed, and for each discrete problem we study an “inf‐sup” condition. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 85–104, 2002     

Numerical aspects of X‐SIMP‐based topology optimization

The discretization of topology design problems on the basis of the finite‐element‐method results in general in large‐scale combinatorial optimization problems, which are usually relaxed by the introduction of a continuous material density function as design variable. To avoid optimal designs containing unfavourable microstructures such as the well‐known “checkerboard” patterns, the relaxed problem can be regularized by the X‐SIMP‐approach, which penalizes intermediate density values as well as high density gradients within the design domain. In this context we discuss numerical aspects of the X‐SIMP‐based regularization such as the discretization of the regularized problem, the formulation of the corresponding stiffness matrix and the numerical solution of the discretized problem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)