Results 11 to 20 of about 211,012 (212)
The Generalized Distance Spectrum of the Join of Graphs [PDF]
, 2020 Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D(G) and diagonal matrix of the vertex transmissions Tr(G) .
Alhevaz, Abdollah +3 more
core +2 more sources
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +1 more source
Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks [PDF]
, 2019 We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the natural ...
Shneer, Seva, Stolyar, Alexander
core +2 more sources
Rotation-based schedules in elementary schools to prevent COVID-19 spread: a simulation study
Scientific Reports, 2023 Rotations of schoolchildren were considered as a non-pharmacological intervention in the COVID-19 pandemic. This study investigates the impact of different rotation and testing schedules.We built an agent-based model of interactions among pupils and ...
Cyril Brom +10 more
doaj +1 more source
An analysis of the lifetime of OLSR networks [PDF]
, 2009 The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the network using multipoint relays (MPRs).
Graaf, Maurits de +2 more
core +4 more sources
On the Largest Distance (Signless Laplacian) Eigenvalue of Non-transmission-regular Graphs
The Electronic Journal of Linear Algebra, 2018 Let $G=(V(G),E(G))$ be a $k$-connected graph with $n$ vertices and $m$ edges. Let $D(G)$ be the distance matrix of $G$. Suppose $\lambda_1(D)\geq \cdots \geq \lambda_n(D)$ are the $D$-eigenvalues of $G$. The transmission of $v_i \in V(G)$, denoted by $Tr_G(v_i)$ is defined to be the sum of distances from $v_i$ to all other vertices of $G$, i.e., the ...
Liu, Shuting, Shu, Jinlong, Xue, Jie
openaire +2 more sources
Containing epidemic outbreaks by message-passing techniques [PDF]
, 2013 The problem of targeted network immunization can be defined as the one of finding a subset of nodes in a network to immunize or vaccinate in order to minimize a tradeoff between the cost of vaccination and the final (stationary) expected infection under ...
Altarelli, F. +4 more
core +3 more sources
Modeling epidemics on a regular tree graph
Letters in Biomathematics, 2016 We will first provide a brief introduction to models of disease transmission on so-called contact networks, which can be represented by various structures from the mathematical field of graph theory.
Claire Seibold, Hannah L. Callender
doaj +1 more source
TURTLE-P: a UML profile for the formal validation of critical and distributed systems [PDF]
, 2006 The timed UML and RT-LOTOS environment, or TURTLE for short, extends UML class and activity diagrams with composition and temporal operators. TURTLE is a real-time UML profile with a formal semantics expressed in RT-LOTOS.
Apvrille, Ludovic +2 more
core +1 more source
Spatially-Coupled Random Access on Graphs [PDF]
, 2012 In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference cancelation process of ...
Chiani, Marco +4 more
core +1 more source