Some nonlinear Brascamp-Lieb inequalities and applications to harmonic analysis

We use the method of induction-on-scales to prove certain diffeomorphism-invariant nonlinear Brascamp-Lieb inequalities. We provide applications to multilinear convolution inequalities and the restriction theory for the Fourier transform, extending to higher dimensions recent work of Bejenaru-Herr-Tataru and Bennett-Carbery-Wright.     

The FKG Inequality for Partially Ordered Algebras

The FKG inequality asserts that for a distributive lattice with log-supermodular probability measure, any two increasing functions are positively correlated. In this paper we extend this result to functions with values in partially ordered algebras, such as algebras of matrices and polynomials. This research was supported by an NSF grant.     

Some results related to permanental inequalities

The FKG inequality and associated inequalities have been extensively studied in the literature. The FKG inequality has been extended to a 2m-function inequality which relates to some interesting permanental inequalities. In this paper, we prove some related inequalities and also give a simple alternative proof of the 2m-function inequality. Our proofs use tools of majorization theory and are thus based on a completely different approach than the usual one.     

Transportation inequalities for stochastic differential equations with jumps

For stochastic differential equations with jumps, we prove that _W1H$W_{1}H$ transportation inequalities hold for their invariant probability measures and for their process-level laws on the right-continuous path space w.r.t. the L¹$L^1$-metric and uniform metric, under dissipative conditions, via Malliavin calculus. Several applications to concentration inequalities are given.     

Penalty method for solving a class of stochastic differential variational inequalities with an application

The aim of this paper is to study the penalty method for solving a class of stochastic differential variational inequalities (SDVIs). The penalty problem for solving SDVIs is first constructed and the convergence of the sequences generated by the penalty problem is proved under some mild conditions. As an application, the convergence of the sequences generated by the penalty problem is obtained for solving a stochastic migration equilibrium problem with movement cost.     

Brascamp-Lieb inequality for positive double John basis and its reverse

In this paper, we establish the Brascamp-Lieb inequality for positive double John basis and its reverse. As their applications, we estimate the upper and lower bounds for the volume product of two unit balls with the given norms. Moreover, the Loomis-Whitney inequality for positive double John basis is obtained.     

The limit case of a domination property

The domination number γ(G) of a connected graph G of order n is bounded below by(n+2-e(G))/ 3 , where (G) denotes the maximum number of leaves in any spanning tree of G. We show that (n+2-e(G))/ 3 = γ(G) if and only if there exists a tree T ∈ T ( G) ∩ R such that n1(T ) = e(G), where n1(T ) denotes the number of leaves of T1, R denotes the family of all trees in which the distance between any two distinct leaves is congruent to 2 modulo 3, and T (G) denotes the set composed by the spanning trees of G. As a consequence of the study, we show that if (n+2-e(G))/ 3 = γ(G), then there exists a minimum dominating set in G whose induced subgraph is an independent set. Finally, we characterize all unicyclic graphs G for which equality (n+2-e(G))/ 3= γ(G) holds and we show that the length of the unique cycle of any unicyclic graph G with (n+2-e(G))/ 3= γ(G) belongs to {4} ∪ {3 , 6, 9, . . . }.     

Harnack inequalities for stochastic equations driven by Lévy noise

By using coupling argument and regularization approximations of the underlying subordinator, dimension-free Harnack inequalities are established for a class of stochastic equations driven by a Lévy noise containing a subordinate Brownian motion. The Harnack inequalities are new even for linear equations driven by Lévy noise, and the gradient estimate implied by our log-Harnack inequality considerably generalizes some recent results on gradient estimates and coupling properties derived for Lévy processes or linear equations driven by Lévy noise. The main results are also extended to semilinear stochastic equations in Hilbert spaces.     

Singular stochastic equations on Hilbert spaces: Harnack inequalities for their transition semigroups

We consider stochastic equations in Hilbert spaces with singular drift in the framework of [G. Da Prato, M. Röckner, Singular dissipative stochastic equations in Hilbert spaces, Probab. Theory Related Fields 124 (2) (2002) 261-303]. We prove a Harnack inequality (in the sense of [F.-Y. Wang, Logarithmic Sobolev inequalities on noncompact Riemannian manifolds, Probab. Theory Related Fields 109 (1997) 417-424]) for its transition semigroup and exploit its consequences. In particular, we prove regularizing and ultraboundedness properties of the transition semigroup as well as that the corresponding Kolmogorov operator has at most one infinitesimally invariant measure μ (satisfying some mild integrability conditions). Finally, we prove existence of such a measure μ for noncontinuous drifts.     

A comment to: Two classes of edge domination in graphs

Let G be a graph of order n and denote the signed edge domination number of G. In [B. Xu, Two classes of edge domination in graphs, Discrete Appl. Math. 154 (2006) 1541-1546] it was proved that for any graph G of order n, . But the method given in the proof is not correct. In this paper we give an example for which the method of proof given in [1] does not work.     

Optimal stopping-time problem for stochastic Navier–Stokes equations and infinite-dimensional variational inequalities

We prove the existence of a solution for the obstacle problem associated with the Kolmogorov operator corresponding to the stopping-time problem for stochastic Navier–Stokes equations in 2-D.     

Bounds relating the weakly connected domination number to the total domination number and the matching number

Let G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating set of G if the subgraph (V,E∩(S×V)) of G with vertex set V that consists of all edges of G incident with at least one vertex of S is connected. The minimum cardinality of a weakly connected dominating set of G is the weakly connected domination number, denoted . A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ_t(G) of G. In this paper, we show that . Properties of connected graphs that achieve equality in these bounds are presented. We characterize bipartite graphs as well as the family of graphs of large girth that achieve equality in the lower bound, and we characterize the trees achieving equality in the upper bound. The number of edges in a maximum matching of G is called the matching number of G, denoted α^′(G). We also establish that , and show that for every tree T.     

The disjunctive domination number of a graph

Abstract

For a positive integer b, we define a set S of vertices in a graph G as a b-disjunctive dominating set if every vertex not in S is adjacent to a vertex of S or has at least b vertices in S at distance 2 from it. The b-disjunctive domination number is the minimum cardinality of such a set. This concept is motivated by the concepts of distance domination and exponential domination. In this paper, we start with some simple results, then establish bounds on the parameter especially for regular graphs and claw-free graphs. We also show that determining the parameter is NP-complete, and provide a linear-time algorithm for trees.     

The product of the restrained domination numbers of a graph and its complement

Let G=(V,E) be a graph.A set S■V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S.The restrained domination number of G,denoted γr(G),is the smallest cardinality of a restrained dominating set of G.In this paper,we show that if G is a graph of order n≥4,then γr(G)γr(G)≤2n.We also characterize the graphs achieving the upper bound.     

Simultaneous graph parameters: Factor domination and factor total domination

Let F₁,F₂,…,F_k be graphs with the same vertex set V. A subset S⊆V is a factor dominating set if in every F_i every vertex not in S is adjacent to a vertex in S, and a factor total dominating set if in every F_i every vertex in V is adjacent to a vertex in S. The cardinality of a smallest such set is the factor (total) domination number. In this note, we investigate bounds on the factor (total) domination number. These bounds exploit results on colorings of graphs and transversals of hypergraphs.     

The domination and competition graphs of a tournament

Vertices x and y dominate a tournament T if for all vertices z ≠ x, y, either x beats z or y beats z. Let dom(T) be the graph on the vertices of T with edges between pairs of vertices that dominate T. We show that dom(T) is either an odd cycle with possible pendant vertices or a forest of caterpillars. While this is not a characterization, it does lead to considerable information about dom(T). Since dom(T) is the complement of the competition graph of the tournament formed by reversing the arcs of T, complementary results are obtained for the competition graph of a tournament. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 103–110, 1998     

The Riemann approach to stochastic integration using non-uniform meshes

In this note we shall prove that the stochastic integral with respect to a semimartingale can be defined by Riemann's approach. However in this approach we use non-uniform meshes instead of the usual uniform meshes.     

Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints

Stochastic dominance relations are well studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic optimization models involving second order stochastic dominance constraints can be solved by linear programming. However, problems involving first order stochastic dominance constraints are potentially hard due to the non-convexity of the associated feasible regions. In this paper we consider a mixed 0–1 linear programming formulation of a discrete first order constrained optimization model and present a relaxation based on second order constraints. We derive some valid inequalities and restrictions by employing the probabilistic structure of the problem. We also generate cuts that are valid inequalities for the disjunctive relaxations arising from the underlying combinatorial structure of the problem by applying the lift-and-project procedure. We describe three heuristic algorithms to construct feasible solutions, based on conditional second order constraints, variable fixing, and conditional value at risk. Finally, we present numerical results for several instances of a real world portfolio optimization problem. This research was supported by the NSF awards DMS-0603728 and DMI-0354678.     

Dynamic of a stochastic predator-prey population

A stochastic predator-prey model is studied. Firstly, we prove the existence, uniqueness and positivity of the solution. Then, we show the upper bounds for moments and growth rate of population. In some cases, the growth rate is negative and the population dies out rapidly. The paper ends with some reviews for the paper [13].