English
Related papers

Related papers: Random perturbations of stochastic chains with unb…

200 papers

We investigate the effects of random perturbations on fully chaotic open systems. Perturbations can be applied to each trajectory independently (white noise) or simultaneously to all trajectories (random map). We compare these two scenarios…

Chaotic Dynamics · Physics 2015-05-12 Tamas Bodai , Eduardo G. Altmann , Antonio Endler

We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…

Probability · Mathematics 2014-12-23 Volker Betz , Stéphane Le Roux

In this paper, we propose the uncertain volatility models with stochastic bounds. Like the regular uncertain volatility models, we know only that the true model lies in a family of progressively measurable and bounded processes, but instead…

Mathematical Finance · Quantitative Finance 2017-02-17 Jean-Pierre Fouque , Ning Ning

We consider a generic class of gene circuits affected by nonlinear extrinsic noise. To address this nonlinearity we introduce a general perturbative methodology based on assuming timescale separation between noise and genes dynamics, with…

Molecular Networks · Quantitative Biology 2023-05-10 Gerardo Aquino , Andrea Rocco

A stochastic model of excitatory and inhibitory interactions which bears universality traits is introduced and studied. The endogenous component of noise, stemming from finite size corrections, drives robust inter-nodes correlations, that…

Disordered Systems and Neural Networks · Physics 2017-08-16 Clement Zankoc , Duccio Fanelli , Francesco Ginelli , Roberto Livi

Synchronization of finite spike sequences is the way two brain regions compare their content and extract the most suitable sequence. This is the core of the linguistic comparison between a word and a previous one retrieved by memory.…

Neurons and Cognition · Quantitative Biology 2018-07-10 F. T. Arecchi

Stochastic restart may drastically reduce the expected run time of a computer algorithm, expedite the completion of a complex search process, or increase the turnover rate of an enzymatic reaction. These diverse first-passage-time (FPT)…

Statistical Mechanics · Physics 2020-10-30 Shlomi Reuveni

The stochastic linear bandit problem proceeds in rounds where at each round the algorithm selects a vector from a decision set after which it receives a noisy linear loss parameterized by an unknown vector. The goal in such a problem is to…

Machine Learning · Statistics 2016-06-21 Nicholas Johnson , Vidyashankar Sivakumar , Arindam Banerjee

Motivated by a real problem in steel production, we introduce and analyze a general class of singularly perturbed linear hybrid systems with both switches and impulses, in which the slow or fast nature of the variables can be…

Systems and Control · Computer Science 2017-06-16 Jihene Ben Rejeb , Irinel-Constantin Morărescu , Antoine Girard , Jamal Daafouz

We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at $0$ whenever they cross that point. We show that the perturbed random walk, after being…

Probability · Mathematics 2019-06-04 Hoang-Long Ngo , Marc Peigne

Randomized search algorithms for hard combinatorial problems exhibit a large variability of performances. We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate…

Statistical Mechanics · Physics 2009-11-07 Andrea Montanari , Riccardo Zecchina

Numerous empirical evidence has corroborated that the noise plays a crucial rule in effective and efficient training of neural networks. The theory behind, however, is still largely unknown. This paper studies this fundamental problem…

Machine Learning · Computer Science 2019-09-10 Mo Zhou , Tianyi Liu , Yan Li , Dachao Lin , Enlu Zhou , Tuo Zhao

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…

Computational Complexity · Computer Science 2013-10-15 Samuel Epstein

Neurons in the nervous system are submitted to distinct sources of noise, such as ionic-channel and synaptic noise, which introduces variability in their responses to repeated presentations of identical stimuli. This motivates the use of…

We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…

Probability · Mathematics 2025-08-19 Nils Berglund

Perception of time from sequentially acquired sensory inputs is rooted in everyday behaviors of individual organisms. Yet, most algorithms for time-series modeling fail to learn dynamics of random event timings directly from visual or audio…

Machine Learning · Computer Science 2021-07-20 Hengguan Huang , Hongfu Liu , Hao Wang , Chang Xiao , Ye Wang

We consider the noise-induced transitions in the randomly perturbed discrete logistic map from a linearly stable periodic orbit consisting of T periodic points. The traditional large deviation theory and asymptotic analysis for small noise…

Chaotic Dynamics · Physics 2016-04-20 Yu Cao , Ling Lin , Xiang Zhou

Scalar conservation laws sit at the intersection between being simple enough to study analytically, while being complex enough to exhibit a wide range of nonlinear phenomena. We introduce a novel stochastic perturbation of scalar…

Analysis of PDEs · Mathematics 2025-10-30 Ulrik S. Fjordholm , Magnus C. Ørke

This work theoretically studies stochastic neural networks, a main type of neural network in use. We prove that as the width of an optimized stochastic neural network tends to infinity, its predictive variance on the training set decreases…

Machine Learning · Computer Science 2022-05-25 Liu Ziyin , Hanlin Zhang , Xiangming Meng , Yuting Lu , Eric Xing , Masahito Ueda

Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-03-28 Leran Cai , Thomas Sauerwald
‹ Prev 1 3 4 5 6 7 10 Next ›