Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
137 views

Balls from bin with replacement, distinct elements, concentration inequality

Draw $n$ numbers, denoted by $a_1, a_2, \ldots, a_n$, from set $[n]$, that is, for each $i$, $a_i$ is a uniformly random number from $[n]$. Let $A = \{a_1, a_2, \ldots, a_n\}$. Then $$ \mathbb{E}[|A|]...
jsliyuan's user avatar
  • 651
1 vote
1 answer
330 views

Probability of connected graph on torus

Let $G = (V, E)$ be a graph on n vertices constructed in the following way: Each vertex $v \in V$ is positioned uniform randomly in $[0, 1] × [0, 1]$. Connect two vertices $u, v \in V$ if $d(v,u) ≤ ...
murv's user avatar
  • 75
1 vote
1 answer
608 views

Probability of k overlapping subsets in N trials

Ok, here is what I am attempting to find an answer to: I draw M uniformly random subsets of size K from the set of numbers $\Omega=\{1, \dots, N\}$ (where uniformly random means that each unique ...
Danny W.'s user avatar
  • 229
1 vote
1 answer
101 views

Probability of seeing m nonzero bits in off any d consecutive bits in a circle of n bits

Suppose n bits are arranged circularly with given condition that random k of them are 1 and rest 0, and all possible d consecutive bits (total n possibilities) are looked at, what is the probability ...
Abhijit's user avatar
  • 11
1 vote
1 answer
195 views

Concentration of a certain simple / well-structured random multilinear polynomial with growing degree

Let $k$ and $N_1$ be positive integers and set $N=kN_1$. Partition $[N] := \{1,2,\ldots,N\}$ $k$ disjoint from $G_1,\ldots,G_k$ of each of size $N_1$, and let $\mathcal T(k,N_1)$ be a transversal of ...
dohmatob's user avatar
  • 6,853
1 vote
1 answer
199 views

Rademacher complexity for a family of bounded, nondecreasing functions?

Let $\{\phi_k\}_{k=1}^K$ be a family of functions mapping from an interval $[a, b]$ to $[-1, 1]$. That is, $\phi_k \colon[ a,b] \to [-1, 1]$ are nondecreasing maps on some finite interval $[a, b] \...
Drew Brady's user avatar
1 vote
1 answer
183 views

Expectation of edge weights on the complete graph

Let $n,k \geq 3$ be positive integers with $n$ much larger than $k$ and consider a random assignment of weights to the edges of the complete graph $K_n$. On each vertex of $K_n$ we attach a random ...
Stanley Yao Xiao's user avatar
1 vote
1 answer
125 views

Empirical degree distribution of random $n$ vertices labeled rooted tree converges to Poisson distribution

I am reading Louigi's lecture note on random trees and graphs here. I get stuck on part (b), Exercise 1.2.3 on page 19, which says the following: Let $T_n$ be uniformly drawn from $\mathcal{T}_n$, ...
MikeG's user avatar
  • 715
1 vote
2 answers
50 views

Cyclic inequality for 2 dimensional simplex elements

Let $p=(p_{1},p_{2},p_{3})\in\Delta$, with $\Delta:=\lbrace p\in(0,1)^{3}\ |\ p_{1}+p_{2}+p_{3}=1 \rbrace$. I aim to prove (not knowing whether it is true though) that \begin{equation} p_{1}^{p_{3}-p_{...
Tobsn's user avatar
  • 289
1 vote
1 answer
436 views

Size of minimum cut in random graph

Consider a uniform random tournament with $n$ vertices. (Between any two vertices $x,y$, with probability $0.5$ draw an edge from $x$ to $y$; otherwise draw an edge from $y$ to $x$.) The score of each ...
pi66's user avatar
  • 1,209
1 vote
1 answer
684 views

Probability that random Bernoulli matrix is full rank

This is probably known already, but I could not find a quick argument. Let $M$ be an $n\times m$ binary matrix with iid Bernoulli$(1/2)$ entries, and $n>m$. Tikhomirov recently settled that the ...
hookah's user avatar
  • 1,096
1 vote
1 answer
105 views

What is the distribution of a Cartesian power of a collection of iid uniform points? (renewed)

The following question was asked recently at https://mathoverflow.net/questions/326631/what-is-the-distribution-of-a-cartesian-power-of-a-collection-of-iid-uniform-poi : Take a rectangle with ...
Iosif Pinelis's user avatar
1 vote
1 answer
338 views

Expected values of two non-negative, integer-valued random variables related to an urn problem

Consider an urn containing $c$ distinguishable balls, $\alpha$ of which are red, $\beta$ of which are blue, and $\gamma$ of which are green, and $\alpha+\beta+\gamma=c$. We assume $\alpha,\beta,\gamma&...
Andrea Prunotto's user avatar
1 vote
1 answer
188 views

KPZ relation $\chi = 2 \xi -1$ in a random geometric graph

If I have $n$ points uniformly distributed on the surface of a torus, and form a graph by adding an edge between pairs whenever they are within a unit distance (induced by the Euclidean metric), I ...
apg's user avatar
  • 640
1 vote
1 answer
357 views

Does CLT hold for joint distribution of two dependent binomial variables?

Let $S_n$ and $T_m$ be two binomial variables satisfying $S_n\sim B(n,\frac12)$ and $T_m\sim B(m,\frac12)$. Define $\tilde{S}_n=\frac{2S_n-n}{\sqrt{n}}$ and define $\tilde{T}_m$ similarly. For any ...
Eric Yau's user avatar
  • 111
1 vote
1 answer
394 views

On rank of random $0/1$ matrices

It is known that a $0/1$ matrix picked from uniform distribution from $\{0,1\}^{n\times n}$ is non-singular with probability $1-o(1)$. Fix an integer $t$. Consider a random matrix formed the ...
user avatar
1 vote
1 answer
121 views

Probability for high mutual coherence on all subsets of a Gaussian vector set

We examine as set of independent normal vectors: $$ \forall i \in [N]\triangleq \{1,\dots,N\}:\,\mathbf{x}_{i}\sim\mathcal{N}\left(0,\mathbf{I}_{d}\right)$$ For any $\epsilon>0$ and $K\leq N$, we ...
Daniel Soudry's user avatar
1 vote
1 answer
357 views

Analysis of a partition algorithm

EDIT: I realized that if $J$ is not a solution so is $J^c$. I updated the algorithm because of this. Given some positive integers $x_1,\cdots, x_n$. The following algorithm is for solving the ...
user avatar
1 vote
1 answer
123 views

$q$-connectedness of random digraphs obtained from a fixed graph

Let $G = (E,V)$ be an undirected graph (which can have multiple edges or loops). Let $k,l,m\colon E\to \mathbb{R}_{\geq 0}$ be three edge-weight functions that satisfy $2k(e) + l(e) + m(e) = 1$ for ...
Sam Hopkins's user avatar
  • 24.2k
1 vote
1 answer
220 views

Probabilistic statement on matrix ranks

Given $A\in\{0,1\}^{n\times n}$ with $\operatorname{rank}(A)=r=2^{O((\log_2n)^{\frac{1}{c+1}})}$. Denote $\mathsf{1_n}\in\{0,1\}^n$ as vector with $1$s. Does $$\lim_{n\rightarrow\infty}\mathsf{P_{A\...
Turbo's user avatar
  • 13.9k
1 vote
2 answers
2k views

Expected matching in a bipartite graph

Consider a random bipartite graph constructed on vertex classes of size $n$ with each edge present independently with probability $p$. How could I go about calculating the size of the expected ...
Pavan Sangha's user avatar
1 vote
1 answer
420 views

Poisson approximation of random sub-graphs

I add the edges of $G(n)$ the complete graph on $n$ vertices one by one, at random and without replacement, and denote by $G(n,m)$ the resulting Erdos Renyi random graph process. At step $m$ in the ...
Olivier's user avatar
  • 468
1 vote
1 answer
918 views

Pros and cons of probability model for permutations

I am studying probability model of random permetuation Let $b(n; k)$ denote the number of permutations of {1,...,n} with precisely k inversions ($inv(\pi)$). The analytic approach was considered by L....
Mikhail Gaichenkov's user avatar
1 vote
1 answer
2k views

Sum of covariance matrix of products of dependent variables

Consider the sequences of random variables $\{X_i\}_{i=1}^n$ and $\{Y_i\}_{i=1}^n$, as well as the corresponding sequence of products, $\{X_i Y_i\}_{i=1}^n$. All $X_i$ share the same mean value, $\...
user45947's user avatar
  • 965
1 vote
1 answer
905 views

Balls and bins: Exact probability

Suppose there are $m$ balls to be randomly thrown into $n$ bins ($m>n$). Let $X_i$ be the number of balls ending up in bin $i$. Let $X_{max}$ be the heaviest bin and $X_{min}$ be the lightest bin. ...
alexander's user avatar
1 vote
1 answer
258 views

Probability distribution for the size of an ordered set of (randomly pruned) integer pairs with intersection constraints on successive elements in the permutation

Update: To write a quick preamble, this question is basically asking that, if you take all possible pairs of some set of characters, call these pairs elements of the set $S$, and if you throw out some ...
InThePool's user avatar
1 vote
1 answer
230 views

Combinatorics for a stochastic dynamics problem

Suppose we have a circular arrangement (periodic boundaries) with $M$ sites and we want to distribute $N$ particles over these sites such that there are occupation numbers $n_m$ that respect $\sum_m ...
madison54's user avatar
1 vote
1 answer
197 views

Probability distribution on Python-dictionary-like objects?

I would like to examine information-theoretical properties of random variables that take as values objects which are akin to dictionaries in the Python programing language. That is, each sample of the ...
Lukas's user avatar
  • 11
1 vote
0 answers
72 views

How to understand "sparse graph limits"

For an $n$-vertex graph $G$, we say it is a sparse graph if $e(G)=o(n^2)$. Otherwise if $e(G)=\theta (n^2)$, we say it is a dense graph. For a sequence of dense graphs $G_1,G_2,\dots,$ we know that it ...
tom jerry's user avatar
  • 349
1 vote
0 answers
44 views

Constrained random sampling from partitioned sets with quotas

Let $D$ be a finite set, $\mathcal{P} = \{D_{i,j}\}_{(i,j) \in I \times J}$ a partition of $D$, $N: J \to \mathbb{N}$ a quota function, and $k \in \mathbb{N}^+$. A subset $F \subseteq D$ is considered ...
DataGuy553's user avatar
1 vote
0 answers
134 views

Number of ways to place 4 kings on nxn chessboard

I have a $n\times n$ chessboard and 4 kings inside it. My goal is to count the number of arrangements where some of them are non-attacking or mutually attacking, for example: In the case where the $4$...
Cardstdani's user avatar
1 vote
0 answers
84 views

Percolative process distribution not equivalent to coupon collector problem distribution

I have a process where; given a $n\times 1$ matrix initially empty, an element is inserted in it at a random position, with the possibility of repeating the insertion at a filled cell. Then, after a ...
Cardstdani's user avatar
1 vote
0 answers
84 views

How can one build a min-2-wise independent small sample space from min-3-wise permutations?

I have been studying a polynomial-size set of permutations from one of my lectures. The below image, taken from the lecture notes PDF, illustrates how to construct min-3-wise permutations. My ...
the_tomato's user avatar
1 vote
0 answers
122 views

On the derivation of some asymptotic expressions involving combinatorics

My questions come from the supplementary material in a recent preprint Nonequilibrium statistical mechanics of money/energy exchange models. My first question comes from page 35. Specifically, suppose ...
Fei Cao's user avatar
  • 730
1 vote
0 answers
62 views

Nonintersecting witnesses of connectivity events in graphs

In my research I stumbled across a following result: Let $G = (V, E)$ be a multigraph with three chosen vertices $a, b, c \in V$. We color its edges into red and blue colors: $E = R \sqcup S$. Events ...
Nikita Gladkov's user avatar
1 vote
0 answers
91 views

Large deviation inequalities for number of coupon types collected by a coupon collector with fixed budget

In the generalized Coupon Collector's Problem, there are $N$ types of coupon, and for any $i \in [N] := \{1,2,\ldots,N\}$, $p_i \ge 0$ is the probability of obtaining a type-i coupon on any trial. ...
dohmatob's user avatar
  • 6,853
1 vote
0 answers
60 views

Correct dependence for "Local Coloring"

In Alon-Spencer's book, Probabilistic Lens #8, it is proven that for each $k$, there exists $\epsilon = \epsilon(k)>0$ such that for all large $n$, there exists an $n$-vertex graph $G$ with ...
Zach Hunter's user avatar
  • 3,499
1 vote
0 answers
92 views

Can we prove the following statement for recurrence relation?

For every integer $n$, we have the following recurrence: $a_{i}= p^i(1-p)^{n-i}\binom{n}{i} -\sum_{j=i+1}^na_j\binom{j}{i}$. Can we prove that for every $n$ and $p<1/\sqrt{n}$, it holds that $\...
was_n's user avatar
  • 11
1 vote
0 answers
77 views

Distribution of colour pairs from a random matching

Given $a$ many red balls and $b$ many blue balls, with $a+b$ even, suppose we chose a random matching between the $a+b$ balls. What is the distribution of the number of red-red and red-blue (and blue-...
Lewwwer's user avatar
  • 129
1 vote
0 answers
216 views

Classical and free cumulants, symmetric functions, and inverses (references), related to associahedra, parking functions, noncrossing partitions

Looking for references for one or more of the following four sets of partition polynomials 1a) through 4a), particularly those which present geometric / topological combinatorial interpretations. ...
Tom Copeland's user avatar
  • 10.5k
1 vote
0 answers
84 views

Constructing k-wise independent variables over a general set

We have seen in class a polynomials based construction that builds in $O(n^k)$ time, $n$ random variables, $k$-wise independent, over a field with $n$ elements. More specifically, you generate all the ...
tamir's user avatar
  • 11
1 vote
0 answers
123 views

On probability of coprimality of a list of numbers

We know $r$ randomly chosen integers are coprime with probability $\frac1{\zeta(r)}$. Pick a bound $N$ and pick $k\lceil N^{\alpha}\rceil$ uniformly random integers in $[0,N^{\alpha+\beta}]$ where $\...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
122 views

Probability puzzle on partitions

Consider a set $U$ of size $n$ and let $\mathcal{S}$ be the set of all $(n/2)$-subsets of $U$ (assume $n$ is divisible by 4). Let $P$ be a partition of $\mathcal{S}$ into $k$ blocks $B_1,\dots,B_k$. ...
ARQ's user avatar
  • 11
1 vote
0 answers
664 views

The distribution of hitting time in 2D-lattice random walk [closed]

Assume a particle at $(0,0)$ with the same possibility of $1/4$ for moving up/down/left/right (i.e. random walk in 2D lattice). We define the stopping time 𝑇𝑐 as it hits $(a,b)$. How can we get the ...
Chenggang Zhao's user avatar
1 vote
0 answers
47 views

Probability that a modified $c$-bounded lattice walk is also $c$-bounded

Let $\mathcal{B}_n^{(c)}$ be the set of $n$ step lattice bridges (starts at $(0,0)$ ends at $(n,0)$), taking steps $\{(1,1), (-1,1)\}$ bounded between $y = c$ and $y = -c$ for a constant $c \geq 0$. ...
Xin Yuan Li's user avatar
1 vote
0 answers
176 views

Gaussian order statistics

Setup. Let $\alpha\in(0,1)$ fixed; and $\tau\in[0,1]$ (think of it very close to one). Suppose $X_1,\dots,X_n$ are i.i.d. standard normal. Let $Y_1,\dots,Y_n$ be another sequence of standard normals ...
ttteessttt's user avatar
1 vote
0 answers
127 views

Delocalization of eigenvectors of graph Laplacians

Let $(V,E)$ be an undirected, connected graph with $n$ nodes. The graph Laplacian is defined as $L = D - A$, where $D$ is the degree matrix and $A$ is the adjacency matrix. Let $0 = \lambda_1 < \...
Bravo's user avatar
  • 41
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
1 vote
0 answers
177 views

Probability of satisfying the congruent mod equation

I'm wondering about the probability of picking three different numbers $x,y,z$ out of the set $[50]=\left\{ 1,2,3,...,50\right\}$ satisfying the equation: $$xyz\equiv \gcd(x,y,z)\mod 7$$ I started out ...
Marek Kryspin's user avatar
1 vote
1 answer
158 views

Bound for multinomial expansion involving Poisson random variables

Let $x_i, i=1, \ldots n$ be Poisson random variables with parameters $\lambda_i$ correspondingly with condition that $\sum_{i=1}^nx_i=T$. Due to linearity of the expectation one can write: $$ E\left(\...
user124297's user avatar