Results 31 to 40 of about 39,180 (271)
Time-Based Moving Target Defense Using Bayesian Attack Graph Analysis
IEEE Access, 2023 The moving target defense (MTD) is a proactive cybersecurity defense technique that constantly changes potentially vulnerable points to be attacked, to confuse the attackers, making it difficult for attackers to infer the system configuration and nullify
Hyejin Kim +6 more
doaj +1 more source
Mixing times for random walks on dynamic configuration models [PDF]
, 2018 The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on n n vertices, is known to be of order logn logn .
Güldas, H. +3 more
core +5 more sources
Random walks on dynamic configuration models:a trichotomy [PDF]
, 2019 \u3cp\u3eWe consider a dynamic random graph on n vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction α
Hofstad, RW Remco van der +3 more
core +3 more sources
ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj +1 more source
Dynamic random intersection graph: Dynamic local convergence and giant structure. [PDF]
, 2023 Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when they share at ...
Milewska, M. (Marta) +2 more
core +1 more source
Opinion Forming in Erdös-Rényi Random Graph and Expanders [PDF]
, 2018 Assume for a graph G=(V,E) and an initial configuration, where each node is blue or red, in each discrete-time round all nodes simultaneously update their color to the most frequent color in their neighborhood and a node keeps its color in case of a tie.
Zehmakan, Ahad N., N. Zehmakan, Ahad
core +1 more source
Applied Network Science, 2021 Understanding actor collaboration networks and their evolution is essential to promoting collective action in resilience planning and management of interdependent infrastructure systems.
Qingchun Li, Ali Mostafavi
doaj +1 more source
Towards Proximity Graph Auto-configuration: An Approach Based on Meta-learning [PDF]
, 2020 Due to the high production of complex data, the last decades have provided a huge advance in the development of similarity search methods. Recently graph-based methods have outperformed other ones in the literature of approximate similarity search ...
Barbon Junior S. +6 more
core +5 more sources
COMBINE MARKOV RANDOM FIELDS AND MARKED POINT PROCESSES TO EXTRACT BUILDING FROM REMOTELY SENSED IMAGES [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Automatic building extraction from remotely sensed images is a research topic much more significant than ever. One of the key issues is object and image representation.
D. Chai, W. Förstner, M. Ying Yang
doaj +1 more source
Generalised hypergeometric ensembles of random graphs: the configuration model as an urn problem
CoRR, 2018 18 pages, 2 ...
Giona Casiraghi, Vahan Nanumyan
openaire +2 more sources