Related papers: Dense and nondense limits for uniform random inter…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

We consider line ensembles of non-intersecting random walks constrained by a hard wall, each tilted by the area underneath it with geometrically growing pre-factors $\mathfrak{b}^i$ where $\mathfrak{b}>1$. This is a model for the level…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

Developing an idea of M. Gromov, we study the intersection formula for random subsets with density. The \textit{density} of a subset $A$ in a finite set $E$ is defined by $dens A := \log_{|E|}(|A|)$. The aim of this article is to give a…

A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph…

In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…

The Hermitian adjacency matrices of digraphs based on the sixth root of unity were introduced in [B. Mohar, A new kind of Hermitian matrices for digraphs, Linear Alg. Appl. (2020)]. They appear to be the most natural choice for the spectral…

An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval…

For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…

We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem.…

For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example 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…

Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at…

Let $r \geq 2$ be a fixed integer. For infinitely many $n$, let $\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple…

We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…

In this paper, we study convergence of coupled dynamical systems on convergent sequences of graphs to a continuum limit. We show that the solutions of the initial value problem for the dynamical system on a convergent graph sequence tend to…

Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…