Searched for: author:"Trajanovski, S."
(1 - 18 of 18)
document
Trajanovski, S. (author), Kuipers, F.A. (author), Hayel, Yezekael (author), Altman, Eitan (author), Van Mieghem, P.F.A. (author)
Designing an optimal network topology while balancing multiple, possibly conflicting objectives like cost, performance, and resiliency to viruses is a challenging endeavor, let alone in the case of decentralized network formation. We therefore propose a game-formation technique where each player aims to minimize its cost in installing links,...
journal article 2018
document
Yang, S. (author), Trajanovski, S. (author), Kuipers, F.A. (author)
Background Solving the shortest path and min-cut problems are key in achieving high-performance and robust communication networks. Those problems have often been studied in deterministic and uncorrelated networks both in their original formulations as well as in several constrained variants. However, in real-world networks, link weights (e.g.,...
journal article 2016
document
Trajanovski, S. (author), Kuipers, F.A. (author), Hayel, Y. (author), Altman, E. (author), Van Mieghem, P. (author)
Forming, in a decentralized fashion, an optimal network topology while balancing multiple, possibly conflicting objectives like cost, high performance, security and resiliency to viruses is a challenging endeavor. In this paper, we take a game-formation approach to network design where each player, for instance an autonomous system in the...
conference paper 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
Trajanovski, S. (author)
Community structure is observed in many real-world networks, such as (online) social networks, where groups of friends of a certain person are often also friends of each other. Newman's modularity has been explored as an important quantitative metric for communities and clusters detection in networks. We present a new expressions and bounds for...
doctoral thesis 2014
document
Polevoy, G. (author), Trajanovski, S. (author), De Weerdt, M.M. (author)
Shared effort games model people's contribution to projects and sharing the obtained profits. Those games generalize both public projects like writing for Wikipedia, where everybody shares the resulting benefits, and all-pay auctions such as contests and political campaigns, where only the winner obtains a profit. In ?-equal sharing (effort)...
conference paper 2014
document
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...
journal article 2014
document
Trajanovski, S. (author), Kuipers, F.A. (author), Ili?, A. (author), Crowcroft, J. (author), Van Mieghem, P. (author)
Due to their importance to society, communication networks should be built and operated to withstand failures.However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their...
journal article 2014
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
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
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
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
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)
For a fixed number N of nodes, the number of links L in the line graph H(N,L) can only appear in consecutive intervals, called a band of L. We prove that some consecutive integers can never represent the number of links L in H(N,L), and they are called a bandgap of L. We give the exact expressions of bands and bandgaps of L. We propose a model...
journal article 2013
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
document
Trajanovski, S. (author), Scellato, S. (author), Leontiadis, I. (author)
The study of real-world communication systems via complex network models has greatly expanded our understanding on how information flows, even in completely decentralized architectures such as mobile wireless networks. Nonetheless, static network models cannot capture the time-varying aspects and, therefore, various temporal metrics have been...
journal article 2012
document
Van Mieghem, P.F.A. (author), Ge, X. (author), Schumm, P. (author), Trajanovski, S. (author), Wang, H. (author)
Expressions and bounds for Newman’s modularity are presented. These results reveal conditions for or properties of the maximum modularity of a network. The influence of the spectrum of the modularity matrix on the maximum modularity is discussed. The second part of the paper investigates how the maximum modularity, the number of clusters, and...
journal article 2010
document
Trajanovski, S. (author), Van Mieghem, P. (author)
We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph PN and the 2-dimensional...
conference paper 2010
Searched for: author:"Trajanovski, S."
(1 - 18 of 18)