Related papers: Degrees in the $\beta$- and $\beta'$-Delaunay grap…
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 consider the 3D Poisson-Voronoi tessellation. We investigate the joint probability distribution pi_n(L) for an arbitrarily selected cell face to be n-edged and for the distance between the seeds of its adjacent cells to be equal to 2L.…
Perhaps the very first elementary exercise one encounters in graph theory is the result that any graph on at least two vertices must have at least two vertices with the same degree. There are various ways in which this result can be…
Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. Here, we provide the exact solution of site percolation in a…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
This paper introduces an extended notion of expansion suitable for radio networks. A graph $G=(V,E)$ is called an $(\alpha_w, \beta_w)$-{wireless expander} if for every subset $S \subseteq V$ s.t. $|S|\leq \alpha_w \cdot |V|$, there exists…
We point out that interesting features in high energy physics data can be determined from properties of Voronoi tessellations of the relevant phase space. For illustration, we focus on the detection of kinematic "edges" in two dimensions,…
We bridge the properties of the regular square and honeycomb Voronoi tessellations of the plane to those of the Poisson-Voronoi case, thus analyzing in a common framework symmetry-break processes and the approach to uniformly random…
A seminal result of Koml\'os, S\'ark\"ozy, and Szemer\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended…
We are concerned here with the likelihood ratio statistics in two exponential random graph models -- the $\beta$-model and the Bradley-Terry model, in which the degree sequence on an undirected graph and the out-degree sequence on a…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
We consider a family of random line tessellations of the Euclidean plane introduced in a much more formal context by Hug and Schneider [Geom. Funct. Anal. 17, 156 (2007)] and described by a parameter \alpha\geq 1. For \alpha=1 the zero-cell…
A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$. A face-hitting set of a plane graph $G$ is a set $T$ of vertices in $G$ such that every face of $G$ contains at…
In this work we analyze basic properties of Random Apollonian Networks \cite{zhang,zhou}, a popular stochastic model which generates planar graphs with power law properties. Specifically, let $k$ be a constant and $\Delta_1 \geq \Delta_2…
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…
We discuss several limiting degree distributions for a class of random threshold graphs in the many node regime. This analysis is carried out under a weak assumption on the distribution of the underlying fitness variable. This assumption,…
Let $\Gamma$ be the fundamental group of a finite connected graph $\mathcal G$. Let $\mathfrak M$ be an abelian group. A {\it distribution} on the boundary $\partial\Delta$ of the universal covering tree $\Delta$ is an $\mathfrak M$-valued…
In this paper, by developing several new adjacency lemmas about a path on $4$ or $5$ vertices, we show that the average degree of 7-critical graphs is at least 6. It implies Vizing's planar graph conjecture for planar graphs with maximum…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…