Mathematics Problem Archive

Showing 2551-2600 of 3440 problems (Page 52 of 69)

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
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-0027
Partially Solved

A mathematically natural SIRSN

v1.3 research notes

Construct a scale-invariant random spatial network whose law is mathematically natural, for example with an explicit formula for the distribution of $...

L3
Probability
AMR-096-0028
Partially Solved

A visually realistic SIRSN

v1.3 research notes

Construct a scale-invariant random spatial network that is visually realistic, in the sense of not looking very different from a real-world road netwo...

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-0032
Partially Solved

Converse implications among SIRSN properties

v1.3 research notes

Prove or disprove each of the proposed implications between the SIRSN properties numbered (16), (20), (49), (50), and (51): (16)$\Rightarrow$(20), uni...

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-0041
Partially Solved

Topological realization of compact Markov-chain limits

v1.3 research notes

For the measure-theoretic limit transition densities $p_\infty(x,y,t)$ arising from sequences of finite reversible Markov chains, construct a natural ...

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-0001
Solved

Relative age in a null-recurrent renewal process

v1.3 research notes

Let $S_n=S_0+X_1+\cdots+X_n$ be a renewal process whose i.i.d. strictly positive recurrence times have infinite mean and a non-lattice distribution. I...

L3
Probability
AMR-098-0002
Partially Solved

Scaling total life in a null-recurrent renewal process

v1.3 research notes

For the null-recurrent renewal process of Problem 1.1, is there a non-decreasing function $\phi$ such that $D_t/\phi(t)$ converges in distribution to ...

L3
Probability
AMR-098-0003
Partially Solved

Joint limit of total life and relative age

v1.3 research notes

For the null-recurrent renewal process of Problems 1.1–1.2, assuming their answers are positive, does $(D_t/\phi(t),U_t)$ converge in distribution to ...

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-0001
Open

Conjecture 0.1 — Is there an infinite expander?

v1.3 research notes

Call an infinite connected graph $G$ of uniformly bounded degree an infinite expander if there is a constant $c>0$ such that, for every vertex set $S$...

L3
Graph Theory
AMR-099-0002
Open

Finite groups in the property-T collapse window

v1.3 research notes

In Gromov's density model with generators $a,a^{-1},b,b^{-1}$, choose $3^{nd}$ relators independently and uniformly from the reduced words of length $...

L3
Group Theory
AMR-099-0003
Partially Solved

Equilibrium point configurations on the line

v1.3 research notes

Let $(a_n)_{n\in\mathbb{Z}}$ be a locally finite configuration of points on $\mathbb{R}$. For the force law $F(x,y)=|x-y|^{-2}$, call the configuratio...

L3
Analysis
AMR-099-0004
Open

Explicit bound for symmetric point configurations on the sphere

v1.3 research notes

Call a finite subset $X\subset S^2$ symmetric if a finite group acts transitively on $X$ by isometries. Determine an explicit universal upper bound fo...

L3
Geometry
AMR-099-0005
Open

Additive-error graph model of the Euclidean plane

v1.3 research notes

Does there exist a graph $G$ and a map $f:V(G)\to\mathbb{R}^2$ such that $|\|f(x)-f(y)\|_2-d_G(x,y)|<C$ for every $x,y\in V(G)$ and some constant $C<\...

L3
Graph Theory
AMR-099-0006
Open

Nonamenable subgraphs of transitive graphs with exponential growth

v1.3 research notes

Must every vertex-transitive graph of exponential growth contain an infinite subgraph $H$ with positive Cheeger constant $h(H)>0$? Can $H$ always be c...

L3
Graph Theory
AMR-099-0007
Open

Nonamenable subgraphs under uniform exponential growth

v1.3 research notes

Must every graph with uniform exponential volume growth contain an infinite subgraph, possibly a tree, having positive Cheeger constant?...

L3
Graph Theory
AMR-099-0008
Solved

Transient subtrees of hyperbolic graphs

v1.3 research notes

Prove that every bounded-degree transient hyperbolic graph contains a transient subtree....

L3
Graph Theory
AMR-099-0009
Open

Vertex-transitive sub-scale-invariant graphs

v1.3 research notes

Does there exist a vertex-transitive graph whose multiplicative rough-isometry constants to its $k$-net graphs tend to $1$ as $k\to\infty$?...

L3
Graph Theory
AMR-099-0010
Open

Unbounded descent through iterated graph nets

v1.3 research notes

Does there exist a graph for which repeatedly passing to $k$-net graphs, at appropriately chosen scales, produces strictly smaller large-scale graph m...

L3
Graph Theory
AMR-099-0011
Open

Cheeger constants of nets in transitive graphs

v1.3 research notes

Let $G$ be vertex-transitive and let $G_k$ be a $k$-net graph of $G$. Must $h(G_k)\ge h(G)$ whenever $G_k$ is not a single vertex?...

L3
Graph Theory
AMR-099-0012
Open

Uniform expansion bounds for graph nets

v1.3 research notes

There is a positive function $f(h,d,k)$ such that every graph $G$ with $h(G)>h>0$ and maximum degree less than $d$ has $h(G_k)>f(h,d,k)$ for each $k$-...

L3
Graph Theory