中文
相关论文

相关论文: Randomness

200 篇论文

We derive in this article sufficient conditions in the natural terms for belonging of almost all the trajectories of the certain separable continuous in probability random field to the multivariate Prokhorov-Skorokhod space. We consider…

概率论 · 数学 2017-10-17 E. Ostrovsky , L. Sirota

Algorithmic modeling relies on limited information in data to extrapolate outcomes for unseen scenarios, often embedding an element of arbitrariness in its decisions. A perspective on this arbitrariness that has recently gained interest is…

机器学习 · 计算机科学 2025-08-11 Prakhar Ganesh , Afaf Taik , Golnoosh Farnadi

This book covers the history of probability up to Kolmogorov with essential additional coverage of statistics up to Fisher. Based on my work of ca. 50 years, it is the only suchlike book. Gorrochurn (2016) is similar but his study of events…

历史与综述 · 数学 2018-02-28 Oscar Sheynin

Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…

逻辑 · 数学 2012-10-18 Pavel Pudlak

The notion of random sequence was introduced by Martin-Loef in 1966. At the same time he defined the so-called randomness deficiency function that shows how close are random sequences to non-random (in some natural sense). Other deficiency…

逻辑 · 数学 2016-08-31 Gleb Novikov

In a paper entitled singularities of invariant densities for random switching between two linear odes in 2D, Bakhtin et al [5], consider a Markov process obtained by random switching between two stable linear vector fields in the plane and…

概率论 · 数学 2024-07-19 Michel Benaim , Améthyste Bichard

We summarize our recent findings, where we proposed a framework for learning a Kolmogorov model, for a collection of binary random variables. More specifically, we derive conditions that link outcomes of specific random variables, and…

机器学习 · 计算机科学 2018-06-07 Hadi Ghauch , Mikael Skoglund , Hossein Shokri-Ghadikolaei , Carlo Fischione , Ali H. Sayed

Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…

计算复杂性 · 计算机科学 2012-03-12 Daniil Musatov

Though the ability of human beings to deal with probabilities has been put into question, the assessment of rarity is a crucial competence underlying much of human decision-making and is pervasive in spontaneous narrative behaviour. This…

其他计算机科学 · 计算机科学 2011-08-25 Jean-Louis Dessalles

This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…

统计理论 · 数学 2020-06-09 Vladimir Vovk

In recent years, random matrices have come to play a major role in computational mathematics, but most of the classical areas of random matrix theory remain the province of experts. Over the last decade, with the advent of matrix…

概率论 · 数学 2015-01-08 Joel A. Tropp

Complexity is an inherent attribute of any project. The purpose of defining and documenting complexity is to have an early warning tool allowing a project team to focus on certain areas and aspects of the project in order to prevent and…

软件工程 · 计算机科学 2015-12-25 Alexei Botchkarev , Patrick Finnigan

Mutual information I in infinite sequences (and in their finite prefixes) is essential in theoretical analysis of many situations. Yet its right definition has been elusive for a long time. I address it by generalizing Kolmogorov Complexity…

计算复杂性 · 计算机科学 2021-08-03 Leonid A. Levin

Probabilistic models require the notion of event space for defining a probability measure. An event space has a probability measure which ensues the Kolmogorov axioms. However, the probabilities observed from distinct sources, such as that…

信息检索 · 计算机科学 2012-03-13 Massimo Melucci

This book is devoted to the problem of sequential probability forecasting, that is, predicting the probabilities of the next outcome of a growing sequence of observations given the past. This problem is considered in a very general setting…

机器学习 · 计算机科学 2025-04-22 Daniil Ryabko

In the present paper a behavior of the "average case" approximation complexity for d-parametric random fields of tensor-type is studied. It was shown in [Lifshits and Tulyakova, 2006] that for a given approximation accuracy level the…

概率论 · 数学 2012-08-16 N. A. Serdyukova

Prediction of events is the challenge in many different disciplines, from meteorology to finance; the more this task is difficult, the more a system is {\it complex}. Nevertheless, even according to this restricted definition, a general…

chao-dyn · 物理学 2007-05-23 Maurizio Serva

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

组合数学 · 数学 2024-09-16 Swee Hong Chan , Igor Pak

This is a collection of teaching materials used in several Russian universities, schools, and mathematical circles. Most problems are chosen in such a way that in the course of the solution and discussion a reader learns important…

It is not obvious what fraction of all the potential information residing in the molecules and structures of living systems is significant or meaningful to the system. Sets of random sequences or identically repeated sequences, for example,…

信息论 · 计算机科学 2008-01-28 David J. Galas , Matti Nykter , Gregory W. Carter , Nathan D. Price , Ilya Shmulevich