相关论文: On laws exhibiting universal ordering under stocha…

A class of restarted randomized surrounding methods are presented to accelerate the surrounding algorithms by restarted techniques for solving the linear equations. Theoretical analysis prove that the proposed method converges under the…

Optimization of a random processes by restart is a subject of active theoretical research in statistical physics and has long found practical application in computer science. Meanwhile, one of the key issues remains largely unsolved: when…

In this paper, we study stochastic ordering results between two finite mixtures with single and multiple outliers, assuming subpopulations follow general exponentiated location-scale distributions. For single-outlier mixtures, several…

Classical first passage under resetting is a paradigm in the search process. Despite its multitude of applications across interdisciplinary sciences, experimental realizations of such resetting processes posit practical challenges in…

Bellman formulated a vague principle for optimization over time, which characterizes optimal policies by stating that a decision maker should not regret previous decisions retrospectively. This paper addresses time consistency in stochastic…

A general class of non-Markov, supercritical Gaussian branching particle systems is introduced and its long-time asymptotics is studied. Both weak and strong laws of large numbers are developed with the limit object being characterized in…

Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal…

In many physical situations, there appears the problem of reaching a single target that is spatially distributed. Here we analyse how stochastic resetting, also spatially distributed, can be used to improve the search process when the…

We consider a general system of n noninteracting identical particles which evolve under a given dynamical law and whose initial microstates are a priori independent. The time evolution of the n-particle average of a bounded function on the…

A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…

The auxiliary rules of quantum mechanics can be written without the Born rule by using what are called the nRules. The nRules are understood in part by making certain modifications in the Hamiltonian. In this paper, those modifications are…

We prove a general ergodic-theoretic result concerning the return time statistic, which, properly understood, sheds some new light on the common sense phenomenon known as {\it the law of series}. Let \proc be an ergodic process on finitely…

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…

In recent years, it has been well-established that adding a restart mechanism can alter the firstpassage statistics of a stochastic processes in useful and interesting ways. Though different mecha-nisms have been investigated, we derive a…

We model stochastic choice as environment-dependent switching among a small library of deterministic decision rules. A Random Rule Model generates menu-level choice probabilities via named, interpretable rules weighted by observable menu…

We propose a mechanism which produces periodic variations of the degree of predictability in dynamical systems. It is shown that even in the absence of noise when the control parameter changes periodically in time, below and above the…

We study an elementary two-player card game where in each round players compare cards and the holder of the smallest card wins. Using the rate equations approach, we treat the stochastic version of the game in which cards are drawn…

This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability, and compressibility. Following a…

A new type of deterministic chaos for a system described by iterative two-dimensional maps is reported. The series being generated by the original map has an average upward trend while the first difference, which is the series of changes…

Deterministic evolutionary theory robustly predicts that populations displaying altruistic behaviours will be driven to extinction by mutant cheats that absorb common benefits but do not themselves contribute. Here we show that when…