scholarly journals Hierarchical effects facilitate spreading processes on synthetic and empirical multilayer networks

PLoS ONE ◽  
2021 ◽  
Vol 16 (6) ◽  
pp. e0252266
Author(s):  
Casey Doyle ◽  
Thushara Gunda ◽  
Asmeret Naugle
Keyword(s):  
Time Horizon ◽  
Geometric Graphs ◽  
Multilayer Networks ◽  
Random Geometric Graphs ◽  
Corporate Networks ◽  
Long Time ◽  
Influential Nodes ◽  
Relationship Network ◽  
Selection Of ◽  
Spreading Processes

In this paper we consider the effects of corporate hierarchies on innovation spread across multilayer networks, modeled by an elaborated SIR framework. We show that the addition of management layers can significantly improve spreading processes on both random geometric graphs and empirical corporate networks. Additionally, we show that utilizing a more centralized working relationship network rather than a strict administrative network further increases overall innovation reach. In fact, this more centralized structure in conjunction with management layers is essential to both reaching a plurality of nodes and creating a stable adopted community in the long time horizon. Further, we show that the selection of seed nodes affects the final stability of the adopted community, and while the most influential nodes often produce the highest peak adoption, this is not always the case. In some circumstances, seeding nodes near but not in the highest positions in the graph produces larger peak adoption and more stable long-time adoption.

Infection Spread in Random Geometric Graphs

2015 ◽  
Vol 47 (1) ◽  
pp. 164-181 ◽  
Author(s):  
Ghurumuruhan Ganesan
Keyword(s):  
Lower Bound ◽  
High Probability ◽  
Contact Process ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Long Time ◽  
Explicit Lower Bound ◽  
Infection Spread

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G(n, rn, f) of n nodes independently distributed in S = [-½, ½]2 according to a certain density f(·). In the first part of the paper we assume that infection spreads from one node to another at unit rate and that infected nodes stay in the same state forever. We provide an explicit lower bound on the speed of infection spread and prove that infection spreads in G with speed at least D1nrn2. In the second part of the paper we consider the contact process ξt on G where infection spreads at rate λ > 0 from one node to another and each node independently recovers at unit rate. We prove that, for every λ > 0, with high probability, the contact process on G survives for an exponentially long time; there exist positive constants c1 and c2 such that, with probability at least 1 - c1 / n4, the contact process starting with all nodes infected survives up to time tn = exp(c2n/logn) for all n.

Infection Spread in Random Geometric Graphs

2015 ◽  
Vol 47 (01) ◽  
pp. 164-181 ◽  
Author(s):  
Ghurumuruhan Ganesan
Keyword(s):  
Lower Bound ◽  
High Probability ◽  
Contact Process ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Long Time ◽  
Explicit Lower Bound ◽  
Infection Spread

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G(n, r n , f) of n nodes independently distributed in S = [-½, ½]2 according to a certain density f(·). In the first part of the paper we assume that infection spreads from one node to another at unit rate and that infected nodes stay in the same state forever. We provide an explicit lower bound on the speed of infection spread and prove that infection spreads in G with speed at least D 1 nr n 2. In the second part of the paper we consider the contact process ξ t on G where infection spreads at rate λ > 0 from one node to another and each node independently recovers at unit rate. We prove that, for every λ > 0, with high probability, the contact process on G survives for an exponentially long time; there exist positive constants c 1 and c 2 such that, with probability at least 1 - c 1 / n 4, the contact process starting with all nodes infected survives up to time t n = exp(c 2 n/logn) for all n.

SISTEM PENDUKUNG KEPUTUSAN PEMILIHAN KEPALA CABANG TERBAIK BANK SUMUT DENGAN MENERAPKAN METODE VIKOR

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Betrik J Hutapea ◽  
Mesran Mesran ◽  
Siti Nurhabibah
Keyword(s):  
Decision Support ◽  
Decision Support System ◽  
Support System ◽  
Development Bank ◽  
Vikor Method ◽  
The North ◽  
Long Time ◽  
North Sumatra ◽  
Regional Development Bank ◽  
Selection Of

SUMUT Bank is one of the Banks in Indonesia with the name of the company PT. Regional Development Bank of North Sumatra. The North Sumatra Bank has branches in each region in North Sumatra both in the district and in the sub-district, and each of these branches is led by a branch leader or branch head. The head of this branch is responsible for the reversal of the Bank being led. The best and most accomplished branch heads deserve more and more awards. The selection of the best branch heads is selected transparently and structured in the hope that it can be a motivation for all branch heads to be able to further improve the quality and service of the Bank they lead. Making the best branch head selection done manually will take a long time and tends to be less transparent and structured. One solution so that the implementation of the selection can be carried out easily and quickly, it requires a Decision Support System that can provide consistency of assessment. In this study the method used is the VIKOR method (Visekriterijumsko Kompromisno Rangiranje). This method makes cracking on alternatives based on criteria that have been determined with an ideal compromise solution or the best solution, so that this system can later be beneficial for the SUMUT Bank to get the title in determining the best branch head.Keywords: Decision Support System, North Sumatra Bank, Branch Head, Vikor

scholarly journals Normalized Sombor Indices as Complexity Measures of Random Networks

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 976
Author(s):  
R. Aguilar-Sánchez ◽  
J. Méndez-Bermúdez ◽  
José Rodríguez ◽  
José Sigarreta
Keyword(s):  
Random Matrix ◽  
Adjacency Matrix ◽  
Matrix Theory ◽  
Computational Study ◽  
Random Networks ◽  
Geometric Graphs ◽  
Theory Approach ◽  
Complexity Measures ◽  
Random Geometric Graphs ◽  
Highly Correlated

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.

scholarly journals Internet page content analysis of north European Sea ports

2020 ◽  
Vol 5 (1) ◽  
Author(s):  
Olli-Pekka Hilmola ◽  
Andres Tolli ◽  
Ain Kiisler
Keyword(s):  
Content Analysis ◽  
Environmental Issues ◽  
Basic Design ◽  
Time Period ◽  
Long Time ◽  
Sea Ports ◽  
Selection Of

Abstract This study analyses 98 Internet pages of sea ports located in Sweden, Finland and Estonia during years 2017–2019. Aim of the study is to find, how website basic design is completed (colours and languages), how slogans, environmental issues, statistics and hinterland transports are reported. Based on the analysis, it appears as rather common that sea ports follow conservative selection of colours in their websites, where blue and white are clearly most popular. Typically, English and Swedish are as the most common used language, followed by Finnish, Russian and Estonian. In some rare cases, websites are offered in Chinese or German. Larger sea ports do have clear “slogans”, where smaller ones are just having lengthy justification for their existence. Environmental issues are increasing concern among sea ports, and these are mostly mentioned in details within Swedish actors. Providing statistics varies among companies, and in some sea ports these are provided from very long time period, where in others from just previous years or then only from last year (or even at all). It is common for companies to report that they have sustainable hinterland access, railway available.

CIM: clique-based heuristic for finding influential nodes in multilayer networks

2021 ◽  
Author(s):  
Venkatakrishna Rao. K ◽  
Mahender Katukuri ◽  
Maheswari Jagarapu
Keyword(s):  
Multilayer Networks ◽  
Influential Nodes

scholarly journals Connectivity in one-dimensional soft random geometric graphs

2020 ◽  
Vol 102 (6) ◽  
Author(s):  
Michael Wilsher ◽  
Carl P. Dettmann ◽  
Ayalvadi Ganesh
Keyword(s):  
Geometric Graphs ◽  
Random Geometric Graphs ◽  
One Dimensional

Suitability of Natural Geomedia for Radwaste Storage

1982 ◽  
Vol 15 ◽  
Author(s):  
W. S. Fyfe
Keyword(s):  
Rock Properties ◽  
Fracture Flow ◽  
Time Prediction ◽  
Sedimentary Sequences ◽  
Rock Types ◽  
Direct Observations ◽  
Long Time ◽  
Mining Disturbance ◽  
Selection Of

ABSTRACTSelection of the best rock types for radwaste disposal will depend on their having minimal permeability, maximal flow dispersion, minimal chance of forming new wide aperture fractures, maximal ion retention, and minimal thermal and mining disturbance. While no rock is perfect, thinly bedded complex sedimentary sequences may have good properties, either as repository rocks, or as cover to a repository.Long time prediction of such favorable properties of a rock at a given site may be best modelled from studies of in situ rock properties. Fracture flow, dispersion history, and geological stability can be derived from direct observations of rocks themselves, and can provide the parameters needed for convincing demonstration of repository security for appropriate times.

scholarly journals Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs

2000 ◽  
Vol 9 (6) ◽  
pp. 489-511 ◽  
Author(s):  
JOSEP DÍAZ ◽  
MATHEW D. PENROSE ◽  
JORDI PETIT ◽  
MARÍA SERNA
Keyword(s):  
Constant Factor ◽  
Geometric Graphs ◽  
Convergence Theorems ◽  
Linear Arrangement ◽  
Random Lattice ◽  
Random Geometric Graphs ◽  
Unit Square ◽  
Subcritical Regime ◽  
Probabilistic Setting ◽  
Lattice Graphs

This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give optimal layouts for the problems still open. For arbitrary lattice graphs, we present best possible bounds disregarding a constant factor. We apply percolation theory to the study of lattice graphs in a probabilistic setting. In particular, we deal with the subcritical regime that this class of graphs exhibits and characterize the behaviour of several layout measures in this space of probability. We extend the results on random lattice graphs to random geometric graphs, which are graphs whose nodes are spread at random in the unit square and whose edges connect pairs of points which are within a given distance. We also characterize the behaviour of several layout measures on random geometric graphs in their subcritical regime. Our main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.

scholarly journals Symmetric motifs in random geometric graphs

2017 ◽  
Vol 6 (1) ◽  
pp. 95-105 ◽  
Author(s):  
Carl P Dettmann ◽  
Georgie Knight
Keyword(s):  
Geometric Graphs ◽  
Random Geometric Graphs
Sign in / Sign up

Export Citation Format

Share Document