Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 74918

Theory and applications of probability and stochastic processes: e.g. central limit theorems, large deviations, stochastic differential equations, models from statistical mechanics, queuing theory.

2 votes
0 answers
80 views

Small set in partition-large class

A collection $\mathcal{A}\subseteq \mathcal{P}(X)$ is $k$-large in $X$ if for every $k$-partition of $X$ namely $X_1,\cdots,X_k$, there exists an $i\leq k$ such that $X_i\in \mathcal{A}$; $\mathcal …
Jiayi Liu's user avatar
  • 909
3 votes
1 answer
141 views

The size of monochromatic submatrix

We say a matrix $(a_{ij})$ is 0-1 matrix if $a_{ij}\in \{0,1\}$ for all $i,j$. We say a matrix $(a_{ij})$ is monochromatic if for some $a$, $a_{ij} = a$ for all $i,j$. Question: Let $c\geq 1/2$ be a …
Jiayi Liu's user avatar
  • 909
2 votes
1 answer
165 views

Covering subset with large probability

Let $c>0$, $0<\lambda<1$, and let $k\in \mathbb{N}$ be sufficiently large. Let $X$ be a uniformly random subset of $\{1,\cdots,N\}$. Denote by $[N]^x$ the collection of $[x]$-element subset of $\{1,\c …
Jiayi Liu's user avatar
  • 909
1 vote
0 answers
47 views

Stochastically coloring a graph in a local way

Suppose you are assigning values in $S$ (assume $|S|<\infty$) to nodes of a (directed) graph in a stochastic way. At the beginning, none of the node is assigned values. At the $i^{th}$ step, you (unif …
Jiayi Liu's user avatar
  • 909
1 vote
0 answers
85 views

Winning criterion for a combinatorial game

Given $n$, let $\mathcal{R}$ be a set of pairs $(\rho,A)$ where $A\subseteq n, \rho\in 2^A$. Consider the following game between A and B. At each round $t$, A enumerates an $m\in n$ (that has not been …
Jiayi Liu's user avatar
  • 909
6 votes
1 answer
349 views

Ramsey type theorem

Let $\mathcal{P}(\{0,\dotsc,7\})$ denote the power set of $\{0,\dotsc,7\}$. Is the following true? For any function $f: \mathcal{P}(\{0,\dotsc,7\})\rightarrow\{0,1\}$ there exists $0\leq k\leq 3$ …
Jiayi Liu's user avatar
  • 909
3 votes
1 answer
222 views

Density of a somewhat random set

The density of a set $X\subseteq\omega$ refers to: $\limsup\limits_{n\rightarrow\infty}\dfrac{C\cap n}{n}$. Given a set of positive integers $F= \{m_0<\cdots<m_{k-1}\}$, let $C\subseteq \omega$ be s …
Jiayi Liu's user avatar
  • 909
4 votes
0 answers
111 views

Set version of ramsey type problem

For two sets of numbers $A,B$, write $A<B$ iff $\max A<\min B$. For a sequence of integers $a_0,\cdots,a_{n-1}>0$, let $Prop(a_0,\cdots,a_{n-1})$ denote the following proposition: Given $n$ sets of i …
Jiayi Liu's user avatar
  • 909