Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Tomovski, Igor  (7)
Type of Medium
Language
Year
  • 1
    Language: English
    In: Physica A: Statistical Mechanics and its Applications, 15 October 2015, Vol.436, pp.272-285
    Description: We introduce a mathematical framework for identification of network topology, based on data collected from infectious SIS process occurring on a network. An exact expression for the weight of each network link (existing or not) as a function of infectious statistics, is obtained. An algorithm for proper implementation of the analyzed concept is suggested and the validity of the obtained result is confirmed by numerical simulations performed on a number of synthetic (computer generated) networks.
    Keywords: Network Topology ; Sis Process ; Physics
    ISSN: 0378-4371
    E-ISSN: 1873-2119
    Source: ScienceDirect Journals (Elsevier)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Communications in Nonlinear Science and Numerical Simulation, March 2014, Vol.19(3), pp.627-637
    Description: A Susceptible-Infected-Susceptible (SIS) spreading process, occurring on complex networks that are characterized by a special form of contact dynamics called “acquisition exclusivity”, is studied. Assuming statistical independence of joint events, we find analytic solutions for the stationary probabilities that network nodes are infected, and more importantly, find that these solutions are independent of the network topology. We explore the possibilities to use the studied set-up as an engineering solution for controlled spreading on technological networks. In that context, an example for controlled sharing of viral countermeasures in networks is presented. Considering the high epidemic threshold that characterizes the process, “acquisition exclusivity” is suggested as a method for eradication of viral infections from networks.
    Keywords: Networks ; Stochastic Spreading ; Sis ; Threshold Values ; Infection Eradication ; Applied Sciences
    ISSN: 1007-5704
    E-ISSN: 1878-7274
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    In: IEEE Transactions on Circuits and Systems I: Regular Papers, 04/2012, Vol.59(4), pp.763-771
    Description: A simple topology-manipulative algorithm for control of virus spreading trough complex networks is suggested. The algorithm is studied and applied on an SIS model type of an infection, and the system is described with a set of nonlinear difference probabilistic equations, that represent the dynamics of infection probabilities of nodes and existence probabilities of links in the graph. The validity of the control mechanism is first proven theoretically. Then, simulations are performed and results from both the realistic (status dependent) and probabilistic (analyzed) systems are compared, proving numerically as well, that the suggested algorithm is valid tool for infection eradication from complex networks. Several strategies of control implementation were tested and efficiency of each evaluated on the probabilistic system.
    Keywords: Components, Circuits, Devices and Systems;
    ISSN: 1549-8328
    E-ISSN: 1558-0806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: Physica A: Statistical Mechanics and its Applications, Oct 15, 2015, Vol.436, p.272(14)
    Description: To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.physa.2015.03.090 Byline: Igor Tomovski, Ljupco Kocarev Abstract: We introduce a mathematical framework for identification of network topology, based on data collected from infectious SIS process occurring on a network. An exact expression for the weight of each network link (existing or not) as a function of infectious statistics, is obtained. An algorithm for proper implementation of the analyzed concept is suggested and the validity of the obtained result is confirmed by numerical simulations performed on a number of synthetic (computer generated) networks. Article History: Received 29 May 2014; Revised 18 February 2015
    Keywords: Network Architectures – Health Aspects ; Network Architectures – Statistics
    ISSN: 0378-4371
    Source: Cengage Learning, Inc.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Description: A susceptible-infected-susceptible (SIS) model of multiple contagions on multilayer networks is developed to incorporate different spreading channels and disease mutations. The basic reproduction number for this model is estimated analytically. In a special case when considering only compartmental models, we analytically analyze an example of a model with a mutation driven strain persistence characterized by the absence of an epidemic threshold. This model is not related to the network topology and can be observed in both compartmental models and models on networks. The novel multiple-contagion SIS model on a multilayer network could help in the understanding of other spreading phenomena including communicable diseases, cultural characteristics, addictions, or information spread through e-mail messages, web blogs, and computer networks.
    Keywords: Physics - Physics And Society
    Source: Cornell University
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Language: English
    In: IEEE Transactions on Circuits and Systems-I-Regular Papers, June, 2006, Vol.53(6), p.1300(10)
    Description: We propose a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice. For discrete-time dynamical systems, it measures the local (between neighboring points) average spreading of the system. We justify our definition by proving that, for large classes of chaotic maps, the corresponding discrete Lyapunov exponent approaches the largest Lyapunov exponent of a chaotic map when M [right arrow] [infinity], where M is the cardinality of the discrete phase space. In analogy with continuous systems, we say the system has discrete chaos if its discrete Lyapunov exponent tends to a positive number, when M [right arrow] [infinity]. We present several examples to illustrate the concepts being introduced. Index Terms--Chaos, discrete chaos, Lyapunov components.
    Keywords: Chaos Theory -- Analysis ; Liapunov Functions -- Usage ; Discrete Time Systems -- Usage
    ISSN: 1549-8328
    E-ISSN: 15580806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Language: English
    In: Communications in Nonlinear Science and Numerical Simulation, April 2010, Vol.15(4), pp.1008-1018
    Description: In this paper we propose an alternative way to study robustness and vulnerability of complex networks, applying a modal analysis. The modal weights of the network nodes are considered as a measure for their busyness, which is further used for preferential removal of nodes and attack simulation. Analyses of the attack vulnerability are carried out for several generic graphs, generated according to ER and BA algorithms, as well as for some examples of manmade networks. It was found that a modal weight based attack causes significant disintegration of manmade networks by removing a small fraction of the busiest nodes, comparable to the one based on the node degree and betweenness centrality.
    Keywords: Vulnerability ; Modal Analysis ; Modal Weight ; Generic Networks ; Manmade Networks ; Applied Sciences
    ISSN: 1007-5704
    E-ISSN: 1878-7274
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages