Research Papers

Academic publications and research contributions in computer science, focusing on network analysis, multi-agent systems, and graph algorithms.

Last updated: 6/2/2025Source: Semantic Scholar API
Total Papers
3
Published research
Citations
212
Academic impact
H-Index
2
Research influence
Active Years
2023-2023
Research period

Published Research

Most Cited

Multi-Agent Collaboration: Harnessing the Power of Intelligent LLM Agents

Yashar Talebirad, Amirhossein Nadiri
2023
arXiv.org

Abstract:

In this paper, we present a novel framework for enhancing the capabilities of large language models (LLMs) by leveraging the power of multi-agent systems. Our framework introduces a collaborative environment where multiple intelligent agent components, each with distinctive attributes and roles, work together to handle complex tasks more efficiently and effectively. We demonstrate the practicality and versatility of our framework through case studies in artificial general intelligence (AGI), specifically focusing on the Auto-GPT and BabyAGI models. We also examine the"Gorilla"model, which integrates external APIs into the LLM. Our framework addresses limitations and challenges such as looping issues, security risks, scalability, system evaluation, and ethical considerations. By modeling various domains such as courtroom simulations and software development scenarios, we showcase the potential applications and benefits of our proposed multi-agent system. Our framework provides an avenue for advancing the capabilities and performance of LLMs through collaboration and knowledge exchange among intelligent agents.

📊207 citations

USIWO: A Local Community Search Algorithm for Uncertain Graphs

Yashar Talebirad, Mohammadmahdi Zafarmand, Osmar R. Za¨ıane, Christine Largeron
2023
International Conference on Advances in Social Networks Analysis and Mining

Abstract:

Community detection and community search are both critical tasks in graph mining, each serving unique purposes and presenting distinct challenges. The former aims to partition the graph vertices into densely connected subsets, while the latter adopts a more ego-centric approach, focusing on a specific node or group of nodes to identify a densely-connected subgraph that contains these query nodes. However, many real-world networks are characterized by uncertainty, leading to the notion of uncertain or probabilistic graphs. The transition from deterministic graphs to uncertain graphs introduces new challenges. We present USIWO, an efficient and practical solution for community search in unweighted uncertain graphs with edge uncertainty. In addition to being accurate, the approach utilizes an efficient data structure for storing only the relevant parts of the network in main memory, eliminating the need to store the entire graph, making it a valuable tool in finding the core of a community on very large uncertain graphs, when there is limited time and memory available. The algorithm operates through a one-node-expansion approach, based on the concepts of strong and weak links within a graph. Experimental results on several datasets demonstrate the algorithm's efficiency and performance.

📊0 citations

Citation data is automatically updated weekly via Semantic Scholar API.
For collaboration opportunities or questions about this research,get in touch.

type a command or path...
location: Edmonton, AB--:--:-- --