13 papers · ranked by Valyu relevance
François Caron, Emily B. Fox
Title: Summary Statistical network modelling has focused on representing the graph as a discrete structure, namely the adjacency matrix. When assuming exchangeability of this array-which can aid in modelling, computations and theoretical analysis-the Aldous-Hoover theorem informs us that the graph is necessarily either…
Yifan Qian, Paul Expert, Pietro Panzarasa, Mauricio Barahona
Title: Summary Traditional classification tasks learn to assign samples to given classes based solely on sample features. This paradigm is evolving to include other sources of information, such as known relations between samples. Here, we show that, even if additional relational information is not available in the…
Svante Janson
We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs.…
Tomokaze Shiratori, Yuichi Takano, Jianchao Bai
Sparse estimation of a Gaussian graphical model (GGM) is an important technique for making relationships between observed variables more interpretable. Various methods have been proposed for sparse GGM estimation, including the graphical lasso that uses the ℓ1 norm regularization term, and other methods that use…
Heli Sun, Xuechun Liu, Miaomiao Sun, Ruichen Cao + 4 more
The Sparse Subgraph Finding (SGF) problem addresses the challenge of identifying sub-graphs with weak social interactions and sparse connections within a graph, which can be effectively modeled as discovering sparse subsystems in intelligent sensor networks. Traditional methods often rely on manually designed…
Runze Chen, Kaibiao Lin, Binsheng Hong, Shandan Zhang + 1 more
In previous research, the prevailing assumption was that Graph Neural Networks (GNNs) precisely depicted the interconnections among nodes within the graph's architecture. Nonetheless, real-world graph datasets are often rife with noise, elements that can disseminate through the network and ultimately affect the outcome…
Aric Hagberg, Nathan Lemons, Wen-Bo Du
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse…
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
The value of graph-based big data can be unlocked by exploring the topology and metrics of the networks they represent, and the computational approaches to this exploration take on many forms. For the use-case of performing global computations over a graph, it is first ingested into a graph processing system from one…
Swati Jain, Jonathan D. Jou, Ivelin S. Georgiev, Bruce R. Donald + 1 more
'Patrick Aloy'] Protein design algorithms enumerate a combinatorial number of candidate structures to compute the Global Minimum Energy Conformation (GMEC). To efficiently find the GMEC, protein design algorithms must methodically reduce the conformational search space. By applying distance and energy cutoffs, the…
Zehan Li, Xuemeng Zhai, Hangyu Hu, Jiandong Liang + 2 more
Graph neural networks (GNNs) have achieved great success in graph classification, with graph pooling methods being widely adopted for related tasks. Existing approaches typically rely on node ranking or clustering to coarsen graphs, but often fail to effectively leverage global structural information, leading to loss…
Alexander Mercier, Samuel Scarpino, Cristopher Moore, Feng Fu
Network science has increasingly become central to the field of epidemiology and our ability to respond to infectious disease threats. However, many networks derived from modern datasets are not just large, but dense, with a high ratio of edges to nodes. This includes human mobility networks where most locations have a…
Otte Heinävaara, Janne Leppä-aho, Jukka Corander, Antti Honkela
Background Various ℓ1-penalised estimation methods such as graphical lasso and CLIME are widely used for sparse precision matrix estimation and learning of undirected network structure from data. Many of these methods have been shown to be consistent under various quantitative assumptions about the underlying true…
Eleni C. Akrida, Leszek Gąsieniec, George B. Mertzios, Paul G. Spirakis
'Paul G. Spirakis'] We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of n vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex u to vertex v is a path from u to v where successive…