Related papers: Random permutation matrix models for graph product…

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

This note describes a new approach to classifying graphs that leverages graph generative models (GGM). Assuming a GGM that defines a joint probability distribution over graphs and their class labels, I derive classification formulas for the…

In this paper, we observe the amalgamated free product structure of a Graph W*-probability space. In [16] and [17], we already observed the operator-valued freeness conditions on a graph W*-algebra. By using the conditions, we will consider…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…

Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique often leads to randomized algorithms with no clear path to…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

Let $X$ be an orientable hyperbolic surface of genus $g\geq 2$ with a marked point $o$, and let $\Gamma$ be an orientable hyperbolic surface group isomorphic to $\pi_{1}(X,o)$. Consider the space $\text{Hom}(\Gamma,S_{n})$ which corresponds…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

Let $\mathfrak g$ be a complex semisimple Lie algebra. We define what it means for a finite dimensional representation of $\mathfrak g$ to be rectangular and completely classify faithful rectangular representations. As an application, we…

A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this…

We revive the concept of Lambda-freeness of Mlotkowski, which describes a mixture of classical and free independence between algebras of random variables. In particular, we give a description of this in terms of cumulants; this will be…

Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha"(G)$ respectively. This paper establishes a…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

We prove that independent families of permutation invariant random matrices are asymptotically free over the diagonal, both in probability and in expectation, under a uniform boundedness assumption on the operator norm. We can relax the…

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full…