Related papers: Permute, Graph, Map, Derange
In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
Being motivated by the surge of fermionic quantum Monte Carlo simulations at finite temperature, we present a detailed analysis of the permutation-cycle properties of path integral Monte Carlo (PIMC) simulations of degenerate electrons.…
We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
We review, for a general audience, a variety of recent experiments on extracting structure from machine-learning mathematical data that have been compiled over the years. Focusing on supervised machine-learning on labeled data from…
Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…
It is reported that the characteristic relations of type-II and type-III intermittencies, with respective local Poincar$\acute{e}$ maps of $x_{n+1}= (1+\epsilon)x_n + a x^3_n$ and $x_{n+1}= - (1+\epsilon)x_n - a x^3_n$, are both $- ln…
We study derangements of $\{1,2,\ldots,n\}$ under the Ewens distribution with parameter $\theta$. We give the moments and marginal distributions of the cycle counts, the number of cycles, and asymptotic distributions for large $n$. We…
We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…
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…
A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…
Consider a random permutation of $\{1, \ldots, \lfloor n^{t_2}\rfloor\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\equiv (t_1, t_2)\in\mathbb [0, 1]^2$. Next,…
This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…
We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…
We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…
We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length…
Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…
Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…