Evidence map›Paper›PMID 33286545›Full record

ArticleEntropy (Basel, Switzerland)2020

Development of Stock Networks Using Part Mutual Information and Australian Stock Market Data.

Yan Yan, Boyao Wu, Tianhai Tian, Hu Zhang

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.

0numbers the graph read from it
0cells of the map it votes in
12citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

12 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Yan YanSchool of Mathematics and Physics, Wuhan Institute of Technology, Wuhan 430205, China.ORCID 0000-0002-5833-4607
Boyao WuSchool of Mathematics, Monash University, Melbourne, VIC 3800, Australia.
Tianhai TianSchool of Mathematics, Monash University, Melbourne, VIC 3800, Australia.ORCID 0000-0001-6191-0209
Hu ZhangSchool of Statistics and Mathematics, Zhongnan University of Economics and Law, Wuhan 430073, China.

Funding

National Natural Science Foundation of China 11571368National Office for Philosophy and Social Sciences 17BTJ017Wuhan Institute of Technology supporting fund 1234
6 · The paper itself

Abstract

Complex network is a powerful tool to discover important information from various types of big data. Although substantial studies have been conducted for the development of stock relation networks, correlation coefficient is dominantly used to measure the relationship between stock pairs. Information theory is much less discussed for this important topic, though mutual information is able to measure nonlinear pairwise relationship. In this work we propose to use part mutual information for developing stock networks. The path-consistency algorithm is used to filter out redundant relationships. Using the Australian stock market data, we develop four stock relation networks using different orders of part mutual information. Compared with the widely used planar maximally filtered graph (PMFG), we can generate networks with cliques of large size. In addition, the large cliques show consistency with the structure of industrial sectors. We also analyze the connectivity and degree distributions of the generated networks. Analysis results suggest that the proposed method is an effective approach to develop stock relation networks using information theory.

Indexed as

cliquecorrelation coefficientdegreepart mutual informationpath-consistencystock relation network

Identifiers

PMID33286545
PMCPMC7517323

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.