Related papers: Graph W*-Probability on the Free Group Factor L(F_…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
We combine infinite-dimensional integration by parts procedures with a recursive relation on moments (reminiscent of a formula by Barbour (1986)), and deduce explicit expressions for cumulants of functionals of a general Gaussian field.…
A graphical model is a structured representation of locally dependent random variables. A traditional method to reason over these random variables is to perform inference using belief propagation. When provided with the true data generating…
A factorization $f_1, \ldots, f_m$ of a string $w$ of length $n$ is called a repetition factorization of $w$ if $f_i$ is a repetition, i.e., $f_i$ is a form of $x^kx'$, where $x$ is a non-empty string, $x'$ is a (possibly-empty) proper…
In this paper, we initiate the study of higher rank Baumslag-Solitar semigroups and their related C*-algebras. We focus on two extreme, but interesting, classes - one is related to products of odometers and the other is related to…
An L-factor of a graph G is a spanning subgraph of G whose every component is a 3-vertex path. Let v(G) denote the number of vertices of G. A graph is called claw-free if it does not have a subgraph isomorphic to the graph with 4 vertices…
We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…
Given a II$_1$ factor $M$, a W$^*$-subalgebra $Q\subset M$ is {\it compressible} if for any $\varepsilon>0$ there exists a finite set of unitary elements $\Cal U_0\subset \Cal U(M)$ such that $\| \frac{1}{|\Cal U_0|}\sum_{u\in \Cal U_0}…
This paper shows the weighted matching problem on general graphs can be solved in time $O(n(m + n\log n))$ for $n$ and $m$ the number of vertices and edges, respectively. This was previously known only for bipartite graphs. The crux is a…
Let $G = G_{1} \times G_{2}$ be a product of two locally compact, second countable groups and $\mu \in \mathrm{Prob}(G)$ be of the form $\mu = \mu_{1} \times \mu_{2}$, where $\mu_{i} \in \mathrm{Prob}(G_{i})$. Let $(B,\nu_B)$ be the…
In this paper we will give a similar factorization as in \cite{4}, \cite{5}, where the autors Svrtan and Meljanac examined certain matrix factorizations on Fock-like representation of a multiparametric quon algebra on the free associative…
This paper introduces a new probabilistic architecture called Sum-Product Graphical Model (SPGM). SPGMs combine traits from Sum-Product Networks (SPNs) and Graphical Models (GMs): Like SPNs, SPGMs always enable tractable inference using a…
We discuss free probability theory and free harmonic analysis from a categorical perspective. In order to do so, we extend first the set of analytic convolutions and operations and then show that the comonadic structure governing free…
Free cumulants were introduced by Speicher as a proper analog of classical cumulants in Voiculescu's theory of free probability. The relation between free moments and free cumulants is usually described in terms of Moebius calculus over the…
We study dynamic $(1-\epsilon)$-approximate rounding of fractional matchings -- a key ingredient in numerous breakthroughs in the dynamic graph algorithms literature. Our first contribution is a surprisingly simple deterministic rounding…
The Wigner-Weyl isomorphism for quantum mechanics on a compact simple Lie group $G$ is developed in detail. Several New features are shown to arise which have no counterparts in the familiar Cartesian case. Notable among these is the notion…
We show how random matrix theory can be applied to develop new algorithms to extract dynamic factors from macroeconomic time series. In particular, we consider a limit where the number of random variables N and the number of consecutive…
The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant "approximate" prime factorization, is the development of local approaches that…
We show that the quadratic matrix equation $VW + \eta (W)W = I$, for given $V$ with positive real part and given analytic mapping $\eta$ with some positivity preserving properties, has exactly one solution $W$ with positive real part. We…
Free groups have many applications in Algebraic Topology. In this paper I specifically study the finitely generated free groups by using the covering spaces and fundamental groups. By the Van Kampen's theorem, we have a famous fact that the…