Yanfeng Liu | Graph Models | Best Researcher Award

Published on by Network Science

Prof. Yanfeng Liu | Graph Models | Best Researcher Award

Visiting Professor at Pukyong National University, South Korea📖

Dr. Liu Yanfeng is a Visiting Professor at Pukyong National University (PKNU), specializing in logistics economics, supply chain management, and consumption economics. He has a strong research background in outward foreign direct investment and the digital economy, contributing to various funded research projects. Dr. Liu actively reviews for top-tier journals and is a member of multiple academic societies related to international commerce and logistics.

Profile

Scopus Profile

Orcid Profile

Google Scholar Profile

Education Background🎓

  • Ph.D. in International Commerce and Logistics – Chung-Ang University (2018–2021)
  • M.S. in International Commerce and Logistics – Chung-Ang University (2016–2018)
  • B.S. in Economics (Minor: Public Human Resources) – Chung-Ang University (2012–2016)

Professional Experience🌱

Dr. Liu has been a Visiting Professor at PKNU since August 2022, where he teaches courses on global supply chain management, technology investment, corporate growth strategies, and research methodologies. His expertise spans logistics economics, innovation in manufacturing, and technology management.=

Research Interests🔬
His research focuses on logistics economics, supply chain management, consumption economics, and outward foreign direct investment, with recent work exploring the impact of digital economies on productivity from a consumer perspective. He has contributed to research projects funded by the Jiangsu Provincial Department of Education, Gyeonggi Yeongtaek Port Corporation, and the Korea Automobile Manufacturers Association.
Author Metrics

Dr. Liu serves as a reviewer for prestigious SSCI and ESCI journals, including Journal of Travel & Tourism Marketing, International Journal of Retail & Distribution Management, Economic Analysis and Policy, and Asia Pacific Journal of Marketing and Logistics. He is an active member of multiple professional societies, including the Korea Maritime Economics Association, Logistics Society, and Northeast Asia Economic Society.

Awards & Honors

  • Best Paper Award, Korea Maritime Institute (2021)
  • Graduate School Dean’s Award (A), Chung-Ang University (2022)
  • Third Prize, Korea Maritime Institute of Fisheries Development Corporate Achievement Publication Academic Conference (2021, 2023)
Publications Top Notes 📄

1. Revenge Buying After the Lockdown: Based on the SOR Framework and TPB Model

  • Authors: Y. Liu, L. Cai, F. Ma, X. Wang
  • Journal: Journal of Retailing and Consumer Services
  • Volume: 72
  • Article ID: 103263
  • Year: 2023
  • Citations: 80
  • Abstract: This study examines consumer behavior following COVID-19 lockdowns, focusing on “revenge buying.” Using the Stimulus-Organism-Response (SOR) framework and Theory of Planned Behavior (TPB), the paper analyzes psychological factors driving excessive consumption post-lockdown.

2. Revenge Tourism After the Lockdown: Based on the SOR Framework and Extended TPB Model

  • Authors: S. Zhao, Y. Liu
  • Journal: Journal of Travel & Tourism Marketing
  • Volume: 40 (5)
  • Pages: 416-433
  • Year: 2023
  • Citations: 19
  • Abstract: This study investigates the surge in post-lockdown travel, termed “revenge tourism.” An extended TPB model and SOR framework are employed to explore psychological motivations, travel intention, and actual behavior.

3. Psychological Antecedents of Telehealth Acceptance: A Technology Readiness Perspective

  • Authors: X. Li, Y. Zhou, Y. Liu, X. Wang, K.F. Yuen
  • Journal: International Journal of Disaster Risk Reduction
  • Volume: 91
  • Article ID: 103688
  • Year: 2023
  • Citations: 17
  • Abstract: The paper explores factors influencing the adoption of telehealth services, emphasizing technology readiness as a key determinant. It assesses consumer trust, perceived ease of use, and pandemic-induced behavioral shifts.

4. The Determinants of China’s Outward Foreign Direct Investment: A Vector Error Correction Model Analysis of Coastal and Landlocked Countries

  • Authors: Y. Liu, M. Su, J. Zhao, S. Martin, K.F. Yuen, C.B. Lee
  • Journal: Economic Change and Restructuring
  • Volume: 56 (1)
  • Pages: 29-56
  • Year: 2023
  • Citations: 15
  • Abstract: This study uses Vector Error Correction Model (VECM) analysis to examine factors influencing China’s outward foreign direct investment (OFDI) in coastal vs. landlocked provinces, identifying key economic and policy drivers.

5. Revenge Buying: The Role of Negative Emotions Caused by Lockdowns

  • Authors: Y. Liu, X. Li, K.F. Yuen
  • Journal: Journal of Retailing and Consumer Services
  • Volume: 75
  • Article ID: 103523
  • Year: 2023
  • Citations: 12
  • Abstract: This paper explores how negative emotions triggered by lockdowns influence revenge buying behavior. It integrates emotional theories with consumer decision-making models to explain impulsive post-pandemic purchases.

Conclusion

Dr. Liu Yanfeng is a strong candidate for the Best Researcher Award due to his high-impact publications, interdisciplinary expertise, research funding success, and academic contributions. Addressing areas such as diversification of research, global collaborations, and industry applications would further enhance his profile. Nonetheless, his existing achievements position him as a top-tier researcher in logistics economics and consumer behavior studies.

Alireza Rezvanian | Complex Social Networks | Network Science Excellence Award

Published on by Network Science

Assist. Prof. Dr. Alireza Rezvanian | Complex Social Networks | Network Science Excellence Award

Assistant Professor at University of Science and Culture, Iran📖

Dr. Alireza Rezvanian is an accomplished academic and researcher, serving as an Assistant Professor at the University of Science and Culture (USC) in Tehran, Iran. He holds multiple editorial positions, including Associate Editor for journals such as CAAI Transactions on Intelligence Technology, Human-Centric Computing and Information Sciences, The Journal of Engineering, and Data in Brief. Dr. Rezvanian is actively involved in various professional and scientific activities, including serving as the Director of Information and Scientific Resources at USC and contributing to the IEEE Computer Society Iran Chapter.

Profile

Scopus Profile

Orcid Profile

Google Scholar Profile

Education Background🎓

Dr. Rezvanian completed his Ph.D. in Computer Engineering from Amirkabir University of Technology (Tehran Polytechnic) in 2016, under the guidance of Dr. Mohammad Reza Meybodi. His doctoral thesis focused on “Stochastic Graphs for Social Network Analysis.” He holds a Master’s degree in Computer Engineering from Islamic Azad University of Qazvin (2010), where he specialized in improving Artificial Immune System algorithms using Learning Automata for dynamic environments. He also earned a Bachelor’s degree in Computer Engineering from Bu-Ali Sina University of Hamedan (2007).

Professional Experience🌱

Dr. Rezvanian has extensive teaching and research experience across multiple prestigious institutions. Currently, he is an Assistant Professor at the University of Science and Culture, Tehran. He is also an Adjunct Professor at Amirkabir University of Technology, the University of Tehran, and Tarbiat Modares University. His leadership roles include serving as the Head of the Computer Engineering Department at USC (2021-2023) and as the Director of Information and Scientific Resources at USC since 2023. He has previously held research positions at the Institute for Research in Fundamental Sciences (IPM) and the Niroo Research Institute (NRI).

Research Interests🔬

Dr. Rezvanian’s research interests lie in the areas of complex networks, social network analysis, machine learning, learning automata, data mining, and soft computing. His work focuses on the application of evolutionary algorithms, image processing, and stochastic graphs for modeling social networks. His research aims to provide insights into real-world applications through innovative techniques in network analysis and machine learning.

Author Metrics

Dr. Rezvanian has a strong academic presence, with an H-index of 26 on Google Scholar (2024), 23 on Scopus, and 18 on Web of Science. He has authored and co-authored numerous research articles in renowned journals and conferences, contributing significantly to the fields of computer science, machine learning, and network analysis. His work has earned him recognition and a substantial citation count, further solidifying his impact in academia.

Publications Top Notes 📄

1. Robust Fall Detection Using Human Shape and Multi-Class Support Vector Machine

  • Authors: H. Foroughi, A. Rezvanian, A. Paziraee
  • Conference: Sixth Indian Conference on Computer Vision, Graphics & Image Processing (ICVGIP 2008)
  • Year: 2008
  • Summary: This paper focuses on a robust fall detection system utilizing human shape and a multi-class support vector machine (SVM) for classifying human body shapes and movements. The system aims to effectively detect falls, which is crucial in healthcare applications like elderly care.

2. Sampling from Complex Networks Using Distributed Learning Automata

  • Authors: A. Rezvanian, M. Rahmati, M.R. Meybodi
  • Journal: Physica A: Statistical Mechanics and its Applications
  • Volume: 396
  • Pages: 224–234
  • Year: 2014
  • Summary: This paper introduces a method for sampling complex networks using distributed learning automata (LA), a technique inspired by machine learning algorithms. The approach aims to enhance network analysis by efficiently exploring and sampling complex graph structures.

3. Minimum Positive Influence Dominating Set and Its Application in Influence Maximization: A Learning Automata Approach

  • Authors: M.M.D. Khomami, A. Rezvanian, N. Bagherpour, M.R. Meybodi
  • Journal: Applied Intelligence
  • Volume: 48 (3)
  • Pages: 570–593
  • Year: 2018
  • Summary: This paper presents a novel approach for solving the Minimum Positive Influence Dominating Set (MPIDS) problem, using learning automata for influence maximization in social networks. The proposed method addresses the optimization challenges in selecting influential nodes for spreading information effectively in network-based applications.

4. CDEPSO: A Bi-population Hybrid Approach for Dynamic Optimization Problems

  • Authors: J.K. Kordestani, A. Rezvanian, M.R. Meybodi
  • Journal: Applied Intelligence
  • Volume: 40 (4)
  • Pages: 682–694
  • Year: 2014
  • Summary: The paper introduces CDEPSO (Cognitive Dynamic Evolutionary Particle Swarm Optimization), a hybrid approach that integrates bi-population evolutionary algorithms to address dynamic optimization problems. The method aims to improve the solution quality and efficiency in environments where the optimization landscape changes over time.

5. Cellular Edge Detection: Combining Cellular Automata and Cellular Learning Automata

  • Authors: M. Hasanzadeh Mofrad, S. Sadeghi, A. Rezvanian, M.R. Meybodi
  • Journal: AEU-International Journal of Electronics and Communications
  • Volume: 69 (9)
  • Pages: 1282–1290
  • Year: 2015
  • Summary: This paper explores the combination of cellular automata (CA) and cellular learning automata (CLA) for edge detection in image processing. The approach leverages the computational power of CA and CLA to enhance the edge detection process in digital images, contributing to improvements in image recognition and processing tasks.

Conclusion

Dr. Alireza Rezvanian is highly deserving of the Network Science Excellence Award due to his pioneering contributions to the field of complex networks and social network analysis. His research not only provides innovative methods for understanding and optimizing networks but also demonstrates a strong academic leadership role in advancing network science. With his continued focus on interdisciplinary research and industry collaboration, Dr. Rezvanian is poised to make even greater contributions to the field of network science, making him a worthy recipient of this prestigious award.

Innovation Excellence Award in Network Science and Graph Analytics

Published on by Network Science

Introduction of Innovation Excellence Award in Network Science and Graph Analytics

Welcome to the forefront of recognition in the realm of Network Science and Graph Analytics! The Innovation Excellence Award celebrates pioneers, visionaries, and groundbreaking contributors who have significantly advanced the fields of network science and graph analytics. This prestigious award is a testament to the relentless pursuit of innovation that shapes the future of interconnected systems.

Award Eligibility:

This award is open to individuals and teams across academia, industries, and research institutions who have demonstrated exceptional innovation in the field of Network Science and Graph Analytics.

Age Limits:

There are no age restrictions; this award recognizes excellence regardless of age.

Qualification:

Open to individuals and teams with a proven track record of innovative contributions in Network Science and Graph Analytics.

Publications:

Candidates should have notable publications that showcase their impactful work in the field.

Requirements:
  • Demonstration of groundbreaking innovation.
  • A record of significant contributions to Network Science and Graph Analytics.
  • Noteworthy publications showcasing advancements.
Evaluation Criteria:

Entries will be evaluated based on the originality, impact, and relevance of the innovation in Network Science and Graph Analytics.

Submission Guidelines:
  1. Submit a comprehensive biography highlighting relevant achievements.
  2. Include an abstract summarizing the innovative contribution.
  3. Attach supporting files showcasing the impact of the work.
Recognition:

The awardee will receive public recognition, a trophy, and the opportunity to present their work at a prominent industry event.

Community Impact:

The award aims to foster a collaborative community by recognizing and promoting impactful contributions that benefit the broader network science and graph analytics community.

Biography:

Provide a brief but comprehensive biography highlighting your journey, achievements, and contributions to the field.

Abstract and Supporting Files:

Include a concise abstract summarizing the innovation and supporting files that demonstrate the impact of the work.

[post_grid id="32485"]

Random Graph Models and Network Generative Models

Published on by Network Science

Introduction to Random Graph Models and Network Generative Models

 

Random graph models and network generative models are powerful tools in network science and graph theory. They provide a framework for simulating and understanding the structure and properties of complex networks, offering insights into real-world systems' behavior and evolution. These models play a crucial role in a wide range of applications, from social networks and biological networks to communication and transportation  systems.

Erdős-Rényi Model:

This classic random graph model generates networks by connecting nodes with a certain probability. It serves as a foundation for understanding phase transitions in network properties,, like connectivity and the emergence of the giant component.

Barabási-Albert Model:

The preferential attachment model, proposed by Barabási and Albert,  generates scale-free networks where new nodes preferentially connect to existing high-degree nodes. This model is instrumental in explaining the emergence of hubs in various real-world networks.

Exponential Random Graph Models (ERGMs):

ERGMs are statistical models used to capture the underlying mechanisms that lead to the formation of specific network structures, incorporating features like reciprocity, transitivity, and degree distributions.

Stochastic Block Models:

These models group nodes into different blocks or communities,  each with its own set of connection probabilities. Stochastic block models are valuable for modeling  community structure in social networks and other networked systems.

Generative Adversarial Networks (GANs) for Networks:

Leveraging GANs, researchers can generate synthetic networks that closely mimic the properties of real networks. This approach is particularly useful for generating data for testing algorithms and studying network robustness.

Random graph models and network generative models provide a powerful framework for understanding, generating, and analyzing networks of varying complexities. These subtopics highlight some of the key models and methodologies within this field, which continue to advance  our understanding  of network structures and behaviors.

[post_grid id="32331"]

Graph Data Structures and Algorithms

Published on by Network Science

Introduction of Graph Data Structures and Algorithms

 

Graph data structures and algorithms are fundamental components of computer science, powering a wide range of applications in fields such as social networks, transportation systems, recommendation engines, and more. These research areas focus on the efficient representation, storage, and processing of graph-based data, with the aim of solving complex problems and optimizing various processes.

Graph Traversal and Search Algorithms:

This subfield delves into algorithms for efficiently traversing and searching graphs. Key algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS) are used for tasks  such as pathfinding, connectivity analysis, and recommendation systems.

Graph Clustering and Community Detection:

Researchers in this area develop algorithms to identify clusters or communities within large graphs. This is crucial for understanding network structure, detecting anomalies, and enhancing recommendation systems.

Graph-Based Machine Learning:

Graphs are increasingly used in machine learning models,, where nodes represent data points, and edges capture relationships. Research focuses on developing algorithms for graph-based deep learning, semi-supervised learning, and node classification.

Network Flow Algorithms:

Network flow algorithms, including the Ford-Fulkerson and Max-Flow Min-Cut algorithms, are essential for optimizing transportation networks, resource allocation, and network design.

Graph Database Systems:

This subtopic explores the design and optimization of graph database systems, which are crucial for efficiently querying and managing large-scale graph data. Research in this area aims to improve data retrieval, storage, and scalability.

Graph data structures and algorithms research continue to advance as the need for analyzing and processing complex interconnected data grows. These subtopics represent key areas where researchers work to develop innovative solutions that have a profound impact on diverse applications in computer  science and beyond.

[post_grid id="32331"]