Related papers: Usual stochastic ordering results for series and p…
Distributed statistical learning problems arise commonly when dealing with large datasets. In this setup, datasets are partitioned over machines, which compute locally, and communicate short messages. Communication is often the bottleneck.…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
Fluctuations of the order parameters of the Gardner model for any $\alpha<\alpha_c$ are studied. It is proved that they converge in distribution to a family of jointly Gaussian random variables.
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work is the first treatment of a natural stochastic variant of the problem where the cost of comparing two elements is a…
Machine learning systems appear stochastic but are deterministically random, as seeded pseudorandom number generators produce identical realisations across repeated executions. Standard evaluation practice typically treats runs across…
We discuss how to characterize the behavior of a chaotic dynamical system depending on a parameter that varies periodically in time. In particular, we study the predictability time, the correlations and the mean responses, by defining a…
Chance constrained program is computationally intractable due to the existence of chance constraints, which are randomly disturbed and should be satisfied with a probability. This paper proposes a two-layer randomized algorithm to address…
Under standard regularity assumptions, we provide simple approximations for specific classes of fiducial and confidence distributions and discuss their connections with objective Bayesian posteriors. For a real parameter the approximations…
A strong analogy is found between the evolution of localized disturbances in extended chaotic systems and the propagation of fronts separating different phases. A condition for the evolution to be controlled by nonlinear mechanisms is…
Given a chain complex with the only modification that each cell of the complex has a probability distribution assigned. We will call this complex - a random complex and what should be understood in practice, is that we have a classical…
We consider bilevel linear problems, where some parameters are stochastic, and the leader has to decide in a here-and-now fashion, while the follower has complete information. In this setting, the leader's outcome can be modeled by a random…
In this paper, we consider robust control using randomized algorithms. We extend the existing order statistics distribution theory to the general case in which the distribution of population is not assumed to be continuous and the order…
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
Heterogeneity of many building materials complicates numerical modelling of structural behaviour. The material randomicity can be manifested by different values of material parameters of each material specimen. To capture inherent…
Consider the following multi-phase project management problem. Each project is divided into several phases. All projects enter the next phase at the same point chosen by the decision maker based on observations up to that point. Within each…
In experiments, the dynamical behavior of systems is reflected in time series. Due to the finiteness of the observational data set it is not possible to reconstruct the invariant measure up to arbitrary fine resolution and arbitrary high…
We propose a kind of reaction-diffusion equations for cell differentiation, which exhibits the Turing instability. If the diffusivity of some variables is set to be infinity, we get coupled competitive reaction-diffusion equations with a…
We introduce a comprehensive method for establishing stochastic orders among order statistics in the i.i.d. case. This approach relies on the assumption that the underlying distribution is linked to a reference distribution through a…
Exponential stochastic compression is the process when every second cell of an infinite chain may increase its weight merging randomly with left, right, or both neighboring cells. The total mass conservation is assumed. After that, merged…
Consider bivariate observations $(X_1,Y_1), \ldots, (X_n,Y_n) \in \mathbb{R}\times \mathbb{R}$ with unknown conditional distributions $Q_x$ of $Y$, given that $X = x$. The goal is to estimate these distributions under the sole assumption…