Mathematics Problem Archive

Showing 1-50 of 93 problems (Page 1 of 2)

PreviousNext
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-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-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-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-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-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-0024
Open

Growth exponents in the balanced city-growth regime

v1.3 research notes

In the balanced regime $0<\alpha<1$ and $\beta>2\alpha$, prove that the upper and lower growth exponents for influence and city population all equal $...

L3
Probability
AMR-096-0025
Open

Largest-city growth at alpha=1

v1.3 research notes

If $\alpha=1$ and $\beta>2$, prove $N_{(1)}(t)=t(\log t)^{1-2/\beta+o(1)}$ almost surely....

L3
Probability
AMR-096-0026
Open

Stability dichotomy for the associated city dynamical system

v1.3 research notes

For the associated influence-cell dynamical system in general position with positive initial weights, prove that one weight tends to $1$ if $\alpha>1$...

L3
Probability
AMR-096-0029
Open

Feasible statistic triples for SIRSNs

v1.3 research notes

Determine the set of possible triples $(\Delta=\mathbb{E}D_1,\ell,p(1))$ over all scale-invariant random spatial networks....

L3
Probability
AMR-096-0030
Open

Optimal length-route tradeoff for SIRSNs

v1.3 research notes

Give quantitative estimates improving the known bound on $\ell^*(\Delta)$, the infimum edge intensity among SIRSNs with mean unit-distance route lengt...

L3
Probability
AMR-096-0031
Open

Local finiteness of SIRSN traffic intensity

v1.3 research notes

Show, perhaps under regularity hypotheses on a SIRSN, that for $2<\beta<4$ the paper's source-destination measure with displacement density $|z|^{-\be...

L3
Probability
AMR-096-0033
Open

Unbounded component uniqueness in a SIRSN

v1.3 research notes

Does the major-road subnetwork $E(\infty,1)$ of a SIRSN almost surely have exactly one unbounded connected component?...

L3
Probability
AMR-096-0034
Open

Integrability of all routes to random points in a SIRSN

v1.3 research notes

Under what additional assumptions, if any, is $\mathbb{E}\sup_{i\ge1}\operatorname{len}[R(0,U_i)]<\infty$ for independent uniform points $U_i$ in the ...

L3
Probability
AMR-096-0035
Open

Expected length of a SIRSN spanning subnetwork

v1.3 research notes

For $k$ uniform random points $Z_1,\ldots,Z_k$ in a square of area $k$, prove $\mathbb{E}\operatorname{len}[\operatorname{span}(Z_1,\ldots,Z_k)]\sim\e...

L3
Probability
AMR-096-0036
Open

SIRSN subnetworks cannot be trees

v1.3 research notes

Prove that in a scale-invariant random spatial network the subnetwork $S(1)$ cannot be a tree, even allowing Steiner points....

L3
Probability
AMR-096-0039
Open

Online minimum spanning tree constant

v1.3 research notes

For the complete graph with i.i.d. uniform edge weights revealed online, prove that the minimum expected cost $\mathbb{E}Y_n$ of an online spanning-tr...

L3
Probability
AMR-096-0040
Open

Stationary law of a drift-jump particle process

v1.3 research notes

Give a reasonably explicit description of the unique stationary distribution of the one-dimensional Hammersley-type process whose particles drift righ...

L3
Probability
AMR-096-0042
Open

Near-one asymptotics for oriented-percolation flow

v1.3 research notes

For the limiting maximum-flow density $v(p)$ in oriented bond percolation on the square lattice, prove $1-v(p)\sim\sqrt{2(1-p)}$ as $p\uparrow1$....

L3
Probability
AMR-098-0005
Open

Setwise convergence versus total-variation convergence of shifted processes

v1.3 research notes

Let $X$ and $X'$ be discrete-time stochastic processes on the same state space, and let $\theta_n$ denote the shift. If $\mathbb{P}(\theta_nX\in A)\to...

L3
Probability
AMR-098-0006
Open

Coupling characterization of setwise asymptotic stationarity

v1.3 research notes

If setwise convergence $\mathbb{P}(\theta_nX\in A)\to\mathbb{P}(X'\in A)$ for every measurable path-space set $A$ does not imply total-variation conve...

L3
Probability
AMR-098-0007
Open

Two-process coupling characterization of weak convergence

v1.3 research notes

Suppose $\theta_nX$ converges in distribution to $X'$ on a separable metric path space. Is there a coupling characterization involving only a joint co...

L3
Probability
AMR-099-0013
Open

Scaling limit of random recursive square subdivision

v1.3 research notes

Start with a unit square and repeatedly choose a current square uniformly and subdivide it into four squares. Let $D_n$ be the minimum number of curre...

L3
Probability
AMR-099-0019
Open

Isoperimetric dimension and nontrivial percolation threshold

v1.3 research notes

Let $G$ be an infinite bounded-degree graph. Prove that $\operatorname{I-dim}(G)>1$ implies $p_c(G)<1$. As a weaker target, prove the conclusion when ...

L3
Probability
PreviousNext