Related papers: Degrees in the $\beta$- and $\beta'$-Delaunay grap…
In this paper, we characterize the extremal digraphs with the maximal or minimal $\alpha$-spectral radius among some digraph classes such as rose digraphs, generalized theta digraphs and tri-ring digraphs with given size $m$. These digraph…
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
Statistical inference in high-dimensional settings is challenging when standard unregularized methods are employed. In this work, we focus on the case of multiple correlated proportions for which we develop a Bayesian inference framework.…
We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The…
For Poisson-Delaunay triangulations in $d$-dimensional Euclidean space $\mathbb{R}^{d}$, a structured and computationally efficient form of the probability density function (PDF) of the volume of a typical cell is analytically derived in…
We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly. Our findings…
The lecture notes describe the Delaunay Tessellation Field Estimator for Cosmic Web analysis. The high sensitivity of Voronoi/Delaunay tessellations to the local point distribution is used to obtain estimates of density and related…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We analyze the fine-grained connections between the average degree and the power-law degree distribution exponent in growing information networks. Our starting observation is a power-law degree distribution with a decreasing exponent and…
In this work, we study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on a hyperbolic space and any two of them are joined by an edge with probability that depends on their hyperbolic…
We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain…
We conclude our analysis of bubble divergences in the flat spinfoam model. In [arXiv:1008.1476] we showed that the divergence degree of an arbitrary two-complex Gamma can be evaluated exactly by means of twisted cohomology. Here, we…
In discrete contexts such as the degree distribution for a graph, \emph{scale-free} has traditionally been \emph{defined} to be \emph{power-law}. We propose a reasonable interpretation of \emph{scale-free}, namely, invariance under the…
In this paper, we study rooted products of graphs from the perspective of combinatorial commutative algebra. For edge ideals, we introduce the 2-Cohen-Macaulayness with respect to a vertex and use it to investigate when edge ideals of…
We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…
Theta graphs are important geometric graphs that have many applications, including wireless networking, motion planning, real-time animation, and minimum-spanning tree construction. We give closed form expressions for the average degree of…
Let $H_n$ be a graph on $n$ vertices and let $\ber{H_n}$ denote the complement of $H_n$. Suppose that $\Delta = \Delta(n)$ is the maximum degree of $\ber{H_n}$. We analyse three algorithms for sampling $d$-regular subgraphs ($d$-factors) of…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…