نتایج جستجو برای: g monotone property
تعداد نتایج: 601093 فیلتر نتایج به سال:
A metric space (X, d) is called c-monotone if there is a linear order < on X and c > 0 such that d(x, y) 6 c d(x, z) for all x < y < z in X. A brief account of investigation of monotone spaces including applications is presented. 1 Monotone and σ-Monotone Spaces. In [6] I investigated existence of sets in Euclidean spaces that have large Hausdorff dimension and yet host no continuous finite Bor...
Given a monotone graph property P consider p P the proba bility that a random graph with edge probability p will have P The function d p P dp is the key to understanding the threshold behavior of the property P We show that if d p P dp is small corresponding to a non sharp threshold then there is a list of graphs of bounded size such that P can be approximated by the property of having one of t...
For a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and ij is an edge in G. In [2], ξ(G) is defined to be the maximum corank (i.e., nullity) among A ∈ S(G) having the Strong Arnold Property; ξ is used to study the minimum rank/maximum eigenvalue multiplicity problem for G. Since ξ is minor monotone, the graphs G ...
For a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and ij is an edge in G. In [2], ξ(G) is defined to be the maximum corank (i.e., nullity) among A ∈ S(G) having the Strong Arnold Property; ξ is used to study the minimum rank/maximum eigenvalue multiplicity problem for G. Since ξ is minor monotone, the graphs G ...
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real function defined on the set of finite graphs, by sampling a randomly chosen substructure whose size is independent of the size of the input. Graph parameters that may be successfully estimated in this way are said to be testable or estimable, and the sample complexity qz = qz(ε) of an estimable par...
Let G be a graph and p ∈ [1,∞]. The parameter fp(G) is the least integer k such that for all m and all vectors (rv)v∈V (G) ⊆ R , there exist vectors (qv)v∈V (G) ⊆ R k satisfying ‖rv − rw‖p = ‖qv − qw‖p, for all vw ∈ E(G). It is easy to check that fp(G) is always finite and that it is minor monotone. By the graph minor theorem of Robertson and Seymour [9], there are a finite number of excluded m...
We give a result on existence of periodic orbits for autonomous differential systems with arbitrary finite dimension. It is based on a Poincaré-Bendixson property enjoyed by a new class of monotone systems introduced in L. A. Sanchez, Cones of rank 2 and the PoincaréBendixson property for a new class of monotone systems, Journal of Differential Equations 216 (2009), 1170-1190. A concrete applic...
It is proved that for any given integer k > 2 and a k-monotone function g, there exists a k-monotone function g̃ ≤ g of the form c(a − x) + and passing through a fixed point in the support of g. The result is motivated by the problem of the existence of the LSE of a k-monotone density.
We consider the problem of distribution-free testing of the class of monotone monomials and the class of monomials over n variables. While there are very efficient testers for a variety of classes of functions when the underlying distribution is uniform, designing distribution-free testers (which must work under an arbitrary and unknown distribution) tends to be more challenging. When the under...
Monotone Lévy processes with additive increments are defined and studied. It is shown that these processes have natural Markov structure and their Markov transition semigroups are characterized using the monotone Lévy-Khintchine formula. 17 Monotone Lévy processes turn out to be related to classical Lévy processes via Attal's " remarkable transformation. " A monotone analogue of the family of e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید