Results 11 to 20 of about 39,180 (271)
Dynamic Random Graph Protection Scheme Based on Chaos and Cryptographic Random Mapping [PDF]
Information, 2022 Advances in network technology have enhanced the concern for network security issues. In order to address the problem that hopping graph are vulnerable to external attacks (e.g., the changing rules of fixed graphs are more easily grasped by attackers ...
Zhu Fang, Zhengquan Xu
doaj +2 more sources
Critical Percolation on Scale-Free Random Graphs: New Universality Class for the Configuration Model [PDF]
Communications in Mathematical Physics, 2021 43 pages, Proof of continuity of the largest excursion is ...
Souvik Dhara +2 more
openaire +6 more sources
On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model [PDF]
CoRRLocal convergence has emerged as a fundamental tool for analyzing sparse random graph models. We introduce a new notion of local convergence, color convergence, based on the Weisfeiler-Leman algorithm. Color convergence fully characterizes the class of random graphs that are well-behaved in the limit for message-passing graph neural networks.
Alexander Pluska, Sagar Malhotra
openaire +3 more sources
A Model for Random Braiding in Graph Configuration Spaces [PDF]
International Mathematics Research Notices, 2021 AbstractWe define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles in the plane [ 42].
Levin, David A. +2 more
openaire +3 more sources
Microservice Moving Target Defense Strategy Based on Adaptive Genetic Algorithm [PDF]
Jisuanji kexue, 2023 Microservice architecture can effectively improve the agility of software due to its flexible,scalable and other characte-ristics,and has become the most mainstream method of application delivery in the cloud.However,the microservice splitting makes the ...
LIU Xuanyu, ZHANG Shuai, HUO Shumin, SHANG Ke
doaj +1 more source
Metastable configurations of spin models on random graphs [PDF]
Physical Review E, 2001 One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function with two arguments. The analytical results are compared with numerical simulations.
Berg J, SELLITTO, Mauro
openaire +4 more sources
Random graphs with given vertex degrees and switchings [PDF]
, 2020 Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph.
Janson, Svante,, Svante Janson
core +1 more source
Asymptotic normality in random graphs with given vertex degrees [PDF]
, 2020 We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model and then, by a
Janson, Svante,, Svante Janson
core +1 more source
Configuration models as an urn problem
Scientific Reports, 2021 A fundamental issue of network data science is the ability to discern observed features that can be expected at random from those beyond such expectations. Configuration models play a crucial role there, allowing us to compare observations against degree-
Giona Casiraghi, Vahan Nanumyan
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2014 We study an extension of the chip-firing game. A given set of admissible moves, called Yamanouchi moves, allows the player to pass from a starting configuration $\alpha$ to a further configuration $\beta$.
Robert Cori +2 more
doaj +1 more source