Related papers: Random permutation matrix models for graph product…
An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\sum_{A} x^{|A|}$, summed over…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
It is challenging for generative models to learn a distribution over graphs because of the lack of permutation invariance: nodes may be ordered arbitrarily across graphs, and standard graph alignment is combinatorial and notoriously…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. In this context, the conventional factor graphs are referred…
The $\mathcal{A}$-tracial algebras are algebras endowed with multi-linear forms, compatible with the product, and indexed by partitions. Using the notion of $\mathcal{A}$-cumulants, we define and study the $\mathcal{A}$-freeness property…
In this article, we define an independence system for a classical knot diagram and prove that the independence system is a knot invariant for alternating knots. We also discuss the exchange property for minimal unknotting sets. Finally, we…
Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
The Hoffman ratio bound, Lov\'{a}sz theta function and Schrijver theta function are classical upper bounds for the independence number of graphs, which are useful in graph theory, extremal combinatorics and information theory. By using…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
Generative models of graph structure have applications in biology and social sciences. The state of the art is GraphRNN, which decomposes the graph generation process into a series of sequential steps. While effective for modest sizes, it…
In this paper, we study random matrix models which are obtained as a non-commutative polynomial in random matrix variables of two kinds: (a) a first kind which have a discrete spectrum in the limit, (b) a second kind which have a joint…
The comaximal graph $ \Gamma(R) $ of a commutative ring $R$ is a simple graph with vertex set $ R $ and two distinct vertices $ a $ and $b $ of $ \Gamma(R) $ are adjacent if and only if $ aR+bR=R $, where $ aR $ is the ideal generated by $…
Graphical models provide a framework for exploration of multivariate dependence patterns. The connection between graph and statistical model is made by identifying the vertices of the graph with the observed variables and translating the…
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
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 a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter…
We show that free products of sofic groups with amalgamation over monotileably amenable subgroups are sofic. Consequently, so are HNN extensions of sofic groups relative to homomorphisms of monotileably amenable subgroups. We also show that…