arXiv research

Study the geometry of graph product extension graphs.

A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups is virtually cocompact special in the sense of Haglund and Wise. The proof of th…

This work characterizes topological descriptors of graph products and their expressive power.

Paper learns Cartesian product graphs with Laplacian constraints.

The Cartesian subgroup in graph products of groups is studied with bounds and algorithms.

Graph products inherit Morse local-to-global property from their components.

A production function is a mathematical formalization in economics which denotes the relations between the output generated by a firm, an industry or an economy and the inputs that have been used in obtaining it. In this paper, we study the product production functions of 2 variables in terms of the geometry of their a…

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality group with probability tending to 1 as n goes to infinity. This includes random ri…

Localized signal representation on graph bundles using Fourier analysis.

Study graph products of groups, classifying them up to measure equivalence and rigidity.

Study of mean curvature flows on graphs in warped product manifolds, focusing on behavior at infinity.

The paper studies graph products of groups and recovers graph and vertex groups under certain conditions.

Uniform drift estimates found for random walks on graph products.

We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique.

The study examines groups acting loxodromically on hyperbolic graph products.

Extends random dot product graph model to handle multiple graphs.

In this paper, we compare Ollivier Ricci curvature and Bakry-Émery curvature notions on combinatorial graphs and discuss connections to various types of Ricci flatness. We show that non-negativity of Ollivier Ricci curvature implies non-negativity of Bakry-Émery curvature under triangle-freeness and an additional in-de…

We first show that the braid group over a graph topologically containing no $Θ$-shape subgraph has a presentation related only by commutators. Then using discrete Morse theory and triple Massey products, we prove that a graph topologically contains none of four prescribed graphs if and only if its 4-braid groups is a r…

Proposes a novel approach using vector cross product to preserve directional edges in directed graphs.

IDPGs extend RDPGs with a Poisson process for random latent positions.

We prove that the universal cover of any graph manifold quasi-isometrically embeds into a product of three trees. In particular we show that the Assouad-Nagata dimension of the universal cover of any closed graph manifold is 3, proving a conjecture of Smirnov.

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollobás and Riordan, we introduce a generalization of Kauffman's Tutte polynomial of signed graphs for which describi…

Proposes a new graph representation method using tensor products.

Convex optimization method infers latent structure in random dot product graphs.

Estimates mean curvature, scalar curvature, shape operator in warped products.

Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …

In this note we study a large class of mean curvature type flows of graphs in product manifold $N\times R$ where N is a closed Riemann- ian manifold. Their speeds are the mean curvature of graphs plus a prescribed function. We establish long time existence and uniformly convergence of those flows with a barrier conditi…

The study bounds the effective diameter of graphs with positive Ollivier curvature.

We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined in [7]. We follow closely the plan of M. Laurence's paper [11].

In the lorentzian product $\Bbb G^n\times\Bbb R_1,$ we give a comparison between the $f$-volume of an entire $f$-maximal graph and the $f$-volume of the hyperbolic $H_r^+$ under the assumption that the gradient of the function defining the graph is bounded away from 1. As a consequence, we obtain a Bernstein type theor…

Proposes RBGP framework for efficient block sparse neural networks.

The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describ…

GraSP-RL uses graph neural networks to improve job shop scheduling.

Explores tensor products in hyperdimensional computing.

The study finds a subgroup of graph braid groups that is a direct product of non-abelian free groups.

We show that for a surface S, the subgraph of the pants graph determined by fixing a collection of curves that cut S into pairs of pants, once-punctured tori, and four-times-punctured spheres is totally geodesic. The main theorem resolves a special case of a conjecture made by Aramayona, Parlier, and Shackleton and has…

In every dimension $n\ge 3$ we introduce a class of orthogonal graph-manifolds and prove that the fundamental group of any orthogonal graph-manifold quasi-isometrically embeds into a product of $n$ trees. As a consequence, we obtain that asymptotic and linearly-controlled asymptotic dimensions of such group are equal t…

We show that every graph product of finitely generated abelian groups acts properly and cocompactly on a CAT(0) cubical complex. The complex generalizes (up to subdivision) the Salvetti complex of a right-angled Artin group and the Coxeter complex of a right-angled Coxeter group. In the right-angled Artin group case it…

The paper extends RDPG model to handle weighted graphs, enabling better analysis of network data.

In this article we obtain classification results on the quasi-product production functions in terms of the geometry of their associated graph hypersurfaces, generalizing in a new setting some recent results concerning basic production models. In particular, we obtain several results on the geometry of Spillman-Mitscher…

We prove that graph products constructed over infinite graphs with bounded clique number preserve finite asymptotic dimension. We also study the extent to which Dranishnikov's property C, and Dranishnikov and Zarichnyi's straight finite decomposition complexity are preserved by constructions such as unions, free produc…

We describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM) of Kim and Leskovec (2010). We exploit the close connection between MAGM and the Kronecker Product Graph Model (KPGM) of Leskovec et al. (2010), and show that to sample a graph from a MAGM it suffices to sample sm…

Proposes a novel graph learning framework for robust graph topology learning from graph signals.

Paper explores embedding methods for detecting pseudo-cliques in random graphs, showing limitations and potential.

New algorithms improve community detection and parameter estimation for PABM.

Researchers prove inner product recovery is impossible in latent space models.

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a…

Graphs derived from cohomology help reconstruct defining graphs of Artin groups.