Related papers: Canonization of a random graph by two matrix-vecto…
We present here a canonical quantization for the baker's map. The method we use is quite different from that used in Balazs and Voros (ref. \QCITE{cite}{}{BV}) and Saraceno (ref. \QCITE{cite}{}{S}). We first construct a natural ``baker…
Let $w:[0,1]^2\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.
This paper is concerned with sampling from the uniform distribution on H-colourings of the n-vertex path using systematic scan Markov chains. An H-colouring of the n-vertex path is a homomorphism from the n-vertex path to some fixed graph…
Given a finite non-decreasing sequence $d=(d_1,\ldots,d_n)$ of natural numbers, the Graph Realization problem asks whether $d$ is a graphic sequence, i.e., there exists a labeled simple graph such that $(d_1,\ldots,d_n)$ is the degree…
Graph labeling is a technique that assigns unique labels or weights to the vertices or edges of a graph, often used to analyze and solve various graph-related problems. There are few methods with certain limitations conducted by researchers…
The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…
We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
Massive data analysis calls for distributed algorithms and theories. We design a multi-round distributed algorithm for canonical correlation analysis. We construct principal directions through the convex formulation of canonical correlation…
Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…
Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…
We provide a deterministic algorithm that finds, in $\epsilon^{-O(1)} n^2$ time, an $\epsilon$-regular Frieze-Kannan partition of a graph on $n$ vertices. The algorithm outputs an approximation of a given graph as a weighted sum of…
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper…
Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detect deviations from randomness in network properties. Here we…
Given a graph $G$ and color set $\{1, \ldots, k\}$, a $\textit{proper coloring}$ is an assignment of a color to each vertex of $G$ such that no two vertices connected by an edge are given the same color. The problem of drawing a proper…
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3}…