Related papers: Short cycles in high genus unicellular maps
We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$. The spectrum of $G$ is referring to its adjacency…
We introduce a general, efficient method to completely describe the topology of individual grains, bubbles, and cells in three-dimensional polycrystals, foams, and other multicellular microstructures. This approach is applied to a pair of…
We show that the mapping class group of an orientable finite type surface has uniformly exponential growth, as well as various closely related groups. This provides further evidence that mapping class groups may be linear.
While analyzing mobile systems we often approximate the actual coverage surface and assume an ideal cell shape. In a multi-cellular network, because of its tessellating nature, a hexagon is more preferred than a circular geometry. Despite…
A subset $C$ of edges in a $k$-uniform hypergraph $H$ is a \emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices such that the edges in $C$ are segments of that order and such…
We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, which exhibit both a spatial Markov property and a hyperbolic…
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains…
We introduce a new class of identifiable DAG models where the conditional distribution of each node given its parents belongs to a family of generalized hypergeometric distributions (GHD). A family of generalized hypergeometric…
We characterize the distributions of short cycles in a large metabolic network previously shown to have small world characteristics and a power law degree distribution. Compared with three classes of random networks, including Erdoes-Renyi…
This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…
We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…
A Berge cycle of length $\ell$ in a hypergraph $\mathcal{H}$ is a sequence of alternating vertices and edges $v_0e_0v_1e_1...v_\ell e_\ell v_0$ such that $\{v_i,v_{i+1}\}\subseteq e_i$ for all $i$, with indices taken modulo $\ell$. For $n$…
We consider a complete, unbounded, hyperbolic metric space $X$ and a concave, nonzero and nondecreasing function $\omega:[0,+\infty)\to[0,+\infty)$ with $\omega(0)=0$ and study the space $\mathcal{C}_\omega(X)$ of uniformly continous…
In this paper we examine the geometry of minimal surfaces of arithmetic hyperbolic 3-manifolds. In particular, we give bounds on the totally geodesic 2-systole, construct infinitely many incommensurable manifolds with the same initial…
Motivated by the bootstrap percolation process for graphs, we define a new, high-order generalisation to $k$-uniform hypergraphs, in which we infect $j$-sets of vertices for some integer $1\le j \le k-1$. We investigate the smallest…
A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…