Related papers: Probabilistic shadowing in linear skew products

Let $f \colon X \to X$ be a continuous map on a compact metric space $X$ and let $\alpha_f$, $\omega_f$ and $ICT_f$ denote the set of $\alpha$-limit sets, $\omega$-limit sets and nonempty closed internally chain transitive sets…

It is shown that, under some natural assumptions, the tensor product of differentially smooth algebras and the skew-polynomial rings over differentially smooth algebras are differentially smooth.

For any continuous self-map of a compact metric space, we consider the space of chain components and prove that the s-limit shadowing implies the denseness of chain components with the shadowing property. It gives a partial answer to a…

We embed the space of totally real $r$-cycles of a totally real projective variety into the space of complex $r$-cycles by complexification. We provide a proof of the holomorphic taffy argument in the proof of Lawson suspension theorem by…

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

We will consider cross products of finite graphs with a class of trees that have arbitrarily but finitely long line segments, such as the Fibonacci tree. Such cross products are called tree-strips. We prove that for small disorder random…

We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$-vertex oriented cycle will appear strictly before a directed Hamilton cycle does, except of course for the directed cycle itself.…

In this article we provide a proof of the so called absolute continuity theorem for random dynamical systems on $R^d$ which have an invariant probability measure. First we present the construction of local stable manifolds in this case.…

The diffraction of stochastic point sets, both Bernoulli and Markov, and of random tilings with crystallographic symmetries is investigated in rigorous terms. In particular, we derive the diffraction spectrum of 1D random tilings, of…

We use the "closed point sieve" to prove a variant of a Bertini theorem over finite fields. Specifically, given a smooth quasi-projective subscheme X of P^n of dimension m over F_q, and a closed subscheme Z in P^n such that Z intersect X is…

We consider the problem of shadowing for differential equations with grow-up. We introduce so-called nonuniform shadowing properties (in which size of the error depends on the point of the phase space) and prove for them analogs of…

We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible…

We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…

In the study of random structures we often face a trade-off between realism and tractability, the latter typically enabled by assuming some form of independence. In this work we initiate an effort to bridge this gap by developing tools that…

The following work presents a sufficiently general method for finding the parameters that characterise self-gravitating compact objects when their shadow contour is explicitly set. This method can be used in various algorithms to analyse…

For a multivariate random walk with i.i.d. jumps satisfying the Cramer moment condition and having a mean vector with at least one negative component, we derive the exact asymptotics of the probability of ever hitting the positive orthant…

It is proved that to every invariant measure of a compact dynamical system one can associate a certain asymptotic pseudo orbit such that any point asymptotically tracing in average that pseudo orbit is generic for the measure. It follows…

Despite its prevalence, probabilistic bisimilarity suffers from a lack of robustness under minuscule perturbations of the transition probabilities. This can lead to discontinuities in the probabilistic bisimilarity distance function,…

The notion of stochastic shadowing property is introduced. Relations to stochastic stability and standard shadowing are studied. Using tent map as an example it is proved that, in contrast to what happens for standard shadowing, there are…

Diagram-chasing arguments frequently lead to "magical" relations between distant points of diagrams: exactness implications, connecting morphisms, etc.. These long connections are usually composites of short "unmagical" connections, but the…