Related papers: Graph W*-Probability on the Free Group Factor L(F_…
In this paper we use the description of free group factors as the von Neumann algebras of Berezin's deformation of the upper half-plane, modulo PSL$(2,{\Bbb Z})$. The derivative, in the deformation parameter, of the product in the…
The concept of the \textit{relative fractional packing number} between two graphs $G$ and $H$, initially introduced in arXiv:2307.06155 [math.CO], serves as an upper bound for the ratio of the zero-error Shannon capacity of these graphs.…
An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…
A probabilistic version of the Weisfeiler-Leman algorithm for computing the coherent closure of a colored graph is suggested. The algorithm is Monte Carlo and runs in time $ O(n^{1+\omega}\log^2 n) $, where $ n $ is the number of vertices…
This work is concerned with the prime factor decomposition (PFD) of strong product graphs. A new quasi-linear time algorithm for the PFD with respect to the strong product for arbitrary, finite, connected, undirected graphs is derived.…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
Recent work shows that the expressive power of Graph Neural Networks (GNNs) in distinguishing non-isomorphic graphs is exactly the same as that of the Weisfeiler-Lehman (WL) graph test. In particular, they show that the WL test can be…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model. We first describe a general procedure…
In this work we extend the recently introduced group-theoretical approach to moment-cumulant relations in non-commutative probability theory to the notion of conditionally free cumulants. This approach is based on a particular combinatorial…
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and M\"uller on these graphs and how to repair this lemma.
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
An operadic framework is developed to explain the inversion formula relating moments and cumulants in operator-valued free probability theory.
We consider finitely generated free semigroup actions on a compact metric space and obtain quantitative information on Poincar\'e recurrence, average first return time and hitting frequency for the random orbits induced by the semigroup…
For a family $\mathcal{F}$ of graphs, a graph $G$ is called \emph{$\mathcal{F}$-universal} if $G$ contains every graph in $\mathcal{F}$ as a subgraph. Let $\mathcal{F}_n(d)$ be the family of all graphs on $n$ vertices with maximum degree at…
We compute one-loop renormalization group equations for non-singlet twist-four operators in QCD. The calculation heavily relies on the light-cone gauge formalism in the momentum fraction space that essentially rephrases the analysis of all…
For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…
Given a digraph $G = (VG,AG)$, an \emph{even factor} $M \subseteq AG$ is a subset of arcs that decomposes into a collection of node-disjoint paths and even cycles. Even factors in digraphs were introduced by Geleen and Cunningham and…
This paper studies fractional integral operator for vector fields in weighted $L^1$. Using the estimates on fractional integral operator and Stein-Weiss inequalities, we can give a new proof for a class of Caffarelli-Kohn-Nirenberg…
A free wreath product construction of a Hopf algebra (or of a Woronowicz algebra) by Wang's quantum permutation group is done. It provides new examples of quantum groups and is useful to describe the quantum automorphism group of the…