Skip to main content

Questions tagged [randomness]

Randomness is a way to mathematically model uncertainty. We often assume to have access to some well-defined source of random numbers, or that input values or events follow some probability distribution.

1 vote
1 answer
104 views

I am very new to statistics and bioinformatics. For my project, I have been creating a certain number of sets of n patients and splitting them into subsets, say HA and HB, each containing equal number ...
Liana Mukherjee's user avatar
0 votes
0 answers
36 views

I wonder how should I state the communication complexity when having a linear PCP combined with another protocol? May I ask that if I have a protocol that utilizes a linear PCP that has proof length n,...
js wang's user avatar
  • 101
2 votes
1 answer
173 views

Inspired by this SO post, I'd like to generate random bitstrings of a length $n$, having at most $k$ bits set for some $k$. Bitstrings should be selected uniformly at random amongst all possible ...
nneonneo's user avatar
  • 226
1 vote
0 answers
55 views

We are currently learning derandomization, which aims to transfer a probabilistic proof into a deterministic algorithm. My problem is as follows. Given $n$, constructs in time polynomial in $n$, a ...
Zeta's user avatar
  • 111
2 votes
0 answers
50 views

Let's say I have a random variable $V$ which takes values from the finite set $V = \{v_1, v_2,...,v_N \}$. I want to pick one value randomly based on given probabilities $p_i = \Pr(V=v_i)$. Let's call ...
Hamed's user avatar
  • 121
9 votes
1 answer
662 views

For concreteness, here's the specific problem description: suppose we have a set $S$ of $n$ items $a_1, a_2, \ldots, a_n$ with weights $w_1, w_2, \ldots, w_n$ respectively. The goal is to select a ...
Steven Stadnicki's user avatar
12 votes
5 answers
3k views

Suppose we've to pick $K (\le N)$ random integers in the range $[0, N - 1]$ for very large $N$ such that there is no repetition, while also deterministically minimizing the number of calls made to the ...
bihariforces's user avatar
0 votes
1 answer
64 views

Suppose a polynomial time machine that has an access to a polynomially long string of bits independent on the input. On average, it's impossible to compress this string to a subpolynomially long ...
rus9384's user avatar
  • 2,151
0 votes
1 answer
60 views

I looked through Java's Random class and saw that the initial seed is created using: ...
Vishal's user avatar
  • 1
2 votes
0 answers
134 views

As it stands, the general consensus seems to be that BPP = P. If this conjecture were indeed true, what would be some of the philosophical implications beyond theoretical computer science? I know that ...
Ashvin Jagadeesan's user avatar
1 vote
1 answer
83 views

Random number generators commonly found in default libraries are actually pseudo-random number generators. Nevertheless, more sophisticated options exist to gather entropy from "truly"-...
Rexcirus's user avatar
  • 181
-1 votes
1 answer
101 views

I'm interested in analyzing the randomness of strings using relative count for 1-, 2-, etc tuples. E.g. for a long string "abbccba.." with an alphabet <...
lesobrod's user avatar
  • 111
3 votes
0 answers
83 views

There must be a complexity class C that includes exactly the problems that can be solved in exponential time and having access to a truly random coin (which in turns implies that you will be able to ...
Alonso Montero's user avatar
0 votes
1 answer
100 views

Background I'm looking to replicate (as closely as possible) the graphs depicted in this question (in MetaPost). Overview The green edges and large green nodes in the following image depict a graph (...
Dave Jarvis's user avatar
-1 votes
1 answer
85 views

While studying Shannon's notion of perfect secrecy I came upon the idea that a bit is perfectly random if it happens to be 0 or 1 with an equal probability. What does this mean? Also, what can we say ...
Kashish's user avatar

15 30 50 per page
1
2 3 4 5
18