Mathematics Problem Archive

Showing 1-50 of 141 problems (Page 1 of 3)

PreviousNext
AMR-027-0101
Partially Solved

10 Lectures and 42 Open Problems — Mallat-Zeitouni Gaussian-basis problem

v1.3 research notes

Let $X$ be a centered Gaussian random vector in $\mathbb{R}^n$ with known covariance matrix, and for an orthonormal basis $B=(b_1,\ldots,b_n)$ let $N_...

L3
Probability
AMR-027-0102
Open

10 Lectures and 42 Open Problems — Gaussian singular-value monotonicity

v1.3 research notes

For a $d\times d$ real Gaussian matrix $G_{\mathbb{R}}$ and complex Gaussian matrix $G_{\mathbb{C}}$, both normalized to entry variance $1/d$, define ...

L3
Probability
AMR-027-0103
Open

10 Lectures and 42 Open Problems — Open Problem 1.3

v1.3 research notes

Let ${W}$ denote a symmetric Wigner matrix with i.i.d. entries ${W_{ij}\sim \mathcal{N}(0,1)}$ . Also, given ${B\in\mathbb{R}^{n\times n}}$ symmetric,...

L3
Probability
AMR-027-0401
Solved

10 Lectures and 42 Open Problems — Improvement over Non-commutative Khintchine inequality

v1.3 research notes

Let $A_1,\dots,A_n\in \mathbb{R}^{d\times d}$ be symmetric matrices and $g_1,\dots,g_n\sim\mathcal{N}(0,1)$ i.i.d.. Does the following hold? $\mathbb{...

L3
Probability
AMR-027-0402
Solved

10 Lectures and 42 Open Problems — Lata $\l$ a-Riemer-Schutt

v1.3 research notes

Let $X\in\mathbb{R}^{d\times d}$ be a symmetric matrix with (otherwise) independent gaussian entries. Prove (or disprove): $\mathbb{E} \|X\| \lesssim\...

L3
Probability
AMR-027-0403
Open

10 Lectures and 42 Open Problems — Matrix version of 6 deviations suffice

v1.3 research notes

Prove or disprove: there exists a universal constant $C$ such that, for any choice of $n$ symmetric matrices $H_1,\dots,H_n\in\mathbb{R}^{n\times n}$ ...

L3
Probability
AMR-027-0404
Partially Solved

10 Lectures and 42 Open Problems — OSNAP

v1.3 research notes

Part (3) of the problem: Let $s\leq d\leq m$ and $z_1,\dots,z_m\in \mathbb{R}^d$ i.i.d. random vectors with i.i.d. entries $\left( z_k\right)_j = \lef...

L3
Probability
AMR-027-0405
Partially Solved

10 Lectures and 42 Open Problems — Random k-lifts of graphs

v1.3 research notes

Give a tight upperbound to $\mathbb{E}\left\| A^{\otimes k} -\mathbb{E} A^{\otimes k} \right\|.$...

L3
Probability
AMR-027-0406
Solved

10 Lectures and 42 Open Problems — Feige's conjecture

v1.3 research notes

Prove or disprove the following conjecture by Feige : Given $n$ independent random variables $X_1,\dots,X_n$ s.t., for all $i$ , $X_i \geq 0$ and $\ma...

L3
Probability
AMR-027-0901
Solved

10 Lectures and 42 Open Problems — Detection Threshold for SBM for three of more communities

v1.3 research notes

What is the partial recovery threshold for the Stochastic Block Model on $k\geq 3$ communities....

L3
Probability
AMR-027-0902
Solved

10 Lectures and 42 Open Problems — Recovery Threshold for SBM for logarithmic many communities

v1.3 research notes

What is the exact recovery threshold for the Stochastic Block Model with a logarithm number of communities? Both computational and information theoret...

L3
Probability
AMR-027-0903
Partially Solved

10 Lectures and 42 Open Problems — Tightness of k-median LP

v1.3 research notes

Is the k-medians Linear Programming relaxation tight even for point clouds coming from generative models that do not have a community structure?...

L3
Probability
AMR-027-0904
Partially Solved

10 Lectures and 42 Open Problems — Stability conditions for tightness of k-median LP and k-means SDP

v1.3 research notes

Can one give conditions for integrality of the k-medians LP or the k-means SDP based on stability type properties (on the fact that the data is “well-...

L3
Probability
AMR-027-0905
Partially Solved

10 Lectures and 42 Open Problems — Positive PCA tightness

v1.3 research notes

Is the Semidefinite programming relaxation for the positive Principal Component Analysis problem tight with high probability for Wigner matrices?...

L3
Probability
AMR-094-0001
Partially Solved

Probabilistic McMillan theorem in higher dimensions

v1.3 research notes

Let $X_t$ be $d$-dimensional Brownian motion starting at the origin, let $D$ be an open subset of $\mathbb{R}^d$ containing the origin, and let $\tau=...

L4
Probability
AMR-094-0002
Open

Topology of planar Brownian trace

v1.3 research notes

Let $X_t$ be two-dimensional Brownian motion. (i) For every pair $x,y \notin X[0,1]$, is there a Jordan arc $\Gamma$ containing $x$ and $y$ such that ...

L3
Probability
AMR-094-0003
Open

Percolation dimension of planar Brownian trace

v1.3 research notes

For a set $B$, define its percolation dimension as the infimum of the Hausdorff dimensions of Jordan arcs $A\subset B$ containing at least two distinc...

L3
Probability
AMR-094-0004
Open

Efficient couplings in acute triangles

v1.3 research notes

Let $D$ be a triangle whose angles are all strictly less than $\pi/2$, and let $\mu_2>0$ be the second eigenvalue of the Laplacian on $D$ with Neumann...

L3
Probability
AMR-094-0005
Open

Convergence of synchronous reflected-Brownian couplings

v1.3 research notes

Let $D\subset\mathbb{R}^2$ be a connected open set with smooth boundary, and let $X,Y$ be synchronously coupled reflected Brownian motions in $D$ driv...

L3
Probability
AMR-094-0006
Partially Solved

Non-extinction of a Fleming–Viot particle model

v1.3 research notes

Let $N$ particles move as independent Brownian motions in a bounded connected open set $D\subset\mathbb{R}^d$. Whenever a particle hits the complement...

L3
Probability
AMR-094-0007
Partially Solved

Are shy couplings necessarily rigid?

v1.3 research notes

Let $D\subset\mathbb{R}^d$, $d\ge2$, be bounded, connected, and open. Suppose there are coupled reflected Brownian motions $X_t,Y_t$ in $D$ and $\vare...

L4
Probability
AMR-094-0008
Open

Concatenated bounded Brownian pieces

v1.3 research notes

For each $k\in\mathbb{Z}$, let $B^k$ be Brownian motion and $T_k$ a stopping time, with the stopped pieces independent, $0\le T_k<\infty$, and with th...

L3
Probability
AMR-094-0009
Open

Do peaks of random labelings repel each other?

v1.3 research notes

Choose uniformly a bijective labeling of the vertices of the $n\times n$ discrete square by $1,2,\ldots,n^2$, and call a vertex a peak when all adjace...

L3
Probability
AMR-095-0001
Partially Solved

Stationary distributions in one dimension

v1.3 research notes

For the exclusion process on $\mathbb{Z}$ with $p(x,y)=p(y-x)$, assume $\sum_x|x|p(x)<\infty$, $\sum_xxp(x)>0$, and $\sum_{x<0}x^2p(x)=\infty$. Does t...

L4
Probability
AMR-095-0002
Open

Stationary distributions in higher dimensions

v1.3 research notes

On $\mathbb{Z}^2$, take nearest-neighbor jump probabilities $p_1,q_1,p_2,q_2$ in directions $\pm e_1,\pm e_2$, with $p_1>q_1$ and $p_2>q_2$. If the an...

L4
Probability
AMR-095-0003
Partially Solved

Exchangeability in the mean-zero exclusion process

v1.3 research notes

For the exclusion process on $\mathbb{Z}^d$ with translation-invariant kernel $p(x,y)=p(y-x)$ and zero mean $\sum_xxp(x)=0$, prove that every stationa...

L4
Probability
AMR-095-0004
Partially Solved

Negative association for asymmetric exclusion

v1.3 research notes

For nearest-neighbor asymmetric exclusion on $\mathbb{Z}$ with $p(1)=p>q=p(-1)$, start from the deterministic configuration $\cdots11110000\cdots$. Is...

L4
Probability
AMR-096-0001
Open

Martingale for practical purposes

v1.3 research notes

Give a mathematically useful definition of a process being a 'martingale for practical purposes', so that failure means it is practical to find a stop...

L3
Probability
AMR-096-0002
Open

Analytic toy model for a percolation-fragmentation congestion transition

v1.3 research notes

Find a simple network-and-demand toy model in which the marginal satisfiability proportion $r(t)$ can be calculated analytically and exhibits the prop...

L3
Probability
AMR-096-0003
Open

Universal compression of sparse labeled graphs

v1.3 research notes

For sparse $n$-vertex graphs of average degree $O(1)$ whose vertices have distinct $O(\log n)$-length labels over a finite alphabet, construct univers...

L3
Probability
AMR-096-0004
Open

Mixing times for coagulation-fragmentation processes

v1.3 research notes

Obtain relaxation- and mixing-time bounds for reversible coagulation-fragmentation Markov chains on finite sets in terms of their model parameters....

L3
Probability
AMR-096-0005
Open

Low-density lineage limit of coalescing branching random walk

v1.3 research notes

For the two stationary branching-coalescing models on $\mathbb{Z}^3$ described by Aldous, prove that as particle intensity tends to zero the suitably ...

L3
Probability
AMR-096-0006
Open

Constrained Ising storage model on a time-varying graph

v1.3 research notes

Study the constrained Ising storage model described on the page when the underlying graph itself changes in time....

L3
Probability
AMR-096-0007
Open

Constant-factor online scheduling of subadditive batches

v1.3 research notes

Tasks arrive as a rate-one Poisson process and have types in $[0,1]$; batch processing time $S$ is monotone and strictly subadditive and type $a$ incu...

L3
Probability
AMR-096-0008
Open

Relaxation time of Metropolis chains on Cayley graphs

v1.3 research notes

For the Metropolis chain on a finite Cayley graph with stationary law $\mu(p)$ obtained by stopping random walk at a geometric time, analyze its relax...

L3
Probability
AMR-096-0009
Open

Spectral gap of a Bayesian graph Laplacian

v1.3 research notes

For the posterior random weighted graphs $G(t)$ defined from independent Poisson edge counts and flat priors, study the process $\operatorname{gap}(G(...

L3
Probability
AMR-096-0010
Open

Sharp phase transition for SIS epidemics on general networks

v1.3 research notes

For sequences of finite weighted networks with vertex recovery rates and stationary SIS infection counts $X^{(n)}_{\theta,\varepsilon}$ satisfying the...

L3
Probability
AMR-096-0011
Open

Shortest routes in random proximity networks

v1.3 research notes

For random proximity graphs on a planar Poisson point process, determine rigorous orders of magnitude for the transversal deviation $T_r$ of a shortes...

L3
Probability
AMR-096-0012
Open

Mixing of branch rotation and triangulation chains

v1.3 research notes

For both the diagonal-flip chain on triangulations of the regular $n$-gon and the branch-rotation chain on $n$-cladograms, prove that the relaxation t...

L3
Probability
AMR-096-0013
Open

Random Eulerian excursion dichotomy on high-dimensional tori

v1.3 research notes

On the bidirected torus $\mathbb{Z}_N^d$ with fixed $d\ge3$, let $b^{(N)},t^{(N)},m^{(N)}$ count excursions of a uniform Eulerian circuit longer than ...

L3
Probability
AMR-096-0014
Open

Second-longest Eulerian excursion on the two-dimensional torus

v1.3 research notes

For a uniform Eulerian circuit on the bidirected two-dimensional torus, does $\log L_2^{(N)}/\log N$ converge in distribution to a random variable wit...

L3
Probability
AMR-096-0015
Open

Excursion counts in a random Eulerian circuit on a complete graph

v1.3 research notes

On the bidirected complete $n$-vertex graph, is the expected number of length-$i$ excursions in a uniform Eulerian circuit asymptotic to $e^{-i/n}$?...

L3
Probability
AMR-096-0016
Open

Shortest Eulerian excursion on the Hamming cube

v1.3 research notes

For a uniform Eulerian circuit on the bidirected Hamming cube $\{0,1\}^d$, determine the asymptotic behavior or distribution of the shortest excursion...

L3
Probability
AMR-096-0017
Open

Eulerian-circuit continuum limits and SLE

v1.3 research notes

Is there a relation between space-filling $\operatorname{SLE}_\kappa$ for $\kappa>8$ and the conjectural continuum limit of uniform Eulerian circuits ...

L3
Probability
AMR-096-0018
Open

Stretch-length exponent in spatial networks

v1.3 research notes

Improve the explicit upper and lower bounds for the minimum network length functions $\Psi^{ave}(s)$ and $\Psi^{worst}(s)$, and prove whether there is...

L3
Probability
AMR-096-0019
Open

Largest common subcladogram exponents

v1.3 research notes

For two independent random $n$-cladograms, under both the uniform and coalescent distributions, prove $\mathbb{E}C_n=n^{\gamma+o(1)}$ for respective c...

L3
Probability
AMR-096-0020
Open

Largest common suborder of two random two-dimensional orders

v1.3 research notes

For two independent coordinatewise partial orders generated by uniform points in the unit square, prove $\mathbb{E}C_n\sim c n^{1/3}$ and establish th...

L3
Probability
AMR-096-0021
Open

Percolation criteria for merging planar empires

v1.3 research notes

For continuous-time processes that merge adjacent polygonal planar regions $A,B$ at a geometry-dependent rate $r(A,B)$, give sufficient conditions on ...

L3
Probability
AMR-096-0022
Open

Percolation of planar empires at unit merger rate

v1.3 research notes

When every adjacent pair of planar empires merges at rate $r(A,B)=1$, does percolation occur?...

L3
Probability
AMR-096-0023
Partially Solved

Unbalanced regimes of the spatial city-growth model

v1.3 research notes

For the city-growth model, prove: (a) if $\alpha>1$, the eventual number of cities $M(\infty)$ is finite almost surely; (b) if $\beta<2\alpha$, the la...

L3
Probability
PreviousNext