English
Related papers

Related papers: Realizability of point processes

200 papers

Exploiting the explicit bijection between the density of singular values and the density of eigenvalues for bi-unitarily invariant complex random matrix ensembles of finite matrix size, we aim at finding the induced probability measure on…

Probability · Mathematics 2026-03-24 Matthias Allard , Mario Kieburg

A sequence $a=(a_n)_{n=1}^\infty$ of non-negative integers is called realizable if there is a self-map $T:X\to X$ on a set $X$ such that $a_n$ is equal to the number of periodic points of $T$ in $X$ of (not necessarily exact) period $n$,…

Number Theory · Mathematics 2024-03-01 Geng-Rui Zhang

We consider "unconstrained" random $k$-XORSAT, which is a uniformly random system of $m$ linear non-homogeneous equations in $\mathbb{F}_2$ over $n$ variables, each equation containing $k \ge 3$ variables, and also consider a "constrained"…

Combinatorics · Mathematics 2013-10-01 Boris Pittel , Gregory B. Sorkin

We prove a strong approximation result for the empirical process associated to a stationary sequence of real-valued random variables, under dependence conditions involving only indicators of half lines. This strong approximation result also…

Probability · Mathematics 2013-10-22 Jérôme Dedecker , Florence Merlevède , Emmanuel Rio

A numeric function $\rho$: $\rho(k)=1+\frac{k-1}{k+1}, k \in N$ was considered in [1]. In its terms criterions of finite representability and tameness of marked quivers, posets with equivalence and dyadic posets can be obtained; Dynkin…

Representation Theory · Mathematics 2007-05-23 I. K. Redchuk , A. V. Roiter

We study the problem of constructing positive representations of complex measures. In this paper we consider complex densities on a direct product of $U(1)$ groups and look for representations by probability distributions on the…

High Energy Physics - Lattice · Physics 2017-12-21 Erhard Seiler , Jacek Wosiek

We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…

Computational Complexity · Computer Science 2021-11-08 Mikkel Abrahamsen , Linda Kleist , Tillmann Miltzow

Consider the following local empirical process indexed by $K\in \mathcal{G}$, for fixed $h>0$ and $z\in \mathbb{R}^d$: $$G_n(K,h,z):=\sum_{i=1}^n K \Bigl(\frac{Z_i-z}{h^{1/d}}\Big) - \mathbbE \Bigl(K \Bigl(\frac{Z_i-z}{h^{1/d}}\Big)\Big),$$…

Statistics Theory · Mathematics 2008-11-13 Davit Varron

We raise the question of realizability of group actions which is an extended version of the 1960's Kahn realizability problem for (abstract) groups. Namely, if $M$ is a $\mathbb ZG$-module for a group $G$, we say that a simply-connected…

Algebraic Topology · Mathematics 2015-11-20 Cristina Costoya , Antonio Viruel

We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…

Dynamical Systems · Mathematics 2020-10-26 Hermes H. Ferreira , Artur O. Lopes , Elismar R. Oliveira

We consider the random interlacements process with intensity $u$ on ${\mathbb Z}^d$, $d\ge 5$ (call it $I^u$), built from a Poisson point process on the space of doubly infinite nearest neighbor trajectories on ${\mathbb Z}^d$. For $k\ge 3$…

Probability · Mathematics 2012-07-05 Hubert Lacoin , Johan Tykesson

This paper proposes a novel method for testing observability in Gaussian models using discrete density approximations (deterministic samples) of (multivariate) Gaussians. Our notion of observability is defined by the existence of the…

Systems and Control · Electrical Eng. & Systems 2022-08-19 Ariane Hanebeck , Claudia Czado

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

Combinatorics · Mathematics 2026-02-25 Mahdi Koutchoukali

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…

Machine Learning · Computer Science 2022-09-02 Mónika Csikós , Nabil H. Mustafa

A strictly increasing sequence (n_k) of positive integers is said to be a Hilbertian Jamison sequence if for any bounded operator T on a separable Hilbert space such that the supremum over k of the norms ||T^{n_k}|| is finite, the set of…

Functional Analysis · Mathematics 2011-06-14 Tanja Eisner , Sophie Grivaux

A crucial part of data analysis is the validation of the resulting estimators, in particular, if several competing estimators need to be compared. Whether an estimator can be objectively validated is not a trivial property. If there exists…

Statistics Theory · Mathematics 2024-05-17 Tino Werner

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

Probability · Mathematics 2016-07-06 Richard Arratia , Stephen DeSalvo

Lineability is a property enjoyed by some subsets within a vector space X. A subset A of X is called lineable whenever A contains, except for zero, an infinite dimensional vector subspace. If, additionally, X is endowed with richer…

Functional Analysis · Mathematics 2013-09-17 Luis Bernal-González , Manuel Ordóñez-Cabrera

Let $X_{t}$ denote a stationary first-order autoregressive process. Consider five contiguous observations (in time $t$) of the series (e.g., $X_{1}, ..., X_{5}$). Let $M$ denote the maximum of these. Let $\rho$ be the lag-one serial…

History and Overview · Mathematics 2019-08-13 Steven Finch

We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…

Neural and Evolutionary Computing · Computer Science 2016-06-16 Christos Papadimitrou , Samantha Petti , Santosh Vempala