相关论文: Realizability of point processes

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…

This paper is concerned with certain generalizations of meagreness and their combinatorial equivalents. The simplest example, and the one which motivated further study in this area, comes about by considering the following definition: a set…

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…

In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…

This paper consider a standard consensus algorithm under output saturations. In the presence of output saturations, global consensus can not be realized due to the existence of stable, unachievable equilibrium points for the consensus.…

The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…

We find the bounds of the size of the union of n sets satisfying the condition that the intersection of any k sets is empty. We show that any number between the upper and lower bounds can be realised, and in the measure version, the…

We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…

Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…

Any (measurable) function $K$ from $\mathbb{R}^n$ to $\mathbb{R}$ defines an operator $\mathbf{K}$ acting on random variables $X$ by $\mathbf{K}(X)=K(X_1, \ldots, X_n)$, where the $X_j$ are independent copies of $X$. The main result of this…

We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…

The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…

Motivated by Alain-Sol Sznitman's interlacement process, we consider the set of $\{0,1\}$-valued processes which can be constructed in an analogous way, namely as a union of sets coming from a Poisson process on a collection of sets. Our…

Using two results of Garkavi, Medvedev and Khavinson, we give sufficient conditions for proximinality of sums of two ridge functions with bounded and continuous summands in the spaces of bounded and continuous multivariate functions…

We study a 2-parametric family of probability measures on an infinite-dimensional simplex (the Thoma simplex). These measures originate in harmonic analysis on the infinite symmetric group (S.Kerov, G.Olshanski and A.Vershik, Comptes Rendus…

The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…

It is not uncommon in analysis that existence of extremal objects is obtained via an iterative procedure: we start from a given admissible object, then modify it, then modify again etc... If being extremal means maximimizing a real valued…

We give necessary and sufficient conditions for a sequence to be exactly realizable as the sequence of numbers of periodic points in a dynamical system. Using these conditions, we show that no non-constant polynomial is realizable, and give…