Question

Perfect matching in a random bipartite graph with edge probability 1/2

score 522 · Answer 1 · 2026-03-25 17:43:42

522

Views

Perfect matching in a random bipartite graph with edge probability 1/2

Published on 25 Mar 2026 - 17:43

score 51 · Answer 2 · 2020-03-26 16:30:11

51

Views

Graph theory results about the spread of a boolean value over a graph (e.g. epidemic contamination)?

Published on 26 Mar 2020 - 16:30

score 37 · Answer 3 · 2020-03-27 15:43:05

37

Views

Variables of interest to describe the topology of a random graph?

Published on 27 Mar 2020 - 15:43

score 193 · Answer 4 · 2020-03-31 14:36:05

193

Views

Finding whether $f(x) = 2x+[x]+\sin x \cos x$ is increasing or decreasing.

Published on 31 Mar 2020 - 14:36

score 106 · Answer 5 · 2020-04-06 14:10:41

106

Views

Number of nodes reachable in a random digraph where each node connects to an expected $\kappa$ others

Published on 06 Apr 2020 - 14:10

score 104 · Answer 6 · 2020-04-08 23:31:53

104

Views

Simple random walk on Galton Watson trees

Published on 08 Apr 2020 - 23:31

score 99 · Answer 7 · 2026-02-23 01:25:38

99

Views

Coupling in theorem for monotone increasing class of graphs

Published on 23 Feb 2026 - 1:25

score 31 · Answer 8 · 2020-04-12 20:39:43

31

Views

Hausdorff dimension of harmonic measure for Galton Watson trees

Published on 12 Apr 2020 - 20:39

score 513 · Answer 9 · 2026-03-25 11:23:39

513

Views

Edge density in subgraphs of an Erdos-Renyi graph $G(n,p)$

Published on 25 Mar 2026 - 11:23

score 27 · Answer 10 · 2020-04-25 14:44:14

27

Views

For $X,Y,$ RVs on $\{0,1\}^V$, does $P(v \in X) \geq P(v \in Y)$ for every $v \in V$ imply that X stochastically dominates Y?

Published on 25 Apr 2020 - 14:44

score 34 · Answer 11 · 2020-04-29 12:59:08

34

Views

Constructing a large balanced bipartition of $G(2n,1/2)$ with high probability

Published on 29 Apr 2020 - 12:59

score 149 · Answer 12 · 2026-03-25 17:35:37

149

Views

Average path length in random DAG

Published on 25 Mar 2026 - 17:35

score 75 · Answer 13 · 2020-05-06 10:23:24

75

Views

Given a set of $n$ random variables, such that each $k_n$ of them are indepedent, can we say something "global" about their independence?

Published on 06 May 2020 - 10:23

score 25 · Answer 14 · 2026-03-25 17:37:09

25

Views

Adjacency spectra of a graph interpretation

Published on 25 Mar 2026 - 17:37

score 226 · Answer 15 · 2020-05-07 11:13:42

226

Views

In a connected random graph, when the degree of each node is at least 2？

Published on 07 May 2020 - 11:13

List Question

Perfect matching in a random bipartite graph with edge probability 1/2

Graph theory results about the spread of a boolean value over a graph (e.g. epidemic contamination)?

Variables of interest to describe the topology of a random graph?

Finding whether $f(x) = 2x+[x]+\sin x \cos x$ is increasing or decreasing.

Number of nodes reachable in a random digraph where each node connects to an expected $\kappa$ others

Simple random walk on Galton Watson trees

Coupling in theorem for monotone increasing class of graphs

Hausdorff dimension of harmonic measure for Galton Watson trees

Edge density in subgraphs of an Erdos-Renyi graph $G(n,p)$

For $X,Y,$ RVs on $\{0,1\}^V$, does $P(v \in X) \geq P(v \in Y)$ for every $v \in V$ imply that X stochastically dominates Y?

Constructing a large balanced bipartition of $G(2n,1/2)$ with high probability

Average path length in random DAG

Given a set of $n$ random variables, such that each $k_n$ of them are indepedent, can we say something "global" about their independence?

Adjacency spectra of a graph interpretation

In a connected random graph, when the degree of each node is at least 2？

Trending Questions

Popular # Hahtags

Popular Questions