ID: 1511.08830

Disentangling bipartite and core-periphery structure in financial networks

November 25, 2015

View on ArXiv

Similar papers 2

Comparative Study for Inference of Hidden Classes in Stochastic Block Models

July 10, 2012

85% Match
Pan Zhang, Florent Krzakala, ... , Zdeborová Lenka
Machine Learning
Statistical Mechanics
Data Analysis, Statistics an...
Machine Learning

Inference of hidden classes in stochastic block model is a classical problem with important applications. Most commonly used methods for this problem involve na\"{\i}ve mean field approaches or heuristic spectral methods. Recently, belief propagation was proposed for this problem. In this contribution we perform a comparative study between the three methods on synthetically created networks. We show that belief propagation shows much better performance when compared to na\"{\...

Find SimilarView on arXiv

From Ecology to Finance (and Back?): Recent Advancements in the Analysis of Bipartite Networks

October 27, 2017

85% Match
Mika J. Straka, Guido Caldarelli, ... , Saracco Fabio
Physics and Society
Populations and Evolution
General Finance

Bipartite networks provide an insightful representation of many systems, ranging from mutualistic networks of species interactions to investment networks in finance. The analysis of their topological structures has revealed the ubiquitous presence of properties which seem to characterize many - apparently different - systems. Nestedness, for example, has been observed in plants-pollinator as well as in country-product trade networks. This has raised questions about the signif...

Find SimilarView on arXiv

Reconstruction of Interbank Network using Ridge Entropy Maximization Model

January 13, 2020

85% Match
Yuichi Ikeda, Hidetoshi Takeda
General Economics
Economics

We develop a network reconstruction model based on entropy maximization considering the sparsity of networks. We reconstruct the interbank network in Japan from financial data in individual banks' balance sheets using the developed reconstruction model from 2000 to 2016. The observed sparsity of the interbank network is successfully reproduced. We examine the characteristics of the reconstructed interbank network by calculating important network attributes. We obtain the foll...

Find SimilarView on arXiv

Fast and reliable inference algorithm for hierarchical stochastic block models

November 14, 2017

85% Match
Yongjin Park, Joel S. Bader
Machine Learning

Network clustering reveals the organization of a network or corresponding complex system with elements represented as vertices and interactions as edges in a (directed, weighted) graph. Although the notion of clustering can be somewhat loose, network clusters or groups are generally considered as nodes with enriched interactions and edges sharing common patterns. Statistical inference often treats groups as latent variables, with observed networks generated from latent group ...

Find SimilarView on arXiv

Reconstructing mesoscale network structures

May 15, 2018

85% Match
Jeude Jeroen van Lidth de, Clemente Riccardo Di, Guido Caldarelli, ... , Squartini Tiziano
Physics and Society
Data Analysis, Statistics an...

When facing complex mesoscale network structures, it is generally believed that (null) models encoding the modular organization of nodes must be employed. The present paper focuses on two block structures that characterize the mesoscale organization of many real-world networks, i.e. the bow-tie and the core-periphery ones. Our analysis shows that constraining the network degree sequence is often enough to reproduce such structures, as confirmed by model selection criteria as ...

Find SimilarView on arXiv

Model Selection for Degree-corrected Block Models

July 17, 2012

85% Match
Xiaoran Yan, Cosma Rohilla Shalizi, Jacob E. Jensen, Florent Krzakala, Cristopher Moore, Lenka Zdeborova, ... , Zhu Yaojia
cs.SI
cond-mat.stat-mech
math.ST
physics.soc-ph
stat.ML
stat.TH

The proliferation of models for networks raises challenging problems of model selection: the data are sparse and globally dependent, and models are typically high-dimensional and have large numbers of latent variables. Together, these issues mean that the usual model-selection criteria do not work properly for networks. We illustrate these challenges, and show one way to resolve them, by considering the key network-analysis problem of dividing a graph into communities or bloc...

Find SimilarView on arXiv

Maximum entropy approach to link prediction in bipartite networks

May 11, 2018

85% Match
M. Baltakiene, K. Baltakys, D. Cardamone, F. Parisi, T. Radicioni, M. Torricelli, ... , Saracco F.
Physics and Society
Social and Information Netwo...

Within network analysis, the analytical maximum entropy framework has been very successful for different tasks as network reconstruction and filtering. In a recent paper, the same framework was used for link-prediction for monopartite networks: link probabilities for all unobserved links in a graph are provided and the most probable links are selected. Here we propose the extension of such an approach to bipartite graphs. We test our method on two real world networks with dif...

Find SimilarView on arXiv

Supervised Blockmodelling

September 25, 2012

85% Match
Leto Peel
Machine Learning
Social and Information Netwo...
Machine Learning

Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption). Blockmodels provide a solution to these issues, being capable of modelling assortative and disassortative interactions, and learning the pattern of interaction...

Find SimilarView on arXiv

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

April 21, 2023

84% Match
Yang Li, Bo Yang, Xuehua Zhao, ... , Chen Hechang
Social and Information Netwo...

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, ...

Find SimilarView on arXiv

Core-periphery structure requires something else in the network

October 19, 2017

84% Match
Sadamori Kojaku, Naoki Masuda
Physics and Society
Social and Information Netwo...

A network with core-periphery structure consists of core nodes that are densely interconnected. In contrast to community structure, which is a different meso-scale structure of networks, core nodes can be connected to peripheral nodes and peripheral nodes are not densely interconnected. Although core-periphery structure sounds reasonable, we argue that it is merely accounted for by heterogeneous degree distributions, if one partitions a network into a single core block and a ...

Find SimilarView on arXiv