967,717 research outputs found
Weak ergodic theorem for Markov chains in the absence of invariant countably additive measures
General Markov chains (MC) with a countably additive transition probability
on a normal topological space are considered. We extend the Markov operator
from the traditional space of countably additive measures to the space of
finitely additive measures. We study the Cesaro means for the Markov sequence
of measures and their asymptotic behavior in the weak topology generated by the
space of bounded continuous functions. It is proved ergodic theorem that in
order for the Cesaro means to converge weakly to some bounded regular finitely
additive (or countably additive) measure, it is necessary and sufficient that
all invariant finitely additive measures (such always exist) are not separable
from the limit measure in the weak topology. Moreover, the limit measure may
not be invariant for a MC, and may not be countably additive. The corresponding
example is given and studied in detail. Key words: Markov chain, Markov
operators, Cesaro means, weak ergodic theorem, absence of invariant countably
additive measures, invariant finitely additive measure, purely finitely
additive measures.Comment: 15 pages, 1 figur
The inapproximability for the (0,1)-additive number
An
{\it additive labeling} of a graph is a function , such that for every two adjacent vertices and of , ( means that is joined to ). The {\it additive number} of ,
denoted by , is the minimum number such that has a additive
labeling . The {\it additive
choosability} of a graph , denoted by , is the smallest
number such that has an additive labeling for any assignment of lists
of size to the vertices of , such that the label of each vertex belongs
to its own list.
Seamone (2012) \cite{a80} conjectured that for every graph , . We give a negative answer to this conjecture and we show that
for every there is a graph such that .
A {\it -additive labeling} of a graph is a function , such that for every two adjacent vertices and
of , .
A graph may lack any -additive labeling. We show that it is -complete to decide whether a -additive labeling exists for
some families of graphs such as perfect graphs and planar triangle-free graphs.
For a graph with some -additive labelings, the -additive
number of is defined as where is the set of -additive labelings of .
We prove that given a planar graph that admits a -additive labeling, for
all , approximating the -additive number within is -hard.Comment: 14 pages, 3 figures, Discrete Mathematics & Theoretical Computer
Scienc
- β¦