Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Fei Tan is active.

Publication


Featured researches published by Fei Tan.


EPL | 2013

Cascading failures of loads in interconnected networks under intentional attack

Fei Tan; Yongxiang Xia; Wenping Zhang; Xinyu Jin

Cascading failures of loads in isolated networks under random failures or intentional attacks have been studied in the past decade. The corresponding results for interconnected networks remain missing. In this paper we extend the cascading failure model used in isolated networks to the case of interconnected networks, and study cascades of failures in a data-packet transport scenario. We find that for sparse coupling, enhancing the coupling probability can make interconnected networks more robust against intentional attacks, but keeping increasing the coupling probability has the opposite effect for dense coupling. Additionally, the optimal coupling probability is largely affected by the coupling preference. Finally, assortative coupling is more helpful to resist the cascades compared to disassortative or random coupling. These results can be useful for the design and optimization of interconnected networks such as communication networks, power grids and transportation systems.


Physical Review E | 2014

Traffic congestion in interconnected complex networks

Fei Tan; Jiajing Wu; Yongxiang Xia; Chi K. Tse

Traffic congestion in isolated complex networks has been investigated extensively over the last decade. Coupled network models have recently been developed to facilitate further understanding of real complex systems. Analysis of traffic congestion in coupled complex networks, however, is still relatively unexplored. In this paper, we try to explore the effect of interconnections on traffic congestion in interconnected Barabási-Albert scale-free networks. We find that assortative coupling can alleviate traffic congestion more readily than disassortative and random coupling when the node processing capacity is allocated based on node usage probability. Furthermore, the optimal coupling probability can be found for assortative coupling. However, three types of coupling preferences achieve similar traffic performance if all nodes share the same processing capacity. We analyze interconnected Internet autonomous-system-level graphs of South Korea and Japan and obtain similar results. Some practical suggestions are presented to optimize such real-world interconnected networks accordingly.


PLOS ONE | 2014

Link Prediction in Complex Networks: A Mutual Information Perspective

Fei Tan; Yongxiang Xia; Boyao Zhu

Topological properties of networks are widely applied to study the link-prediction problem recently. Common Neighbors, for example, is a natural yet efficient framework. Many variants of Common Neighbors have been thus proposed to further boost the discriminative resolution of candidate links. In this paper, we reexamine the role of network topology in predicting missing links from the perspective of information theory, and present a practical approach based on the mutual information of network structures. It not only can improve the prediction accuracy substantially, but also experiences reasonable computing complexity.


Physical Review E | 2015

Robust-yet-fragile nature of interdependent networks.

Fei Tan; Yongxiang Xia; Zhi Wei

Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et al. [Europhys. Lett. 92, 68002 (2010)] further indicated that the more intersimilar networks are, the more robust they are to random failures. When traffic load is considered, how do the coupling patterns impact cascading failures in interdependent networks? This question has been largely unexplored until now. In this paper, we address this question by investigating the robustness of interdependent Erdös-Rényi random graphs and Barabási-Albert scale-free networks under either random failures or intentional attacks. It is found that interdependent Erdös-Rényi random graphs are robust yet fragile under either random failures or intentional attacks. Interdependent Barabási-Albert scale-free networks, however, are only robust yet fragile under random failures but fragile under intentional attacks. We further analyze the interdependent communication network and power grid and achieve similar results. These results advance our understanding of how interdependency shapes network robustness.


Scientific Reports | 2015

Distinct microbiological signatures associated with triple negative breast cancer

Sagarika Banerjee; Zhi Wei; Fei Tan; Kristen N. Peck; Natalie Shih; Michael Feldman; Timothy R. Rebbeck; James C. Alwine; Erle S. Robertson

Infectious agents are the third highest human cancer risk factor and may have a greater role in the origin and/or progression of cancers, and related pathogenesis. Thus, knowing the specific viruses and microbial agents associated with a cancer type may provide insights into cause, diagnosis and treatment. We utilized a pan-pathogen array technology to identify the microbial signatures associated with triple negative breast cancer (TNBC). This technology detects low copy number and fragmented genomes extracted from formalin-fixed paraffin embedded archival tissues. The results, validated by PCR and sequencing, define a microbial signature present in TNBC tissue which was underrepresented in normal tissue. Hierarchical clustering analysis displayed two broad microbial signatures, one prevalent in bacteria and parasites and one prevalent in viruses. These signatures demonstrate a new paradigm in our understanding of the link between microorganisms and cancer, as causative or commensal in the tumor microenvironment and provide new diagnostic potential.


international conference on data mining | 2016

Modeling Real Estate for School District Identification

Fei Tan; Chaoran Cheng; Zhi Wei

The affiliated school district of a real estate property is often a crucial concern. How to automate the identification of residential homes located in a favorable educational environment, however, is largely unexplored until now. The availability of heterogeneous estate-related data offers a great opportunity for this task. Nevertheless, it is such heterogeneity that poses significant challenges to their amalgamation in a unified fashion. To this end, we develop G-LRMM model to integrate digital price, textual comments, and geographical location information together. The proposed approach is able to capture the in-depth interaction among multi-type data greatly. The evaluation on the dataset of Beijing property market justifies the benefits of our approach over baselines. The further comparison among different components is also conducted and demonstrates their important roles. Moreover, the proposed model can offer useful insights into modeling heterogeneous data sources.


international conference on data mining | 2017

Time-Aware Latent Hierarchical Model for Predicting House Prices

Fei Tan; Chaoran Cheng; Zhi Wei

It is widely acknowledged that the value of a house is the mixture of a large number of characteristics. House price prediction thus presents a unique set of challenges in practice. While a large body of works are dedicated to this task, their performance and applications have been limited by the shortage of long time span of transaction data, the absence of real-world settings and the insufficiency of housing features. To this end, a time-aware latent hierarchical model is introduced to capture underlying spatiotemporal interactions behind the evolution of house prices. The hierarchical perspective obviates the need for historical transaction data of exactly same houses when temporal effects are considered. The proposed framework is examined on a large-scale dataset of the property transaction in Beijing. The whole experimental procedure strictly complies with the real-world scenario. The empirical evaluation results demonstrate the outperformance of our approach over alternative competitive methods.


International Journal of Modern Physics C | 2016

Oscillations in interconnected complex networks under intentional attack

Wenping Zhang; Yongxiang Xia; Fei Tan

Many real-world networks are interconnected with each other. In this paper, we study the traffic dynamics in interconnected complex networks under an intentional attack. We find that with the shortest time delay routing strategy, the traffic dynamics can show the stable state, periodic, quasi-periodic and chaotic oscillations, when the capacity redundancy parameter changes. Moreover, compared with isolated complex networks, oscillations always take place in interconnected networks more easily. Thirdly, in interconnected networks, oscillations are affected strongly by the coupling probability and coupling preference.


Physica A-statistical Mechanics and Its Applications | 2013

Hybrid routing on scale-free networks

Fei Tan; Yongxiang Xia


siam international conference on data mining | 2018

Modeling Item-specific Effects for Video Click.

Fei Tan; Kuang Du; Zhi Wei; Haoran Liu; Chenguang Qin; Ran Zhu

Collaboration


Dive into the Fei Tan's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Zhi Wei

New Jersey Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Chaoran Cheng

New Jersey Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Erle S. Robertson

University of Pennsylvania

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Fang Wei

Shanghai Jiao Tong University

View shared research outputs
Top Co-Authors

Avatar

Jiajing Wu

Sun Yat-sen University

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge