Searched for: department%3A%22Intelligent%255C%252BSystems%22
(1 - 20 of 20)
document
Sahneh, F.D. (author), Scoglio, C. (author), Van Mieghem, P. (author)
An interconnected network features a structural transition between two regimes [F. Radicchi and A. Arenas, Nat. Phys. 9, 717 (2013)]: one where the network components are structurally distinguishable and one where the interconnected network functions as a whole. Our exact solution for the coupling threshold uncovers network topologies with...
journal article 2015
document
Trajanovski, S. (author), Guo, D. (author), Van Mieghem, P.F.A. (author)
The continuous-time adaptive susceptible-infected-susceptible (ASIS) epidemic model and the adaptive information diffusion (AID) model are two adaptive spreading processes on networks, in which a link in the network changes depending on the infectious state of its end nodes, but in opposite ways: (i) In the ASIS model a link is removed between...
journal article 2015
document
Van de Bovenkamp, R. (author), Van Mieghem, P. (author)
The survival time T is the longest time that a virus, a meme, or a failure can propagate in a network. Using the hitting time of the absorbing state in an uniformized embedded Markov chain of the continuous-time susceptible-infected-susceptible (SIS) Markov process, we derive an exact expression for the average survival time E[T ] of a virus in...
journal article 2015
document
Van Mieghem, P.F.A. (author), Van de Bovenkamp, R. (author)
Mean-field approximations (MFAs) are frequently used in physics. When a process (such as an epidemic or a synchronization) on a network is approximated by MFA, a major hurdle is the determination of those graphs for which MFA is reasonably accurate. Here, we present an accuracy criterion for Markovian susceptible-infected-susceptible (SIS)...
journal article 2015
document
Li, C. (author), Li, Q. (author), Van Mieghem, P.F.A. (author), Stanley, H.E. (author), Wang, H. (author)
In recent decades, a number of centrality metrics describing network properties of nodes have been proposed to rank the importance of nodes. In order to understand the correlations between centrality metrics and to approximate a high-complexity centrality metric by a strongly correlated low-complexity metric, we first study the correlation...
journal article 2015
document
Bonaccorsi, S. (author), Ottaviano, S. (author), De Pellegrini, F. (author), Socievole, A. (author), Van Mieghem, P.F.A. (author)
We consider a model for the diffusion of epidemics in a population that is partitioned into local communities. In particular, assuming a mean-field approximation, we analyze a continuous-time susceptible-infected-susceptible (SIS) model that has appeared recently in the literature. The probability by which an individual infects individuals in...
journal article 2014
document
Li, C. (author), Wang, H. (author), Van Mieghem, P.F.A. (author)
Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the online social network Twitter and the world wide web, on which information, emotion, or malware spreads, are directed networks, composed of both unidirectional links and bidirectional links. We define the directionality ? as the...
journal article 2013
document
Guo, D. (author), Trajanovski, S. (author), Van de Bovenkamp, R. (author), Wang, H. (author), Van Mieghem, P.F.A. (author)
The interplay between disease dynamics on a network and the dynamics of the structure of that network characterizes many real-world systems of contacts. A continuous-time adaptive susceptible-infectious-susceptible (ASIS) model is introduced in order to investigate this interaction, where a susceptible node avoids infections by breaking its...
journal article 2013
document
Wang, H. (author), Li, Q. (author), D'Agostino, G. (author), Havlin, S. (author), Stanley, H.E. (author), Van Mieghem, P. (author)
Most real-world networks are not isolated. In order to function fully, they are interconnected with other networks, and this interconnection influences their dynamic processes. For example, when the spread of a disease involves two species, the dynamics of the spread within each species (the contact network) differs from that of the spread...
journal article 2013
document
Cator, E. (author), Van de Bovenkamp, R. (author), Van Mieghem, P.F.A. (author)
The classical, continuous-time susceptible-infected-susceptible (SIS) Markov epidemic model on an arbitrary network is extended to incorporate infection and curing or recovery times each characterized by a general distribution (rather than an exponential distribution as in Markov processes). This extension, called the generalized SIS (GSIS)...
journal article 2013
document
Trajanovski, S. (author), Kuipers, F. A. (author), Van Mieghem, P. (author), Ili?, A. (author), Crowcroft, J. (author)
Due to the importance of communication networks to society, it is pertinent that these networks can withstand failures. Improving the robustness of a network usually requires installing redundant resources, which is very costly. Network providers are consequently less inclined to take robustness measures against failures that are unlikely to...
conference paper 2013
document
Doerr, C. (author), Blenn, N. (author), Van Mieghem, P. (author)
The infection times of individuals in online information spread such as the inter-arrival time of Twitter messages or the propagation time of news stories on a social media site can be explained through a convolution of lognormally distributed observation and reaction times of the individual participants. Experimental measurements support the...
journal article 2013
document
Trajanovski, S. (author), Kuipers, F. A. (author), Van Mieghem, P. (author)
It is important that our vital networks (e.g., infrastructures) are robust to more than single-link failures. Failures might for instance affect a part of the network that resides in a certain geographical region. In this paper, considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region - that is,...
conference paper 2013
document
Trajanovski, S. (author), Martín-Hernández, J. (author), Winterbach, W. (author), Van Mieghem, P. (author)
We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case behavior, giving no idea of how badly network...
journal article 2013
document
Van Mieghem, P.F.A. (author), Van de Bovenkamp, R. (author)
Most studies on susceptible-infected-susceptible epidemics in networks implicitly assume Markovian behavior: the time to infect a direct neighbor is exponentially distributed. Much effort so far has been devoted to characterize and precisely compute the epidemic threshold in susceptible-infected-susceptible Markovian epidemics on networks. Here,...
journal article 2013
document
Trajanovski, S. (author), Kuipers, F.A. (author), Martín-Hernández, J. (author), Van Mieghem, P. (author)
Modularity is a quantitative measure for characterizing the existence of a community structure in a network. A network's modularity depends on the chosen partitioning of the network into communities, which makes finding the specific partition that leads to the maximum modularity a hard problem. In this paper, we prove that deciding whether a...
journal article 2013
document
Trajanovski, S. (author), Kuipers, F.A. (author), Martin Hernandez, J. (author), Van Mieghem, P.F.A. (author)
journal article 2013
document
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)
ur society contains all types of organizations, such as companies, research groups and hobby clubs. Affliation networks, as a large and important portion of social networks, consist of individuals and their affiation relations: Two individuals are connected by a link if they belong to the same organization(s). Affliation networks naturally...
journal article 2012
document
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)
Social networks, as well as many other real-world networks, exhibit overlapping community structure. In this paper, we present formulas which facilitate the computation for characterizing the overlapping community structure of networks. A hypergraph representation of networks with overlapping community structure is introduced. Using the...
journal article 2012
document
Trajanovski, S. (author), Wang, H. (author), Van Mieghem, P. (author)
Modularity has been explored as an important quantitative metric for community and cluster detection in networks. Finding the maximum modularity of a given graph has been proven to be NPcomplete and therefore, several heuristic algorithms have been proposed. We investigate the problem of finding the maximum modularity of classes of graphs that...
journal article 2012
Searched for: department%3A%22Intelligent%255C%252BSystems%22
(1 - 20 of 20)