Related papers: Geometric presentations of braid groups for partic…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
The analysis of networks, aimed at suitably defined functionality, often focuses on partitions into subnetworks that capture desired features. Chief among the relevant concepts is a 2-partition, that underlies the classical Cheeger…
Graphs are a natural representation of data from various contexts, such as social connections, the web, road networks, and many more. In the last decades, many of these networks have become enormous, requiring efficient algorithms to cut…
A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…
Future quantum networks can facilitate communication of quantum information between various nodes. We are particularly interested in whether multiple pairs can communicate simultaneously across a network. Quantum networks can be represented…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We review and develop the many-body spectral theory of ideal anyons, i.e. identical quantum particles in the plane whose exchange rules are governed by unitary representations of the braid group on $N$ strands. Allowing for arbitrary rank…
These are the extended notes of a mini-course given at the school WinterBraids X. We discuss algebras simultaneously related to: the braid group, the Yang-Baxter equation and the representation theory of quantum groups. The main goal is to…
Braided tensor products have been introduced by the author as a systematic way of making two quantum-group-covariant systems interact in a covariant way, and used in the theory of braided groups. Here we study infinite braided tensor…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of…
Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
A generalization of the Yang-Baxter algebra is found in quantizing the monodromy matrix of two (m)KdV equations discretized on a space lattice. This braided Yang-Baxter equation still ensures that the transfer matrix generates operators in…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful…
We consider finite-sheeted, regular, possibly branched covering spaces of compact surfaces with boundary and the associated liftable and symmetric mapping class groups. In particular, we classify when either of these subgroups coincides…
We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…
Correlations of partitioned particles carry essential information about their quantumness. Partitioning full beams of charged particles leads to current fluctuations, with their autocorrelation (namely, shot noise) revealing the particle'…