Related papers: Dixon's Theorem and random synchronization

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

Various spaces of symmetries of a structure are naturally endowed with both an algebraic and a topological structure. For example, the automorphism group of a structure is, on top of being a group, a topological group when equipped with the…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

Given a real $\mu\geq 1$, a graph $H$ is $\mu$-almost-regular if $\Delta(H)\leq \mu \delta(H)$. The celebrated regularization theorem of Erd\H{o}s and Simonovits states that for every real $0<\varepsilon<1$ there exists a real…

Some recent all-loop results on the renormalization of supersymmetric theories are summarized and reviewed. In particular, we discuss how it is possible to construct expressions which do not receive quantum corrections in all orders for…

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…

By the theorems of Cayley and Vagner-Preston, the full transformation monoids and the symmetric inverse monoids play analogous roles in the theory of monoids and inverse monoids, as the symmetric groups do in the theory of groups. Every…

For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…

We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms],…

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…

We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…

Suppose we are given a system of coupled oscillators on an unknown graph along with the trajectory of the system during some period. Can we predict whether the system will eventually synchronize? Even with a known underlying graph…

Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…

Consider two independent Erd\H{o}s-R\'enyi $G(N,1/2)$ graphs. We show that with probability tending to $1$ as $N\to\infty$, the largest induced isomorphic subgraph has size either $\lfloor x_N-\varepsilon_N\rfloor$ or $\lfloor…

We classify a large set of melonic theories with arbitrary $q$-fold interactions, demonstrating that the interaction vertices exhibit a range of symmetries, always of the form $\mathbb{Z}_2^n$ for some $n$, which may be $0$. The number of…

The distinguishing number of a permutation group $G\leqslant\Sym(\Omega)$ is the minimum number of colours needed to colour $\Omega$ in such a way that the only colour preserving element of $G$ is the identity. The distinguishing number of…

In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph $G$, each pair of vertices are joined by an edge with a probability $p$, where $p$ is a…

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…