Related papers: Bounds on the mod 2 homology of random 2-dimension…

We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to…

Fix a dimension $d\ge 2$, and let $T_n$ be a random $d$-dimensional determinantal hypertree on $n$ vertices. We prove that \[\frac{\log|H_{d-1}(T_n,\mathbb{Z})|}{{{n\choose {d}}}}\] converges in probability to a constant $c_d$, which…

Let $T_n$ be a $2$-dimensional determinantal hypertree on $n$ vertices. Kahle and Newman conjectured that the $p$-torsion of $H_1(T_n,\mathbb{Z})$ asymptotically follows the Cohen-Lenstra distribution. For $p=2$, we disprove this conjecture…

We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog scale for the height H_n and saturation level h_n of the tree as n\to\infty, both almost surely and in probability. We then consider…

We study $\gamma$-vectors associated with $h^*$-vectors of symmetric edge polytopes both from a deterministic and a probabilistic point of view. On the deterministic side, we prove nonnegativity of $\gamma_2$ for any graph and completely…

In this paper we study the Linial-Meshulam model of random two-dimensional complexes. We prove that a random 2-complex is homotopically one dimensional, with probability tending to one as n tends to infitnity, assuming that the probability…

Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $\Delta_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $\lambda_1({\mathbf T}_n),\ldots,\lambda_n({\mathbf T}_n)$ be the…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…

We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^{\epsilon}} for some constant \epsilon>0, then with high probability the random graph G(n,p) contains a copy of T.…

A permutation $\boldsymbol w$ gives rise to a graph $G_{\boldsymbol w}$; the vertices of $G_{\boldsymbol w}$ are the letters in the permutation and the edges of $G_{\boldsymbol w}$ are the inversions of $\boldsymbol w$. We find that the…

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

Let $X=\Lambda\backslash\mathbb{H}$ be a Schottky surface, that is, a conformally compact hyperbolic surface of infinite area. Let $\delta$ denote the Hausdorff dimension of the limit set of $\Lambda$. We prove that for any compact subset…

We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any trees such that $T_i$ has $i$ vertices and maximum degree at most $cn/\log n$, then $\{T_1,\dots,T_n\}$ packs into $K_n$. Our main result…

For a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-universal if $G$ contains every graph in $\mathcal{F}$ as a (not necessarily induced) subgraph. For the family of all graphs on $n$ vertices and of maximum degree at most…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\Delta$, then a copy of $T$ can almost surely be found in the random graph $\mathcal{G}(n,\Delta\log^5 n/n)$.

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes. This is formalized as a hypothesis testing problem, where under the null hypothesis, the two graphs are independently generated;…

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…