Related papers: Exploring hypergraphs with martingales
In this paper we establish asymptotics (as the size of the graph grows to infinity) for the expected number of cliques in the Chung--Lu inhomogeneous random graph model in which vertices are assigned independent weights which have tail…
The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total…
We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries…
Let $X_1,..., X_n$ be independent, uniformly random points from $[0,1]^2$. We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points $n$…
In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…
Let integer $n \ge 3$ and integer $r = r(n) \ge 3$. Define the binomial random $r$-uniform hypergraph $H_r(n, p)$ to be the $r$-uniform graph on the vertex set $[n]$ such that each $r$-set is an edge independently with probability $p$. A…
Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…
In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the giant component, most notably its expansion characteristics.…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper…
We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…
Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference,for instance GLM techniques, and model verification methods will require knowing test statistics are…
We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…