arXiv research

Algorithm reconstructs triangle-free networks from data, certifying correctness.

The study proves conjecture for specific Artin groups.

We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we propose a graphical Fermat's principle to regularize the distribution family. Suc…

New groups act on cube complexes without compact cubulation.

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael, and, independently, Mattman showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the …

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$…

We investigate the planarity of the boundaries of right-angled Coxeter groups. We show that non-planarity of the defining graph does not necessarily imply non-planarity of every boundary of the associated right-angled Coxeter group, although it does in many cases. Our techniques yield a characterization of the triangle…

We define a family of representations $\{ρ_n\}_{n\geq 0}$ of a pure braid group $P_{2k}$. These representations are obtained from an action of $P_{2k}$ on a certain type of $A_2$ web space with color $n$. The $A_2$ web space is a generalization of the Kauffman bracket skein module of a disk with marked points on its bo…

Estimates graph curvature and diameter using Laplacian eigenvalues.

Groups on CAT(0) cube complexes grow exponentially uniformly.

Let $Γ$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $Γ$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_Γ$ is virtually a Seifert manifold group or virtually a graph manifold group and we give a complete quasi-isometr…

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

Artin groups of hyperbolic type are boundary amenable and have rigid properties.

RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us …

Deep ReLU networks can be simplified to a three-layer model.

Chemical networks outperform spiking neural networks in classification tasks.

This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.

New approach learns latent motifs in networks for mesoscale structure analysis.

A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all non-source and non-sink nodes. We propose a novel polynomial time algorithm to …

Social network analysis is an important problem in data mining. A fundamental step for analyzing social networks is to encode network data into low-dimensional representations, i.e., network embeddings, so that the network topology structure and other attribute information can be effectively preserved. Network represen…

Taking inspiration from biological evolution, we explore the idea of "Can deep neural networks evolve naturally over successive generations into highly efficient deep neural networks?" by introducing the notion of synthesizing new highly efficient, yet powerful deep neural networks over successive generations via an ev…

SyNGLER generates synthetic networks efficiently while preserving key structural properties.

Secret neural networks hidden within trained models.

Natural graph networks are a new class of graph neural networks that are more flexible and scalable.

The structure of complex networks has been of interest in many scientific and engineering disciplines over the decades. A number of studies in the field have been focused on finding the common properties among different kinds of networks such as heavy-tail degree distribution, small-worldness and modular structure and …

Convolutional networks outperform fully-connected ones in certain tasks.

The interplay between inter-neuronal network topology and cognition has been studied deeply by connectomics researchers and network scientists, which is crucial towards understanding the remarkable efficacy of biological neural networks. Curiously, the deep learning revolution that revived neural networks has not paid …

Proposes a graph neural network for traffic forecasting in WANs.

Researchers derive exact priors for finite Bayesian neural networks.

i-cNRL learns network differences with interpretability.

We show that deep networks are better than shallow networks at approximating functions that can be expressed as a composition of functions described by a directed acyclic graph, because the deep networks can be designed to have the same compositional structure, while a shallow network cannot exploit this knowledge. Thu…

DCGANs generate drainage networks quickly from samples.

A network embedding consists of a vector representation for each node in the network. Its usefulness has been shown in many real-world application domains, such as social networks and web networks. Directed networks with text associated with each node, such as software package dependency networks, are commonplace. Howe…

Quantum neural network and tensor network models outperform classical models in Japanese stock market predictions.

Study deep maxout networks and their equivalence to Gaussian processes.

Machine learning improves network classification and model selection.

Study shows effective resistance distance yields more accurate network barycenter than Hamming distance.

Model-based neural networks generalize better than ReLU networks for sparse recovery.

A new method predicts links better across various networks.

Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it i…

This paper proposes network recasting as a general method for network architecture transformation. The primary goal of this method is to accelerate the inference process through the transformation, but there can be many other practical applications. The method is based on block-wise recasting; it recasts each source bl…

Road networks are a type of spatial network, where edges may be associated with qualitative information such as road type and speed limit. Unfortunately, such information is often incomplete; for instance, OpenStreetMap only has speed limits for 13% of all Danish road segments. This is problematic for analysis tasks th…

With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks. Analyzing these networks sheds light on different aspe…

Optimal rates for shallow ReLU networks in nonparametric regression.

New algorithm assesses credit risk in multilayer networks over time.

We study the problem of identifying different behaviors occurring in different parts of a large heterogenous network. We zoom in to the network using lenses of different sizes to capture the local structure of the network. These network signatures are then weighted to provide a set of predicted labels for every node. W…