Fluctuation limits of an immigration branching particle system and an immigration branching measure‐valued process yield different types of 𝒮′(ℝd)‐valued Ornstein‐Uhlenbeck processes whose covariances are given in terms of an excessive measure for the underlying motion in Rd, which is taken to be a symmetric α‐stable process. In this paper we prove existence and path continuity results for the self‐intersection local time of these Ornstein‐Uhlenbeck processes. The results depend on relationships between the dimension d and the parameter α. 相似文献
A quasivariety is said to be implicative if it is generated by a class of algebras with equationally‐definable implication of equalities. Implicative finitely‐generated quasivarieties appear naturally within logic, for instance, as equivalent quasivarieties of Gentzen‐style calculi for finitely‐valued propositional logics with equality determinant (cf. [17], [18, Subsection 7.5] and Section A). Furthermore, any discriminator quasivariety is implicative. We prove that, for any implicative locally‐finite quasivariety ? and any skeleton S of the class of all finite ?‐simple members of ?, the image of the first component of a natural Galois connection between the dual poset of subquasivarieties of ? and the poset of all sets of finite subsets of S is the closure system of all US‐ideals of the poset 〈S, ?〉, where ? is the embeddability relation and US is the up‐set on S constituted by all members of S having a one‐element subalgebra, with closure basis determined by the sets of all principal and non‐empty finitely‐generated up‐sets on S. It is also shown that the first component of the Galois connection under consideration is injective if and only if, for each finite sequence
In this article, we study the problem of deciding if, for a fixed graph H, a given graph is switching equivalent to an H‐free graph. Polynomial‐time algorithms are known for H having at most three vertices or isomorphic to P4. We show that for H isomorphic to a claw, the problem is polynomial, too. On the other hand, we give infinitely many graphs H such that the problem is NP‐complete, thus solving an open problem [Kratochvíl, Ne?et?il and Zýka, Ann Discrete Math 51 (1992)]. Further, we give a characterization of graphs switching equivalent to a K1, 2‐free graph by ten forbidden‐induced subgraphs, each having five vertices. We also give the forbidden‐induced subgraphs for graphs switching equivalent to a forest of bounded vertex degrees. 相似文献
We will prove that some so‐called union theorems (see [2]) are equivalent in ZF0 to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω1 (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172. 相似文献
The swarm behaviour can be controlled by different localizations of attractants (food pieces) and repellents (dangerous places), which, respectively, attract and repel the swarm propagation. If we assume that at each time step, the swarm can find out not more than p ?1 attractants ( ), then the swarm behaviour can be coded by p ‐adic integers, ie, by the numbers of the ring Z p . Each swarm propagation has the following 2 stages: (1) the discover of localizations of neighbour attractants and repellents and (2) the logistical optimization of the road system connecting all the reachable attractants and avoiding all the neighbour repellents. In the meanwhile, at the discovering stage, the swarm builds some direct roads and, at the logistical stage, the transporting network of the swarm gets loops (circles) and it permanently changes. So, at the first stage, the behaviour can be expressed by some linear p ‐adic valued strings. At the second stage, it is expressed by non‐linear modifications of p ‐adic valued strings. The second stage cannot be described by conventional algebraic tools; therefore, I have introduced the so‐called non‐linear group theory for describing both stages in the swarm propagation. 相似文献
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. 相似文献
The parameters in the governing system of partial differential equations of multiple‐network poroelasticity models typically vary over several orders of magnitude, making its stable discretization and efficient solution a challenging task. In this paper, we prove the uniform Ladyzhenskaya–Babu?ka–Brezzi (LBB) condition and design uniformly stable discretizations and parameter‐robust preconditioners for flux‐based formulations of multiporosity/multipermeability systems. Novel parameter‐matrix‐dependent norms that provide the key for establishing uniform LBB stability of the continuous problem are introduced. As a result, the stability estimates presented here are uniform not only with respect to the Lamé parameter λ but also to all the other model parameters, such as the permeability coefficients Ki; storage coefficients ; network transfer coefficients βij,i,j = 1,…,n; the scale of the networks n; and the time step size τ. Moreover, strongly mass‐conservative discretizations that meet the required conditions for parameter‐robust LBB stability are suggested and corresponding optimal error estimates proved. The transfer of the canonical (norm‐equivalent) operator preconditioners from the continuous to the discrete level lays the foundation for optimal and fully robust iterative solution methods. The theoretical results are confirmed in numerical experiments that are motivated by practical applications. 相似文献