arXiv research

Paper introduces a new method to identify brain hubs using both structural and functional connectivity.

Proposes a co-hub node model for multiview graph learning.

Proposes using dimensionality reduction with personalized page rank to improve GCNs' performance in node classification.

A distributed SGD method for heterogeneous networks with hubs and workers.

We consider the problem of learning a high-dimensional graphical model in which certain hub nodes are highly-connected to many other nodes. Many authors have studied the use of an l1 penalty in order to learn a sparse graph in high-dimensional setting. However, the l1 penalty implicitly assumes that each edge is equall…

Efficiently estimates hub graphical models with structured sparsity.

Paper proves identifiability and consistency of hub model for network inference.

We consider the effects of the 2008 global financial crisis on the global stock market before, during, and after the crisis. We generate complex networks from a cross-correlation matrix such as the threshold network (TN) and the minimal spanning tree (MST). In the threshold network, we assign a threshold value by using…

Proposes a block-based model for attributed network embedding.

Python package reduces hubness in high-dimensional data.

We develop a new method called Discriminated Hub Graphical Lasso (DHGL) based on Hub Graphical Lasso (HGL) by providing prior information of hubs. We apply this new method in two situations: with known hubs and without known hubs. Then we compare DHGL with HGL using several measures of performance. When some hubs are k…

Quantifying the importance and power of individual nodes depending on their position in socio-economic networks constitutes a problem across a variety of applications. Examples include the reach of individuals in (online) social networks, the importance of individual banks or loans in financial networks, the relevance …

The functioning of the cryptocurrency Bitcoin relies on the open availability of the entire history of its transactions. This makes it a particularly interesting socio-economic system to analyse from the point of view of network science. Here we analyse the evolution of the network of Bitcoin transactions between users…

Generative model captures hubs and dense communities in social networks.

This paper discusses the effect of hubness in zero-shot learning, when ridge regression is used to find a mapping between the example space to the label space. Contrary to the existing approach, which attempts to find a mapping from the example space to the label space, we show that mapping labels into the example spac…

Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also ta…

GICDM corrects hubness in embedding spaces for better generative model evaluation.

Financial markets for Liquified Natural Gas (LNG) are an important and rapidly-growing segment of commodities markets. Like other commodities markets, there is an inherent spatial structure to LNG markets, with different price dynamics for different points of delivery hubs. Certain hubs support highly liquid markets, a…

New framework minimizes interference and selection bias in network A/B testing.

RVFL NNs perform well without direct links and output bias for regression.

This work identifies and mitigates topological bias in HGNNs using meta-weighting and debiasing.

Method reduces model bias in water temperature prediction using physics-guided GNNs.

We consider the following general hidden hubs model: an $n \times n$ random matrix $A$ with a subset $S$ of $k$ special rows (hubs): entries in rows outside $S$ are generated from the probability distribution $p_0 \sim N(0,σ_0^2)$; for each row in $S$, some $k$ of its entries are generated from $p_1 \sim N(0,σ_1^2)$, $…

BiLiNGAM model reveals brain emotion circuit development in adolescents.

We consider the problem of estimating high-dimensional Gaussian graphical models corresponding to a single set of variables under several distinct conditions. This problem is motivated by the task of recovering transcriptional regulatory networks on the basis of gene expression data {containing heterogeneous samples, s…

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent…

The densification of small-cell base stations in a 5G architecture is a promising approach to enhance the coverage area and facilitate the ever increasing capacity demand of end users. However, the bottleneck is an intelligent management of a backhaul/fronthaul network for these small-cell base stations. This involves …

Gaussian Graphical Models (GGMs) or Gauss Markov random fields are widely used in many applications, and the trade-off between the modeling capacity and the efficiency of learning and inference has been an important research problem. In this paper, we study the family of GGMs with small feedback vertex sets (FVSs), whe…

Optimizes hydrokinetic turbine design using morphing and Bayesian optimization.

A new method for learning network representations that avoids information bias and sparsity.

Study sample complexity of robust binary hypothesis testing under different contamination models.

Geometric QHD tests improve hub detection in correlated data.

We consider the task of estimating a high-dimensional directed acyclic graph, given observations from a linear structural equation model with arbitrary noise distribution. By exploiting properties of common random graphs, we develop a new algorithm that requires conditioning only on small sets of variables. The propose…

MGM improves media profiling by integrating textual and structural features.

Algorithmic approaches endow deep learning systems with implicit bias that helps them generalize even in over-parametrized settings. In this paper, we focus on understanding such a bias induced in learning through dropout, a popular technique to avoid overfitting in deep learning. For single hidden-layer linear neural …

New method identifies causal brain connections from fMRI data.

Algorithm recovers causal graphs in presence of latent confounders and selection bias.

Decision trees with binary splits are popularly constructed using Classification and Regression Trees (CART) methodology. For binary classification and regression models, this approach recursively divides the data into two near-homogenous daughter nodes according to a split point that maximizes the reduction in sum of …

New algorithm tackles multi-agent bandits with heavy-tailed data.

This paper begins to explore the determinants of the topological properties of the international - trade network (ITN). We fit bilateral-trade flows using a standard gravity equation to build a "residual" ITN where trade-link weights are depurated from geographical distance, size, border effects, trade agreements, and …

FairGP uses graph partitioning to make Graph Transformers fair and scalable.

FANNet analyzes noise tolerance and training bias in neural networks.

New graph embedding method improves link prediction and node classification.

We introduce a new neural network model, together with a tractable and monotone online learning algorithm. Our model describes feed-forward networks for classification, with one output node for each class. The only nonlinear operation is rectification using a ReLU function with a bias. However, there is a rectifier on …

CrossWalk enhances fairness in graph algorithms by biasing random walks.

Any regular Gaussian probability distribution that can be represented by an AMP chain graph (CG) can be expressed as a system of linear equations with correlated errors whose structure depends on the CG. However, the CG represents the errors implicitly, as no nodes in the CG correspond to the errors. We propose in this…

FairDrop improves fairness in graph representation learning by counteracting homophily.

This paper improves indoor positioning accuracy by deploying reference nodes to ensure Line-of-Sight.