中文
相关论文

相关论文: How close can we come to a parity function when th…

200 篇论文

Suppose X is a frequency vector that follows a central multiple hyper-geometric distribution, such as arises in random sampling of an m-category attribute from a finite population without replacement. We show that the probability that X…

概率论 · 数学 2023-11-30 Bruce Levin

Any semigroup $\mathcal{S}$ of stochastic matrices induces a semigroup majorization relation $\prec^{\mathcal{S}}$ on the set $\Delta_{n-1}$ of probability $n$-vectors. Pick $X,Y$ at random in $\Delta_{n-1}$: what is the probability that…

We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these…

群论 · 数学 2016-06-03 Alexander Bors

We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as…

计算机科学与博弈论 · 计算机科学 2014-09-12 Aris Filos-Ratsikas , Peter Bro Miltersen

Given a square integrable m-dimensional random variable $X$ on a probability space $(\Omega.\mathcal F,\Pr)$ and a sub sigma algebra $\mathcal A$, we show that there exists another m-dimensional random variable $Y$, independent of $\mathcal…

概率论 · 数学 2022-06-07 Freddy Delbaen , Chitro Majumdar

We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…

群论 · 数学 2019-10-31 Alexander Bors

We prove that there exists a constant $\gamma_{\mathrm{crit}}\approx .17566$ such that if $G\sim \mathbb{G}(n,1/2)$ then for any $\varepsilon > 0$ with high probability $G$ has a equipartition such that each vertex has…

概率论 · 数学 2023-05-08 Dor Minzer , Ashwin Sah , Mehtaab Sawhney

For positive integers $n$ and $d$, and the probability function $0\leq p(n)\leq 1$, we let $Y_{n,p,d}$ denote the probability space of all at most $d$-dimensional simplicial complexes on $n$ vertices, which contain the full…

代数拓扑 · 数学 2009-04-13 Dmitry N. Kozlov

In this paper, we investigate the distributions of random couples $(X,Y)$ with $X$ real-valued such that any non-negative integrable random variable $f(X)$ can be represented as a conditional expectation, $f(X)=\mathbb{E}[g(Y)|X]$, for some…

概率论 · 数学 2025-08-08 Julien Guyon , Thibault Jeannin , Benjamin Jourdain

If we pick two elements of a non-abelian group at random, the odds this pair commutes is at most 5/8, so there is a "gap" between abelian and non-abelian groups \cite{G}. We prove a "topological" generalization estimating the odds a word…

群论 · 数学 2012-05-29 John Mangual

Generalized Friedman urn is one of the simplest and most useful models considered in probability theory. Since Athreya and Ney (1972) showed the almost sure convergence of urn proportions in a randomized urn model with irreducible…

概率论 · 数学 2022-04-12 Li-Xin Zhang

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

组合数学 · 数学 2014-09-23 Noga Alon , Tom Bohman , Hao Huang

By probabilistic logic I mean a normative theory of belief that explains how a body of evidence affects one's degree of belief in a possible hypothesis. A new axiomatization of such a theory is presented which avoids a finite additivity…

人工智能 · 计算机科学 2013-04-10 Romas Aleliunas

Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated, in particular when X 1 is not…

概率论 · 数学 2021-01-21 Fabien Brosset , Thierry Klein , Agnès Lagnoux , Pierre Petit

The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…

计算复杂性 · 计算机科学 2020-05-13 Yunhao Yang , Andrew Tan

We estimate the expected value of certain function $f:\{-1,1\}^{n}\to\mathbb{R}$. For example, with computer assistance, we show that if $\Delta$ is the Laplacian of the Cayley graph of…

概率论 · 数学 2019-10-15 March T. Boedihardjo

We investigate the sufficient conditions for boundedness of one type of difference equations of the form $x(n+1)=ax(n)+f(x(n)) + y(n), \ n\geq 1$ in critical case $|a|=1$. For this equation the following assumptions are introduced: 1) The…

动力系统 · 数学 2025-09-16 Andrii Chaikovskyi , Oleksandr Liubimov

Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…

算子代数 · 数学 2009-09-10 Huaxin Lin

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

数论 · 数学 2023-08-16 Lior Bary-Soroker , Dimitris Koukoulopoulos , Gady Kozma

We consider a one-dimensional discrete symmetric random walk with a reflecting boundary at the origin. Generating functions are found for the 2- dimensional probability distribution P{Sn = x,max1?j?n Sn = a} of being at position x after n…

概率论 · 数学 2013-05-27 Jerome K. Percus , Ora E. Percus