Related papers: Dixon's Theorem and random synchronization

In this paper, we characterize the monoid of endomorphisms of the semigroup of all oriented full transformations of a finite chain, as well as the monoid of endomorphisms of the semigroup of all oriented partial transformations and the…

Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…

We study commutation properties of subsets of right-angled Artin groups and trace monoids. We show that if Gamma is any graph not containing a four-cycle without chords, then the group G(Gamma) does not contain four elements whose…

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two…

We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…

The problem of synchronization over a group $\mathcal{G}$ aims to estimate a collection of group elements $G^*_1, \dots, G^*_n \in \mathcal{G}$ based on noisy observations of a subset of all pairwise ratios of the form $G^*_i {G^*_j}^{-1}$.…

For a given graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \ge \frac{\log k + \log \log k +…

Let $H_1,\dots,H_k$ be Hamilton cycles in $K_n$, chosen independently and uniformly at random. We show, for $k = o(n^{1/100})$, that the probability of $H_1,\dots,H_k$ being edge-disjoint is $(1+o(1))e^{-2\binom{k}{2}}$. This extends a…

For $r \ge 2$ and a graph $G$, let $\alpha_{{r}}(G)$ be the maximum number of vertices in a $K_r$-free subgraph of $G$. We investigate the value $\alpha_{r}(G)$ when $G$ is the random graph $G \sim G_{n, 1/2}$ and discover the following…

Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it…

We first develop a general theory of Johnson filtrations and Johnson homomorphisms for a group $G$ acting on another group $K$ equipped with a filtration indexed by a "good" ordered commutative monoid. Then, specializing it to the case…

This work addresses one-shot set and graph generation, and, more specifically, the parametrization of probabilistic decoders that map a vector-shaped prior to a distribution over sets or graphs. Sets and graphs are most commonly generated…

The Johnson graph $J(n,i)$ is defined to the graph whose vertex set is the set of all $i$-element subsets of $\{1,\ldots,n\}$, and two vertices are joined whenever the cardinality of their intersection is equal to $i-1$. In Ramras and…

We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on…

We consider the problem of inferring a matching hidden in a weighted random $k$-hypergraph. We assume that the hyperedges' weights are random and distributed according to two different densities conditioning on the fact that they belong to…

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. This paper examines the cyclic shift graphs of `plactic-like' monoids, whose elements can…