Analysis of the power law logistic population model with slowly varying coefficients

We apply a multiscale method to construct general analytic approximations for the solution of a power law logistic model, where the model parameters vary slowly in time. Such approximations are a useful alternative to numerical solutions and are applicable to a range of parameter values. We consider two situations—positive growth rates, when the population tends to a slowly varying limiting state; and negative growth rates, where the population tends to zero in infinite time. The behavior of the population when a transition between these situations occurs is also considered. These approximations are shown to give excellent agreement with the numerical solutions of test cases. Copyright © 2012 John Wiley & Sons, Ltd.     

Conditions for the discovery of solution horizons

We present necessary and sufficient conditions for discrete infinite horizon optimization problems with unique solutions to be solvable. These problems can be equivalently viewed as the task of finding a shortest path in an infinite directed network. We provide general forward algorithms with stopping rules for their solution. The key condition required is that of weak reachability, which roughly requires that for any sequence of nodes or states, it must be possible from optimal states to reach states close in cost to states along this sequence. Moreover the costs to reach these states must converge to zero. Applications are considered in optimal search, undiscounted Markov decision processes, and deterministic infinite horizon optimization.This work was supported in part by NSF Grant ECS-8700836 to The University of Michigan.     

OSCILLATION AND ASYMPTOTIC BEHAVIOR OF SOLUTIONS OF DELAY DIFFERENTIAL EQUATIONS WITH IMPULSES

ＯＳＣＩＬＬＡＴＩＯＮＡＮＤＡＳＹＭＰＴＯＴＩＣＢＥＨＡＶＩＯＲＯＦＳＯＬＵＴＩＯＮＳＯＦＤＥＬＡＹＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳＷＩＴＨＩＭＰＵＬＳＥＳＳｈｅｎＪｉａｎｈｕａ（申建华）＆ＷａｎｇＺｈｉｃｈｅｎｇ（王志成）（ＨｕｎａｎＵｎ...     

弱耗散Camassa-Holm方程解的Blowup及衰减性质

本文研究弱耗散Camassa-Holm方程的Cauchy问题,由Kato理论得到了局部适定性的结果,证明了解的blowup及整体存在性,并证明了当耗散系数满足适当条件时,整体解具有衰减性质.     

Some Remarks on the Eigenvalue Multiplicities of the Laplacian on Infinite Locally Finite Trees

We consider the continuous Laplacian on an infinite uniformly locally finite network under natural transition conditions as continuity at the ramification nodes and the classical Kirchhoff flow condition at all vertices in a L ^∞-setting. The characterization of eigenvalues of infinite multiplicity for trees with finitely many boundary vertices (von Below and Lubary, Results Math 47:199–225, 2005, 8.6) is generalized to the case of infinitely many boundary vertices. Moreover, it is shown that on a tree, any eigenspace of infinite dimension contains a subspace isomorphic to ${\ell^\infty({\mathbb N})}$ . As for the zero eigenvalue, it is shown that a locally finite tree either is a Liouville space or has infinitely many linearly independent bounded harmonic functions if the edge lengths do not shrink to zero anywhere. This alternative is shown to be false on graphs containing circuits.     

A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations

In this paper, we consider spanning tree situations, where players want to be connected to a source as cheap as possible. These situations involve the construction of a spanning tree with the minimum cost as well as the allocation of the cost of this minimum cost spanning tree among its users in a fair way. Feltkamp, Muto and Tijs 1994 introduced the equal remaining obligations rule to solve the cost allocation problem in these situations. Recently, it has been shown that the equal remaining obligations rule satisfies many appealing properties and can be obtained with different approaches. In this paper, we provide a new approach to obtain the equal remaining obligations rule. Specifically, we show that the equal remaining obligations rule can be obtained as the average of the cost allocations provided by a vertex oriented construct-and-charge procedure for each order of players.     

Remarks on Risk-Sensitive Control Problems

The main purpose of this paper is to investigate the asymptotic behavior of the discounted risk-sensitive control problem for periodic diffusion processes when the discount factor $\alpha$ goes to zero. If $u_\alpha(\theta,x)$ denotes the optimal cost function, $\theta$ being the risk factor, then it is shown that $\lim_{\alpha\to 0}\alpha u_\alpha(\theta,x)=\xi(\theta)$ where $\xi(\theta)$ is the average on $]0,\theta[$ of the optimal cost of the (usual) infinite horizon risk-sensitive control problem.     

Opportune moment strategies for a cost spanning tree game

Cost spanning tree problems concern the construction of a tree which provides a connection with the source for every node of the network. In this paper, we address cost sharing problems associated to these situations when the agents located at the nodes act in a non-cooperative way. A class of strategies is proposed which produce minimum cost spanning trees and, at the same time, are strong Nash equilibria for a non-cooperative game associated to the problem. They are also subgame perfect Nash equilibria.     

收敛无穷限广义积分被积函数在无穷远处性质

讨论了第一型广义积分收敛时被积函数在无穷远处渐近性质,证明当广义积分收敛时,被积函数在无穷远处不一定趋于零,而可以表现为其他多种形式,如剧烈振荡的连续函数,或间断函数,甚至可以是特殊形式的非负连续函数等.最后给出当广义积分收敛时,判别被积函数在无穷远处是否趋于零时的几个条件.     

Prediction with a Generalized Cost of Error Function

Classical prediction theory limits itself to quadratic cost functions, and hence least-square predictors. However, the cost functions that arise in practice in economics and management situations are not likely to be quadratic in form, and frequently will be non-symmetric. It is the object of this paper to throw light on prediction in such situations and to suggest some practical implications. It is suggested that a useful, although sub-optimal, manner of taking into account generalized cost functions is to add a constant bias term to the predictor. Two theorems are proved showing that under fairly general conditions the bias term can be taken to be zero when one uses a symmetric cost function. If the cost function is a non-symmetric linear function, an expression for the bias can be simply obtained.     

Structural stability of solutions to the Riemann problem for a scalar conservation law

The aim of this paper is to study the structural stability of solutions to the Riemann problem for a scalar conservation law with a linear flux function involving discontinuous coefficients. It is proved that the Riemann solution is possibly instable when one of the Riemann initial data is at the vacuum. Furthermore, we point out that the Riemann solution is also possibly instable even when the Riemann initial data stay far away from vacuum. In order to deal with it, we perturb the Riemann initial data by taking three piecewise constant states and then the global structures and large time asymptotic behaviors of the solutions are obtained constructively. It is also proved that the Riemann solutions are unstable in some certain situations under the local small perturbations of the Riemann initial data by letting the perturbed parameter ε tend to zero. In addition, the interaction of the delta standing wave and the contact vacuum state is considered which appear in the Riemann solutions.     

The complexity of recursive constraint satisfaction problems

We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint satisfaction problems where the problem of finding a solution to the infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through finitely branching recursive trees or recursive binary trees. There are a large number of results in the literature on the complexity of the problem of finding an infinite path through a recursive tree. Our main result allows us to automatically transfer such results to give equivalent results about the complexity of the problem of finding a solution to a recursive constraint satisfaction problem.     

Long time behavior for a nonlinear fractional model

The asymptotic behavior for solutions of a weighted Cauchy-type nonlinear fractional problem is investigated. We find bounds for solutions on infinite time intervals and also provide sufficient conditions assuring decay to zero. This work improves earlier results by the same authors.     

一类非线性无穷时滞中立型泛函微分方程系统的一致稳定性

本文讨论一类无穷时滞非线性中立型泛函微分方程解的渐近性态与零解的一致稳定性，得到若干简单的稳定性判据。     

Ergodic Control in L∞

The infinite horizon discounted L ^∞ problem is studied as the discount factor goes to zero. It is related to the limit of the finite horizon problem as the horizon becomes infinite. The deterministic problem with and without a running cost is considered.     

Disappearing x: When solving does not mean finding the solution set

This study deals with preservice elementary teachers’ responses to linear equations and inequalities that had infinite solution sets. In particular, these tasks dealt with situations where the variable is eliminated during standard symbolic manipulation. The results reveal that infinite solution sets proved difficult for the participants, particularly when prompted to solve the linear equations and inequalities. When the direction prompt was changed, there was increased success in finding the correct solution set. The directional prompts changed the types of solution strategies as well as the nature of responses. In addition, participants stated the belief that different, mathematically equivalent prompts required different, non-equivalent, types of solutions and allowed for different solution strategies.     

含参数线性方程组解的判别方法注记

当线性方程组中含有未知参数时,线性方程组解的情况往往需要进行讨论.本文给出了在非齐次线性方程组系数矩阵中含有未知参数且系数行列式等于零的情况下,判定对应参数值下方程组的解是无解还是有无穷多解的两个判定定理.和以前的方法比较,本文提出的讨论方法更直接.     

树映射的链等价集与拓扑熵

本文讨论了树映射f的链等价集的性质,得到了f具有零拓扑熵的几个等价条件,并证明了:如果 f的一个链等价集是个无限集,那么这个链等价集的任何孤立点都是f的非周期的终于周期点.     

Obligation rules for minimum cost spanning tree situations and their monotonicity properties

We consider the class of Obligation rules for minimum cost spanning tree situations. The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes. Another characteristic of Obligation rules is that they assign to a minimum cost spanning tree situation a vector of cost contributions which can be obtained as product of a double stochastic matrix with the cost vector of edges in the optimal tree provided by the Kruskal algorithm. It turns out that the Potters value (P-value) is an element of this class.     

Local Convergence of Large Critical Multi-type Galton–Watson Trees and Applications to Random Maps

We show that large critical multi-type Galton–Watson trees, when conditioned to be large, converge locally in distribution to an infinite tree which is analogous to Kesten’s infinite monotype Galton–Watson tree. This is proven when we condition on the number of vertices of one fixed type, and with an extra technical assumption if we count at least two types. We then apply these results to study local limits of random planar maps, showing that large critical Boltzmann-distributed random maps converge in distribution to an infinite map.