Exploring New Cryptographical Construction of Complex Network Data

2016 ◽  
Author(s):  
Hongyu Wang ◽  
Jin Xu ◽  
Bing Yao
Keyword(s):  
Complex Network ◽  
Network Data

scholarly journals NOESIS: A Framework for Complex Network Data Analysis

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Víctor Martínez ◽  
Fernando Berzal ◽  
Juan-Carlos Cubero
Keyword(s):  
Data Mining ◽  
Open Source ◽  
Complex Network ◽  
Open Source Software ◽  
Network Data ◽  
Analysis Techniques ◽  
Software Analysis ◽  
Open Source Framework ◽  
Network Properties ◽  
Real World Problems

Network data mining has attracted a lot of attention since a large number of real-world problems have to deal with complex network data. In this paper, we present NOESIS, an open-source framework for network-based data mining. NOESIS features a large number of techniques and methods for the analysis of structural network properties, network visualization, community detection, link scoring, and link prediction. The proposed framework has been designed following solid design principles and exploits parallel computing using structured parallel programming. NOESIS also provides a stand-alone graphical user interface allowing the use of advanced software analysis techniques to users without prior programming experience. This framework is available under a BSD open-source software license.

scholarly journals Analysis and Applications of Location-Aware Big Complex Network Data

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-2 ◽  
Author(s):  
Jianxin Li ◽  
Ke Deng ◽  
Xin Huang ◽  
Jiajie Xu
Keyword(s):  
Complex Network ◽  
Network Data ◽  
Location Aware

scholarly journals ESTIMATION OF FLUX BETWEEN INTERACTING NODES ON HUGE INTER-FIRM NETWORKS

2012 ◽  
Vol 16 ◽  
pp. 93-104 ◽  
Author(s):  
KOUTAROU TAMURA ◽  
WATARU MIURA ◽  
MISAKO TAKAYASU ◽  
HIDEKI TAKAYASU ◽  
SATOSHI KITAJIMA ◽  
...  
Keyword(s):  
Random Walk ◽  
Complex Network ◽  
Detailed Balance ◽  
Network Data ◽  
Flow Data ◽  
Fractional Powers ◽  
Transport Models ◽  
Scale Free ◽  
Money Flow ◽  
Real Complex

We analyze Japanese inter-firm network data showing scale-free properties as an example of a real complex network. The data contains information on money flow (annual transaction volume) between about 7000 pairs of firms. We focus on this money-flow data and investigate the correlation between various quantities such as sales or link numbers. We find that the flux from a buyer to a supplier is given by the product of the fractional powers of both sales with different exponents. This result indicates that the principle of detailed balance does not hold in the real transport of money; therefore, random walk type transport models such as PageRank are not suitable.

Abstract #1249: Novel Use of Physician Social Network Data to Map the Gap in the Endocrinology Workforce

2015 ◽  
Vol 21 ◽  
pp. 301
Author(s):  
Armand Krikorian ◽  
Lily Peng ◽  
Zubair Ilyas ◽  
Joumana Chaiban
Keyword(s):  
Social Network ◽  
Network Data ◽  
Social Network Data

The Multilevel p2 Model

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 42-47 ◽  
Author(s):  
Bonne J. H. Zijlstra ◽  
Marijtje A. J. van Duijn ◽  
Tom A. B. Snijders
Keyword(s):  
Social Network ◽  
Network Data ◽  
Mcmc Algorithm ◽  
Independent Observation ◽  
Single Observation ◽  
Multiple Networks ◽  
Social Network Data ◽  
Multiple Observations ◽  
Practical Support ◽  
The Social

The p 2 model is a random effects model with covariates for the analysis of binary directed social network data coming from a single observation of a social network. Here, a multilevel variant of the p 2 model is proposed for the case of multiple observations of social networks, for example, in a sample of schools. The multilevel p 2 model defines an identical p 2 model for each independent observation of the social network, where parameters are allowed to vary across the multiple networks. The multilevel p 2 model is estimated with a Bayesian Markov Chain Monte Carlo (MCMC) algorithm that was implemented in free software for the statistical analysis of complete social network data, called StOCNET. The new model is illustrated with a study on the received practical support by Dutch high school pupils of different ethnic backgrounds.

Collection of Ego-Centered Network Data with Computer-Assisted Interviews

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 7-15 ◽  
Author(s):  
Joachim Gerich ◽  
Roland Lehner
Keyword(s):  
Survey Methods ◽  
A Priori ◽  
Dynamic Structure ◽  
Computer Assisted ◽  
Network Data ◽  
Great Effort ◽  
Self Administration ◽  
Face To Face ◽  
Full Network

Although ego-centered network data provide information that is limited in various ways as compared with full network data, an ego-centered design can be used without the need for a priori and researcher-defined network borders. Moreover, ego-centered network data can be obtained with traditional survey methods. However, due to the dynamic structure of the questionnaires involved, a great effort is required on the part of either respondents (with self-administration) or interviewers (with face-to-face interviews). As an alternative, we will show the advantages of using CASI (computer-assisted self-administered interview) methods for the collection of ego-centered network data as applied in a study on the role of social networks in substance use among college students.

Positional Estimation Within a Latent Space Model for Networks

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 24-33 ◽  
Author(s):  
Susan Shortreed ◽  
Mark S. Handcock ◽  
Peter Hoff
Keyword(s):  
Random Effects ◽  
Network Data ◽  
Random Effects Models ◽  
Space Model ◽  
Network Analyses ◽  
Recent Advances ◽  
Latent Space ◽  
Latent Space Model ◽  
Modeling Data

Recent advances in latent space and related random effects models hold much promise for representing network data. The inherent dependency between ties in a network makes modeling data of this type difficult. In this article we consider a recently developed latent space model that is particularly appropriate for the visualization of networks. We suggest a new estimator of the latent positions and perform two network analyses, comparing four alternative estimators. We demonstrate a method of checking the validity of the positional estimates. These estimators are implemented via a package in the freeware statistical language R. The package allows researchers to efficiently fit the latent space model to data and to visualize the results.

Sign in / Sign up

Export Citation Format

Share Document