Related papers: Exploring hypergraphs with martingales
We study Ramsey properties of randomly perturbed $3$-uniform hypergraphs. For~$t\geq 2$, write $\tilde K^{(3)}_t$ to denote the $3$-uniform {\it expanded} clique hypergraph obtained from the complete graph $K_t$ by expanding each of the…
We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…
We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…
For $n\geq 3$, let $r=r(n)\geq 3$ be an integer. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. In this paper, the number of linear $r$-uniform…
The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and Furedi in \cite{FF} conjectured that the $r$-graph with $m$…
We study the asymptotics of large simple graphs constrained by the limiting density of edges and the limiting subgraph density of an arbitrary fixed graph $H$. We prove that, for all but finitely many values of the edge density, if the…
We study maximal clades in random phylogenetic trees with the Yule-Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In…
We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on $n$ vertices. Let $p$ be the edge probability, and write $p=\frac{1+\vep}{2(n-1)}$ for some $\vep\in \R$. In Borgs…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\sum_{j=0}^{N}p_jz^j$…
We study the diameter of $C_1$, the largest component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ in the emerging supercritical phase, i.e., for $p = \frac{1+\epsilon}n$ where $\epsilon^3 n \to \infty$ and $\epsilon=o(1)$. This parameter…
We study the limiting spectral distribution of the normalized Laplacian $\mathcal L$ of an Erd\H{o}s-R\'enyi graph $G(n,p)$. To account for the presence of isolated vertices in the sparse regime, we define $\mathcal L$ using the…
The ubiquitous proliferation of online social networks has led to the widescale emergence of relational graphs expressing unique patterns in link formation and descriptive user node features. Matrix Factorization and Completion have become…
Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model when the number of vertices goes to infinity. By approximating the inverse of the Fisher information matrix, we…
Random hypergraph is a broad concept used to describe probability distributions over hypergraphs, which are mathematical structures with applications in various fields, e.g., complex systems in physics, computer science, social sciences,…
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…
Establishing the limiting distribution of Chatterjee's rank correlation for a general, possibly non-independent, pair of random variables has been eagerly awaited by many. This paper shows that (a) Chatterjee's rank correlation is…
Maximum entropy models, motivated by applications in neuron science, are natural generalizations of the $\beta$-model to weighted graphs. Similar to the $\beta$-model, each vertex in maximum entropy models is assigned a potential parameter,…
It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface S_g of genus g grows asymptotically like $c^{(g)}n^{5(g-1)/2-1}\gamma^n n!$ where $c^{(g)}>0$, and $\gamma \approx 27.23$ is the…