Related papers: Sampling complete designs
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
A continuous-time graph signal can be viewed as a time series of graph signals. It generalizes both the classical continuous-time signal and ordinary graph signal. Therefore, such a signal can be considered as a function on two domains: the…
We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to signed graphs,…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Joint time-vertex graph signals are pervasive in real-world. This paper focuses on the fundamental problem of sampling and reconstruction of joint time-vertex graph signals. We prove the existence and the necessary condition of a critical…
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…
While advances in computing resources have made processing enormous amounts of data possible, human ability to identify patterns in such data has not scaled accordingly. Efficient computational methods for condensing and simplifying data…
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…
Graph sampling allows mining a small representative subgraph from a big graph. Sampling algorithms deploy different strategies to replicate the properties of a given graph in the sampled graph. In this study, we provide a comprehensive…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…
Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in…
We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs.
Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…
We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are…