ID: 1709.09002

A physical model for efficient ranking in networks

September 3, 2017

View on ArXiv

Similar papers 2

Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior

March 7, 2015

88% Match
Qingming Tang, Siqi Sun, Jinbo Xu
Machine Learning
Artificial Intelligence
Machine Learning

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 takes into consideration the relative strength of all the possible edges adjacent to the same node and the estimated degree of each individual node. To fulfill ...

Find SimilarView on arXiv

Statistical ranking with dynamic covariates

June 24, 2024

88% Match
Pinjun Dong, Ruijian Han, ... , Xu Yiming
Methodology
Machine Learning

We consider a covariate-assisted ranking model grounded in the Plackett--Luce framework. Unlike existing works focusing on pure covariates or individual effects with fixed covariates, our approach integrates individual effects with dynamic covariates. This added flexibility enhances realistic ranking yet poses significant challenges for analyzing the associated estimation procedures. This paper makes an initial attempt to address these challenges. We begin by discussing the s...

Find SimilarView on arXiv

RankMerging: A supervised learning-to-rank framework to predict links in large social network

July 9, 2014

88% Match
Lionel Tabourier, Daniel Faria Bernardes, ... , Lambiotte Renaud
Social and Information Netwo...
Information Retrieval
Machine Learning
Physics and Society

Uncovering unknown or missing links in social networks is a difficult task because of their sparsity and because links may represent different types of relationships, characterized by different structural patterns. In this paper, we define a simple yet efficient supervised learning-to-rank framework, called RankMerging, which aims at combining information provided by various unsupervised rankings. We illustrate our method on three different kinds of social networks and show t...

Find SimilarView on arXiv

Efficient estimation and inference for the signed $\beta$-model in directed signed networks

July 30, 2022

88% Match
Haoran Zhang, Junhui Wang
Methodology
Social and Information Netwo...

This paper proposes a novel signed $\beta$-model for directed signed network, which is frequently encountered in application domains but largely neglected in literature. The proposed signed $\beta$-model decomposes a directed signed network as the difference of two unsigned networks and embeds each node with two latent factors for in-status and out-status. The presence of negative edges leads to a non-concave log-likelihood, and a one-step estimation algorithm is developed to...

Find SimilarView on arXiv

Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks

February 5, 2019

88% Match
Nikolaj Tatti
Data Structures and Algorith...

Interactions in many real-world phenomena can be explained by a strong hierarchical structure. Typically, this structure or ranking is not known; instead we only have observed outcomes of the interactions, and the goal is to infer the hierarchy from these observations. Discovering a hierarchy in the context of directed networks can be formulated as follows: given a graph, partition vertices into levels such that, ideally, there are only edges from upper levels to lower levels...

Find SimilarView on arXiv

Ranking Competitors Using Degree-Neutralized Random Walks

August 10, 2016

88% Match
Seungkyu Shin, Sebastian E. Ahnert, Juyong Park
Physics and Society
Statistical Mechanics
Social and Information Netwo...

Competition is ubiquitous in many complex biological, social, and technological systems, playing an integral role in the evolutionary dynamics of the systems. It is often useful to determine the dominance hierarchy or the rankings of the components of the system that compete for survival and success based on the outcomes of the competitions between them. Here we propose a ranking method based on the random walk on the network representing the competitors as nodes and competit...

Find SimilarView on arXiv

Structural Inference of Hierarchies in Networks

October 9, 2006

87% Match
Aaron Clauset, Cristopher Moore, M. E. J. Newman
Physics and Society
Machine Learning
Data Analysis, Statistics an...

One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to form groups of groups, and so forth, up through all levels of organization in the network. Here, we give a precise definition of hierarchical structure, give a generic model for generating arbitrary hierarchical structure in a random graph, and describe a statistically principled way to learn the set ...

Find SimilarView on arXiv

Towards Ordinal Data Science

July 13, 2023

87% Match
Gerd Stumme, Dominik Dürrschnabel, Tom Hanika
Artificial Intelligence
Discrete Mathematics
Machine Learning

Order is one of the main instruments to measure the relationship between objects in (empirical) data. However, compared to methods that use numerical properties of objects, the amount of ordinal methods developed is rather small. One reason for this is the limited availability of computational resources in the last century that would have been required for ordinal computations. Another reason -- particularly important for this line of research -- is that order-based methods a...

Find SimilarView on arXiv

A multi-class approach for ranking graph nodes: models and experiments with incomplete data

April 29, 2015

87% Match
Corso Gianna M. Del, Francesco Romani
Numerical Analysis
Information Retrieval
Physics and Society

After the phenomenal success of the PageRank algorithm, many researchers have extended the PageRank approach to ranking graphs with richer structures beside the simple linkage structure. In some scenarios we have to deal with multi-parameters data where each node has additional features and there are relationships between such features. This paper stems from the need of a systematic approach when dealing with multi-parameter data. We propose models and ranking algorithms wh...

Find SimilarView on arXiv

Ranking influential nodes in networks from partial information

September 14, 2020

87% Match
Silvia Bartolucci, Fabio Caccioli, ... , Vivo Pierpaolo
Physics and Society
Statistical Mechanics
Other Quantitative Biology

Many complex systems exhibit a natural hierarchy in which elements can be ranked according to a notion of "influence". While the complete and accurate knowledge of the interactions between constituents is ordinarily required for the computation of nodes' influence, using a low-rank approximation we show that in a variety of contexts local information about the neighborhoods of nodes is enough to reliably estimate how influential they are, without the need to infer or reconstr...

Find SimilarView on arXiv