Related papers: Weakly robust periodic solutions of one-dimensiona…
In this paper, we introduce concepts of pathwise random almost periodic and almost automorphic solutions for dynamical systems generated by non-autonomous stochastic equations. These solutions are pathwise stochastic analogues of…
Entropy weak solutions with bounded periodic initial data are considered for the system of weakly nonlinear gas dynamics. Through a modified Glimm scheme, an approximate solution sequence is constructed, and then a priori estimates are…
Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…
We study properties of basic solutions in systems with dime delays and $S^1$-symmetry. Such basic solutions are relative equilibria (CW solutions) and relative periodic solutions (MW solutions). It follows from the previous theory that the…
We consider a random process as a solution of stochastic differential equations with dependence of the coefficients on small parameter $\varepsilon$ and we suppose that the drift coefficients of these equations are unbounded on the…
This paper deals with Poisson approximation to weighted sums of locally dependent random variables using Stein's method. The derived result represents a significant improvement of existing results. To illustrate the effectiveness of our…
In the Maximum Weight Independent Set of Rectangles (MWISR) problem we are given a set of n axis-parallel rectangles in the 2D-plane, and the goal is to select a maximum weight subset of pairwise non-overlapping rectangles. Due to many…
Given any domain $X\subseteq \mathbb{R}^d$ and a probability measure $\rho$ on $X$, we study the problem of approximating in $L^2(X,\rho)$ a given function $u:X\to\mathbb{R}$, using its noiseless pointwise evaluations at random samples. For…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
A cellular automaton model of pulsar glitches is described, based on the superfluid vortex unpinning paradigm. Recent analyses of pulsar glitch data suggest that glitches result from scale-invariant avalanches \citep{Melatos07a}, which are…
In this article, the weak-strong uniqueness principle is proved for an Euler-Poisson system in the whole space, with initial data so that the strong solution exists. Some results on Riesz potentials are used to justify the considered weak…
In this work, we present a variant of the multilayer random sequential adsorption (RSA) process that is inspired by orthogonal resource sharing in wireless communication networks. In the one-dimensional (1D) version of this variant, the…
Time averaging of weak values using the quantum transition path time probability distribution enables us to establish a general uncertainty principle for the weak values of two not necessarily Hermitian operators. This new principle is a…
In this article, we investigate the existence and properties of time-periodic solutions for damped evolutionary partial differential equations subject to periodic forcing. Particular emphasis is placed on configurations where the energy…
We consider a problem of placing generators of rewards to be collected by randomly moving agents in a network. In many settings, the precise mobility pattern may be one of several possible, based on parameters outside our control, such as…
While the reversibility of multidimensional cellular automata is undecidable and there exists a criterion for determining if a multidimensional linear cellular automaton is reversible, there are only a few results about the reversibility…
The conditional distribution of the next outcome given the infinite past of a stationary process can be inferred from finite but growing segments of the past. Several schemes are known for constructing pointwise consistent estimates, but…
We study a new model-free algorithm to compute $\varepsilon$-optimal policies for average reward Markov decision processes, in the weakly communicating case. Given a generative model, our procedure combines a recursive sampling technique…
In this study, we investigate a robust single-machine scheduling problem under processing time uncertainty. The uncertainty is modeled using the budgeted approach, where each job has a nominal and deviation processing time, and the number…
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to of its numerous applications in industry. However, in practice, task durations are subject to…