Related papers: Graph W*-Probability on the Free Group Factor L(F_…
Generating random graphs to model networks has a rich history. In this paper, we analyze and improve upon the multifractal network generator (MFNG) introduced by Palla et al. We provide a new result on the probability of subgraphs existing…
In this paper we show how to produce a large number of representations of a graph C*-algebra in the space of the bounded linear operators in $L^2(X,\mu)$. These representations are very concrete and, in the case of graphs that satisfy…
For a graph $G=(V,E)$ with $v(G)$ vertices the partition function of the random cluster model is defined by $$Z_G(q,w)=\sum_{A\subseteq E(G)}q^{k(A)}w^{|A|},$$ where $k(A)$ denotes the number of connected components of the graph $(V,A)$.…
We study the large scale geometry of the relative free splitting complex and the relative free factor complex of the rank $n$ free group $F_n$, relative to the choice of a free factor system of $F_n$, proving that these complexes are…
We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…
We generalize the Li-Yang notion of self-similar $k$-graph $(G,\Lambda)$ and its $C^*$-algebra $\mathcal{O}_{G,\Lambda}$ to any finitely aligned $k$-graph $\Lambda$. We then introduce an inverse semigroup model for $\mathcal{O}_{G,\Lambda}$…
We consider the group $(\mathcal{G},*)$ of unitized multiplicative functions in the incidence algebra of non-crossing partitions, where ``$*$'' denotes the convolution operation. We introduce a larger group $(\widetilde{\mathcal{G}},*)$ of…
We calculate exactly the first cumulants of the free energy of a directed polymer in a random medium for the geometry of a cylinder. By using the fact that the n-th moment <Z^n> of the partition function is given by the ground state energy…
The interpolated free group factors L(F_r), 1 < r <= \infty, are defined and proofs of their properties with respect to compression by projections and taking free products are proved. Hence it follows that all the free group factor are…
Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…
We show that for a fixed free group F and an arbitrary finitely generated subgroup H (as given above) we can perform the Stalling's folding process in time O(N log^*(N)), where N is the sum of the word lengths of the given generators of H.
We compute the topological K-theory of the group C*-algebra C*_r(G) for a group extension Z^n->G->Z/m provided that the conjugation action of Z/m on Z^n is free outside the origin.
A set $P = H \cup \{w\}$ of $n+1$ points in general position in the plane is called a wheel set if all points but $w$ are extreme. We show that for the purpose of counting crossing-free geometric graphs on such a set $P$, it suffices to…
Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, which can be modeled as a temporal bipartite graph. However, the…
A factor-graph representation of quantum-mechanical probabilities is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not random variables.
The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Fa\`a di Bruno algebra, and then to the group of a free operad over Schr\"oder trees. This leads to new combinatorial…
Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…
Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…