Related papers: Topological connectivity of random permutation com…
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…
We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly…
Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…
In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…
A skew morphism of a finite group $A$ is a permutation $\varphi$ of $A$ fixing the identity element and for which there is an integer-valued function $\pi$ on $A$ such that $\varphi(ab)=\varphi(a)\varphi^{\pi(a)}(b)$ for all $a, b \in A$. A…
For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman).…
We discuss various modifications of separability, precompactnmess and narrowness in topological groups and test those modifications in the permutation groups $S(X)$ and $S_{<\omega}(X)$.
Suppose $X$ and $Y$ are $p\times n$ matrices each with mean $0$, variance $1$ and where all moments of any order are uniformly bounded as $p,n \to \infty$. Moreover, the entries $(X_{ij}, Y_{ij})$ are independent across $i,j$ with a common…
We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…
The "simplicial complexes" and "join" (*) today used within combinatorics aren't the classical concepts, cf. Spanier (1966) p. 108-9, but, exept for \emptyset, complexes having {\emptyset} as a subcomplex resp. \Sigma1 * \Sigma2 := {\sigma1…
In this paper we study the degree sequence of the permutation graph $G_{\pi_n}$ associated with a sequence $\pi_n\in S_n$ of random permutations. Joint limiting distributions of the degrees are established using results from graph and…
For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…
This is the second of two papers but has been written so as to have minimal dependence on the first paper (which is also on this archive). Let G be a group and let M be a CAT(0) proper metric space (e.g. a simply connected complete…
A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…
For connectivity of \emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \emph{Cantor} distributed points on $[0,1]$. We show that for this random geometric graph, the…
For a connected regular scheme X, flat and of finite type over Spec(Z), we construct a reciprocity homomorphism \rho_X: C_X --> \pi_1^\ab(X), which is surjective and whose kernel is the connected component of the identity. The (topological)…
The power graph $\mathcal{P}(G)$ of a given finite group $G$ is the simple undirected graph whose vertices are the elements of $G$, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power…
The entropy of a hierarchical network topology in an ensemble of sparse random networks with "hidden variables" associated to its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble.We obtain a…
Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…