中文
相关论文

相关论文: Low for random reals and positive-measure dominati…

200 篇论文

We use ideas from topological dynamics (amenability), combinatorics (structural Ramsey theory) and model theory (Fra\" {i}ss\' e limits) to study closed amenable subgroups $G$ of the symmetric group $S_\infty$ of a countable set, where…

逻辑 · 数学 2012-05-03 Willem L. Fouche

We consider closure properties in the class of positively decreasing distributions. Our results stem from different types of dependence, but each type belongs in the family of asymptotically independent dependence structure. Namely we…

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

泛函分析 · 数学 2012-06-29 Michal Wojtylak

Concentration of measure is studied, and obtained, for stable and related random vectors.

概率论 · 数学 2007-05-23 Christian Houdre , Philippe Marchal

We generalize various notions of stability of invariant sets of dynamical systems to invariant measures, by defining a topology on the set of measures. The defined topology is similar, but not topologically equivalent to weak* topology, and…

动力系统 · 数学 2008-11-04 Sinisa Slijepcevic

Under the formalism of annealed averaging of the partition function, a type of random multifractal measures with their multipliers satisfying exponentially distributed is investigated in detail. Branching emerges in the curve of generalized…

适应与自组织系统 · 物理学 2009-10-31 Wei-Xing Zhou , Zun-Hong yu

This work focuses on the problem of exact model reduction of positive linear systems, by leveraging minimal realization theory. While determining the existence of a positive reachable realization remains in general an open problem, we are…

系统与控制 · 电气工程与系统科学 2025-09-18 Marco Cortese , Tommaso Grigoletto , Francesco Ticozzi , Augusto Ferrante

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

逻辑 · 数学 2019-09-18 Pierre Simon , Erik Walsberg

Optimization, a key tool in machine learning and statistics, relies on regularization to reduce overfitting. Traditional regularization methods control a norm of the solution to ensure its smoothness. Recently, topological methods have…

机器学习 · 计算机科学 2020-11-11 Arnur Nigmetov , Aditi S. Krishnapriyan , Nicole Sanderson , Dmitriy Morozov

For stochastic parabolic equation driven by a general stochastic measure, the weak solution is obtained. The integral of a random function in the equation is considered as a limit in probability of Riemann integral sums. Basic properties of…

概率论 · 数学 2016-06-21 Vadym Radchenko

Instability-induced random branching of deterministic dynamics is discussed as a possible mechanism of random wave function collapse. In the case of two level systems, the Born probability rule emerges as the simplest linear solution to the…

量子物理 · 物理学 2016-09-09 Isaak Mayergoyz

The notions of almost everywhere (a.e.) domination and its uniform version were introduced and studied in reverse mathematics. This paper studies these notions from a recursion-theoretic point of view and explore their connections to…

逻辑 · 数学 2014-08-12 Stephen Binns , Bjørn Kjos-Hanssen , Manuel Lerman , Reed Solomon

Let E be a locally compact second countable Hausdorff space and F the pertaining family of all closed sets. We endow F respectively with the Fell-topology, the upper Fell topology or the upper Vietoris-topology and investigate weak…

概率论 · 数学 2024-03-28 Dietmar Ferger

Can a large system be fully characterized using its subsystems via inductive reasoning? Is it possible to completely reduce the behavior of a complex system to the behavior of its simplest "atoms"? In the following paper we answer these…

量子物理 · 物理学 2018-11-19 Yakir Aharonov , Eliahu Cohen , Jeff Tollaksen

We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…

逻辑 · 数学 2015-09-29 Alex Galicki , Daniel Turetsky

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

逻辑 · 数学 2014-01-03 Jeremy Avigad , Edward Dean , Jason Rute

Invariance-based randomization tests -- such as permutation tests, rotation tests, or sign changes -- are an important and widely used class of statistical methods. They allow drawing inferences under weak assumptions on the data…

统计理论 · 数学 2022-05-31 Edgar Dobriban

Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…

组合数学 · 数学 2007-05-23 W. M. Y. Goh , P. Hitczenko , E. Schmutz

Parameter-dependent models arise in many contexts such as uncertainty quantification, sensitivity analysis, inverse problems or optimization. Parametric or uncertainty analyses usually require the evaluation of an output of a model for many…

数值分析 · 数学 2018-10-22 Anthony Nouy

We describe the multifractal nature of random weak Gibbs measures on some class of attractors associated with $C^1$ random dynamics semi-conjugate to a random subshift of finite type. This includes the validity of the multifractal…

动力系统 · 数学 2016-08-02 Zhihui Yuan