Related papers: On meandric permutations
This paper is devoted to the proof of a structural theorem, concerning certain homomorphic images of Artin braid group on $n$ strands in finite symmetric groups. It is shown that any one of these permutation groups is an extension of the…
The problem of which Gauss diagram can be realized by plane curves is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that needed conditions for realizability of a Gauss…
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.
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…
By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random permutations of arbitrary multisets are…
A mixed graph $M_{G}$ is the graph obtained from an unoriented simple graph $G$ by giving directions to some edges of $G$, where $G$ is often called the underlying graph of $M_{G}$. In this paper, we introduce two classes of incidence…
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the…
We study the large-scale geometry of graph braid groups $\mathbb{B}_n(\mathsf{\Gamma})$, viewed as the fundamental groups of discrete configuration spaces $UD_n(\mathsf{\Gamma})$, which are special cube complexes in the sense of…
A diagram of groupoid correspondences is a homomorphism to the bicategory of \'etale groupoid correspondences. We study examples of such diagrams, including complexes of groups and self-similar higher-rank graphs. We encode the diagram in a…
A new algorithm based on bayesian inference for learning local graph conductance based on Gaussian Process(GP) is given that uses advanced MCMC convergence ideas to create a scalable and fast algorithm for convergence to stationary…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
If g is a quasitriangular Lie bialgebra, one can asks what is the geometrical meaning of its r-matrix. A first answer was given in a paper by Weinstein and Xu, using purely geometrical means: roughly, one has that the formal Poisson group…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of…
In this paper we propose a Farlie-Gumbel-Morgenstern (FGM) family of bivariate linear exponential distributions generated from given marginal's. Therefore, properties of FGM are analogous to properties of bivariate distributions. We study…
We propose the graph description of Teichm\"uller theory of surfaces with marked points on boundary components (bordered surfaces). Introducing new parameters, we formulate this theory in terms of hyperbolic geometry. We can then describe…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…