Search for: complex-networks
Total 181 records
Article International Journal of Modern Physics C ; Volume 27, Issue 8 , 2016 ; 01291831 (ISSN) ; Khansari, M ; Sharif University of Technology
World Scientific Publishing Co. Pte Ltd
In this paper, we propose a new algorithm that minimizes the worst expected growth of an epidemic by reducing the size of the largest connected component (LCC) of the underlying contact network. The proposed algorithm is applicable to any level of available resources and, despite the greedy approaches of most immunization strategies, selects nodes simultaneously. In each iteration, the proposed method partitions the LCC into two groups. These are the best candidates for communities in that component, and the available resources are sufficient to separate them. Using Laplacian spectral partitioning, the proposed method performs community detection inference with a time complexity that rivals...
Weighted coupling for geographical networks: Application to reducing consensus time in sensor networks, Article Physics Letters, Section A: General, Atomic and Solid State Physics ; Volume 374, Issue 38 , 2010 , Pages 3920-3925 ; 03759601 (ISSN) ; Mazloomian, A ; Sharif University of Technology
Although many complex real-world networks are weighted, unweighted networks are used in many applications such as sensor networks. In this Letter it is shown using properly weighted networks the performance can be greatly enhanced by reducing the time necessary for the average consensus. Random geographical models are adapted as network models and a method based on mutually coupled phase oscillators is used for providing average consensus over the network. The consensus time is calculated by numerically solving the network's differential equations and monitoring the average error. The simulation results on some sample networks show that the consensus time is dramatically reduced when the...
Article Royal Society Open Science ; Volume 4, Issue 2 , 2017 ; 20545703 (ISSN) ; Orouskhani, Y ; Asgari, M ; Alipourfard, N ; Perc, M ; Sharif University of Technology
Royal Society 2017
Online social networks play a major role in modern societies, and they have shaped the way social relationships evolve. Link prediction in social networks has many potential applications such as recommending new items to users, friendship suggestion and discovering spurious connections. Many real social networks evolve the connections in multiple layers (e.g. multiple social networking platforms). In this article, we study the link prediction problem in multiplex networks. As an example, we consider a multiplex network of Twitter (as a microblogging service) and Foursquare (as a location-based social network). We consider social networks of the same users in these two platforms and develop a...
Article Royal Society Open Science ; Volume 7, Issue 1 , 2020 ; Ghanbarnejad, F ; Hövel, P ; Poletto, C ; Sharif University of Technology
Royal Society Publishing 2020
In ecological systems, heterogeneous interactions between pathogens take place simultaneously. This occurs, for instance, when two pathogens cooperate, while at the same time, multiple strains of these pathogens co-circulate and compete. Notable examples include the cooperation of human immunodeficiency virus with antibiotic-resistant and susceptible strains of tuberculosis or some respiratory infections with Streptococcus pneumoniae strains. Models focusing on competition or cooperation separately fail to describe how these concurrent interactions shape the epidemiology of such diseases. We studied this problem considering two cooperating pathogens, where one pathogen is further structured...
Article 8th International Multitopic Conference, INMIC 2004, 24 December 2004 through 26 December 2004 ; 2004 , Pages 506-511 ; 0780386809 (ISBN); 9780780386808 (ISBN) ; Jalili, R ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2004
Nowadays, security has become an important issue for organizations especially in e-commerce applications. The spreading of networks and increasing of their complexity has complicated the task of security analysis, therefore automatic approaches have received more attention recently. This paper proposes a model-based approach to analyze the overall security of a network, based on the interaction of hosts within the network. A simple language is introduced far modeling securityrelated behaviours of networks and systems. Using the language, a case study is described and its formal model and security properties are presented. © 2004 IEEE
Article IEEE Communications Letters ; Volume 15, Issue 8 , August , 2011 , Pages 896-898 ; 10897798 (ISSN) ; Rabiee, H. R ; Sharif University of Technology
This letter presents a complex network model for the BitTorrent; the most popular peer-to-peer network. Three important topological characteristics; (i) degree distribution, (ii) clustering coefficient and (iii) average path length of this network are analytically modeled. The analytical computations are confirmed by simulations. Moreover, the accuracy of the proposed model was confirmed by exploiting a BitTorrent simulator
Article Physica A: Statistical Mechanics and its Applications ; Volume 389, Issue 23 , 2010 , Pages 5521-5529 ; 03784371 (ISSN) ; Rabiee, H. R ; Jalili, M ; Sharif University of Technology
Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs' cooperation properties and their abundance in a number of real-world networks including yeast proteinprotein interaction, human brain, protein structure, email communication, dolphins' social interaction, Zachary karate club and Net-science coauthorship networks. First,...
Article Physica A: Statistical Mechanics and its Applications ; Volume 497 , 1 May , 2018 , Pages 166-184 ; 03784371 (ISSN) ; Hasheminezhad, R ; Ghalebi, E ; Nazemian, A ; Grosu, R ; Movaghar, A ; Rabiee, H. R ; Sharif University of Technology
Elsevier B.V 2018
Betweenness centrality is a prominent centrality measure expressing importance of a node within a network, in terms of the fraction of shortest paths passing through that node. Nodes with high betweenness centrality have significant impacts on the spread of influence and idea in social networks, the user activity in mobile phone networks, the contagion process in biological networks, and the bottlenecks in communication networks. Thus, identifying k-highest betweenness centrality nodes in networks will be of great interest in many applications. In this paper, we introduce CS-HiBet, a new method to efficiently detect top-k betweenness centrality nodes in networks, using compressive sensing....
M.Sc. Thesis Sharif University of Technology ; Rabiei, Hamid Reza
Information Technology In the recent years, Peer-to-Peer Networking and Applications has received significant attention from both the Internet users and research area. One of the most successful Applications of P2P networks is streaming the video which is applicable in Internet TV. On the other hand, Complex networks describe a wide range of networked systems in technology, nature and society, such as Internet, WWW networks, P2P networks, biological networks and social interactions.In this thesis we focus on mesh-pull based streaming networks and our goal is to propose a complex network model for such a P2PIPTV topology. To reach to this aim we consider the microscopic processes on each node...
M.Sc. Thesis Sharif University of Technology ; Jalili, Mahdi
Recently complex networks, have been widely used as a model to study the behavior of human brain. By affecting different parts the brain, Neuronal disorders change the structure of functional brain networks. Investigating these changes using different graph theory metrics can be a useful methodology for human brain analysis in health and disease. Alzheimer's disease (AD) is a neural disease causing impairment in different brain activities including memory and cognition.The aim of this study is to construct the functional brain network of 17 AD patients and 17 healthy control subjects at resting state condition and analyzing them using the theory of complex networks in order to achieve a...
Article International Journal of Modern Physics C ; Volume 23, Issue 4 , April , 2012 ; 01291831 (ISSN) ; Sharif University of Technology
Many real-world networks show community structure characterized by dense intra-community connections and sparse inter-community links. In this paper we investigated the synchronization properties of such networks. In this work we constructed such networks in a way that they consist of a number of communities with scale-free or small-world structure. Furthermore, with a probability, the intra-community connections are rewired to inter-community links. Two synchronizability measures were considered as the eigenratio of the Laplacian matrix and the phase order parameter obtained for coupled nonidentical Kuramoto oscillators. We found a power-law relation between the eigenratio and the...
Article Physica A: Statistical Mechanics and its Applications ; Volume 390, Issue 23-24 , 2011 , Pages 4588-4595 ; 03784371 (ISSN) ; Sharif University of Technology
In this paper the robustness of network synchronizability against random deletion of nodes, i.e. errors, in dynamical scale-free networks was studied. To this end, two measures of network synchronizability, namely, the eigenratio of the Laplacian and the order parameter quantifying the degree of phase synchrony were adopted, and the synchronizability robustness on preferential attachment scale-free graphs was investigated. The findings revealed that as the network size decreases, the robustness of its synchronizability against random removal of nodes declines, i.e. the more the number of randomly removed nodes from the network, the worse its synchronizability. We also showed that this...
Article IEEE Transactions on Network Science and Engineering ; 2017 ; 23274697 (ISSN) ; Rabiee, H. R ; Zarrabi, H ; Khan, U ; Sharif University of Technology
Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each contraction measured. Therefore, nodes in a contraction are equivalent to recover for loss of observability, implying that contraction size is a key factor for observability recovery. Here, developing a polynomial order contraction detection algorithm, we analyze the distribution of contractions, studying its relation with key network properties. Our results show that contraction size is related to network clustering coefficient and degree heterogeneity....
Article IEEE Transactions on Network Science and Engineering ; Volume 5, Issue 3 , 2018 , Pages 212-224 ; 23274697 (ISSN) ; Rabiee, H. R ; Zarrabi, H ; Khan, U ; Sharif University of Technology
IEEE Computer Society 2018
Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each contraction measured. Therefore, nodes in a contraction are equivalent to recover for loss of observability, implying that contraction size is a key factor for observability recovery. Here, using a polynomial order contraction detection algorithm, we analyze the distribution of contractions, studying its relation with key network properties. Our results show that contraction size is related to network clustering coefficient and degree heterogeneity. Particularly, in...
Article 9th International Symposium on Telecommunication, IST 2018, 17 December 2018 through 19 December 2018 ; 2019 , Pages 221-226 ; 9781538682746 (ISBN) ; Majidi, B ; Movaghar, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2019
Improvement of energy efficiency in Software Defined Networking (SDN) is a challenging problem. In order to achieve higher energy efficiency, the routing and scheduling in software defined networks should be planned robustly based on the topological specifications of the SDN. The topological specifications of the SDN depends on the size of the network graph which changes rapidly as the virtualized network devices in the network turned on and off by the controller. Therefore, modelling the SDN graph is an important issue in designing a reliability aware energy efficient SDN. In this paper we propose a new algorithm for reliable energy efficient traffic engineering in SDN. In the proposed...
M.Sc. Thesis Sharif University of Technology ; Khansari, Mohammad
Complex networks have recently become a very noticeable subject because of their remarkable theory on real networks such as rumor spreading. This thesis contributes to a prevention strategy which uses a maximal clique algorithm to find overlapping communities and also uses inverse targeting immunization strategy to immune these communities. By the using maximal clique algorithm combined with inverse targeting strategy we have achieved that the TIK method (targeted immunization using k-clique percolation) obtains 10% of better immunization than HD (highest degree) method which is one of the best methods in targeted immunization strategies. The TIK also demonstrates that rumor spreading is...
M.Sc. Thesis Sharif University of Technology ; Ghorshi, Mohammad Ali
Nowadays financial and business jobs without new technologies and new methods to manage are not that much useful. Managers are searching for all new methods in different areas for improving their profit, quality of services or increasing number of their customers. Because of this, they would check some ways to prove their issues. But the point is that they should have a great view about their products, customers and generally their own shop. One of the perfect methods to present the form and relation between their favorite factors is complex network. With complex network they can have perfect sight about their system. Also, with some remarkable and noticeable ways they can categorize their...
M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid
Nowadays Systems in different fields of research like computer science, biology, social networks, information networks, and economics are modeled as graphs. The graphs which model real world systems have very different topological characteristics than those of classic networks. One of the prominent characteristics of these networks, is that its not practical to describe a general model for their structure and behavior. As a consequence of this complexity in modeling and structure, these networks are called complex networks. One of the most important observations in complex networks is the presence of communities, it means that in such networks one can separate vertices in disjoint sets, such...
M.Sc. Thesis Sharif University of Technology ; Akbari, Behzad ; Rabiee, Hamid Reza
Complex networks science have become the major method in the modeling of topological features of networks and graphs. Although file sharing Peer-to-Peer systems can be modeled by networks with un-weighted nodes and links, using these networks for Peer-to-Peer streaming systems have not led to a suitable model.In this research, we aim to model Peer-to-Peer streaming networks with weighted nodes and weighted links so that present the performance of nodes and the amount of streaming that is transmitted between nodes respectively. Due to lack of information about upload bandwidth distribution in networks we assume this distribution as uniform. Because of dynamics of network, this distribution...
M.Sc. Thesis Sharif University of Technology ; Golestani, Jamaloddin ; Ghodsi, Mohammad ; Nobakhti, Amin
In this thesis, the individuals’ decision process to achieve consensus in complex networks is modeled. A set of experiments with volunteered participants were run, in which the person is a node in a network with 35 other nodes who behave based on a prescribed model. Each participant is tested twice, once with and once without reward. Performance of individuals in the two experiment types and the effect of structural properties of the underlying network on the results are studied. It is observed that increase in the characteristic path length, diameter, clustering coefficient and local efficiency of the network adversely affects consensus.On the other hand, global efficiency and closeness...