Filters








348,439 Hits in 5.3 sec

Approximating Betweenness Centrality in Fully-dynamic Networks [article]

Elisabetta Bergamini, Henning Meyerhenke
2015 arXiv   pre-print
In this paper we propose the first betweenness centrality approximation algorithms with a provable guarantee on the maximum approximation error for dynamic networks.  ...  Using approximation, our algorithms are the first to make in-memory computation of betweenness in dynamic networks with millions of edges feasible.  ...  Nevertheless, DA is significantly faster than recomputation on all networks and for every tested batch size. Analogous results are reported in Figure 8 (left) for random dynamics.  ... 
arXiv:1510.07971v1 fatcat:hwohlqkl75htvm2kzsq4fa4wce

Approximating Betweenness Centrality in Fully Dynamic Networks

Elisabetta Bergamini, Henning Meyerhenke
2016 Internet Mathematics  
In this article, we propose the first betweenness centrality approximation algorithms with a provable guarantee on the maximum approximation error for dynamic networks.  ...  Using approximation, our algorithms are the first to make in-memory computation of betweenness in dynamic networks with millions of edges feasible.  ...  ACKNOWLEDGMENTS We thank Moritz von Looz for providing the synthetic dynamic networks and the numerous contributors to the NetworKit project.  ... 
doi:10.1080/15427951.2016.1177802 fatcat:gr6zvp4bkbd25jbl2spg4tyzaq

Binary dynamics on star networks under external perturbations

Carolina A. Moreira, David M. Schneider, Marcus A. M. de Aguiar
2015 Physical Review E  
We obtain approximate analytical solutions that hold near the transition and that clarify the role of the central node in the process.  ...  For star networks, on the other hand, the equilibrium distribution ρ(m) splits in two peaks, reflecting the two possible states of the central node.  ...  (a) Fully connected network; (b) star network. online) Comparison between numerical simulations (thick lines) and the approximate equilibrium distribution Eq. (18) (thin lines).  ... 
doi:10.1103/physreve.92.042812 pmid:26565294 fatcat:y27dnhmiwbcflnhptkrezok4tm

Recent Advances in Fully Dynamic Graph Algorithms [article]

Kathrin Hanauer, Monika Henzinger, Christian Schulz
2021 arXiv   pre-print
In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms.  ...  Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.  ...  Centralities We will describe three popular measures to find central nodes in networks in the fully dynamic setting: Katz centrality, betweenness centrality and closeness centrality.  ... 
arXiv:2102.11169v5 fatcat:tcs3lkgcg5f7jax672adyzrstm

Centrality Measures: A Tool to Identify Key Actors in Social Networks [article]

Rishi Ranjan Singh
2020 arXiv   pre-print
These measures rank nodes/edges in networks by quantifying a notion of the importance of nodes/edges. Ranking aids in identifying important and crucial actors in networks.  ...  In this chapter, we summarize some of the centrality measures that are extensively applied for mining social network data. We also discuss various directions of research related to these measures.  ...  [43] proposed algorithms for updating approximated betweenness centrality scores in dynamic networks. Zhang et al.  ... 
arXiv:2011.01627v1 fatcat:hsocyivf5jgstkled67osd6w6q

Generalized mean field approximation for parallel dynamics of the Ising model

Hamed Mahmoudi, David Saad
2014 Journal of Statistical Mechanics: Theory and Experiment  
The proposed method shows significant improvement in predicting local system properties compared to other mean field approximation techniques, particularly in systems with symmetric interactions.  ...  The dynamics of non-equilibrium Ising model with parallel updates is investigated using a generalized mean field approximation that incorporates multiple two-site correlations at any two time steps, which  ...  A central macroscopic quantity in studying the dynamics of spin glasses is the spin correlation function that describes the correlation between microscopic states at two time steps.  ... 
doi:10.1088/1742-5468/2014/07/p07001 fatcat:7m3ztygdv5czjgmjbn42tin36a

Fully-dynamic Approximation of Betweenness Centrality [article]

Elisabetta Bergamini, Henning Meyerhenke
2015 arXiv   pre-print
Using approximation, our algorithms are the first to make in-memory computation of betweenness in fully-dynamic networks with millions of edges feasible.  ...  Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths.  ...  We thank Moritz von Looz for providing the synthetic dynamic networks and the numerous contributors to the NetworKit project.  ... 
arXiv:1504.07091v2 fatcat:zhe7ockhavbn7kywum725wzf2y

Revisiting time discretisation of spiking network models

Bruno Cessac, Thierry Viéville
2007 BMC Neuroscience  
The effects of the discretisation approximation have been analytically and experimentally analyzed, in detail.  ...  dynamics [1] and a discrete time neural network model with spiking neurons Open Access Poster presentation (page number not for citation purposes) Publish with Bio Med Central and every  ... 
doi:10.1186/1471-2202-8-s2-p76 fatcat:djo26wh7anh2hf3vnx57x33dyi

Inferring effective dynamics in large-scale networks of cortical neurons

Netta Haroush, Shimon Marom, Paolo Giudice, Maurizio Mattia
2013 BMC Neuroscience  
Inferred fatigue dynamics largely correlates both with failure rate in evoking PBs and with response delay between stimulation times and PB onsets.  ...  System identification has been used to devise effective ways in controlling and improving the comprehension of both neuronal network and single cell dynamics [2, 3] .  ...  Inferred fatigue dynamics largely correlates both with failure rate in evoking PBs and with response delay between stimulation times and PB onsets.  ... 
doi:10.1186/1471-2202-14-s1-p266 pmcid:PMC3704394 fatcat:3utqgrg33rgu3e6isjdsamsmiy

Fully-Dynamic Approximation of Betweenness Centrality [chapter]

Elisabetta Bergamini, Henning Meyerhenke
2015 Lecture Notes in Computer Science  
Using approximation, our algorithms are the first to make in-memory computation of betweenness in fully-dynamic networks with millions of edges feasible.  ...  Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths.  ...  We thank Moritz von Looz for providing the synthetic dynamic networks and the numerous contributors to the NetworKit project.  ... 
doi:10.1007/978-3-662-48350-3_14 fatcat:e332kxucpfefrg6jk3vsad7o6y

Modelling Critical Node Attacks in MANETs [chapter]

Dongsheng Zhang, James P. G. Sterbenz
2014 Lecture Notes in Computer Science  
We demonstrate that attacks based on criticality have greater impact on network performance than centrality-based attacks in realtime MANETs.  ...  MANETs (mobile ad hoc networks) operate in a selforganised and decentralised way. Attacks against nodes that are highly relied to relay traffic could result in a wide range of service outage.  ...  This research was supported in part by NSF FIND (Future Internet Design) Program under grant CNS-0626918 (Postmodern Internet Architecture) and by NSF grant CNS-1050226 (Multilayer Network Resilience Analysis  ... 
doi:10.1007/978-3-642-54140-7_11 fatcat:5mtk5jp3gfhpjjm62zkugigkfq

Analysis of Mitochondrial Networks by Serial Block Face SEM

R.D. Leapman, J.D. Hoyne, B.C. Kuo, G.N. Calco, G. Zhang, M.A. Aronova
2016 Microscopy and Microanalysis  
They are highly dynamic organelles that change their shape between discrete structures and large interconnected networks by selective fission and fusion of their membranes.  ...  This revealed that one-third of the mitochondrial volume was contained in networks of length < 2.6 µm, one-third in networks of length between 2.6 µm and 10.4 µm, and one-third in highly fused networks  ...  They are highly dynamic organelles that change their shape between discrete structures and large interconnected networks by selective fission and fusion of their membranes.  ... 
doi:10.1017/s143192761600636x fatcat:g4cvm5rnx5dg3bpu5i4x6yqmcm

How bifurcations affect functional connectivity in finite-size neural networks

Anna Cattani, Diego Fasoli, Stefano Panzeri
2015 BMC Neuroscience  
To understand the interplay between the deterministic dynamics of the network and the effects of random fluctuations in a finite-size network, we proceeded in two steps.  ...  parameters is a central topic in neuroscience [1] .  ...  To understand the interplay between the deterministic dynamics of the network and the effects of random fluctuations in a finite-size network, we proceeded in two steps.  ... 
doi:10.1186/1471-2202-16-s1-p193 pmcid:PMC4699093 fatcat:yhbd7wbppjf77b3kkohq2mqtha

Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs

Adam McLaughlin, Jason Riedy, David A. Bader
2014 2014 IEEE High Performance Extreme Computing Conference (HPEC)  
devices in communication networks [Bye et. al] • Analyzing brain networks [Rubinov and Sporns] • Sexual networks and AIDS • Identifying key actors in terrorist networks • Transportation networks  ...  fully occupy the GPU • Avg.  ... 
doi:10.1109/hpec.2014.7040980 dblp:conf/hpec/McLaughlinRB14 fatcat:yblweij5ffdqrgqurafsf4qgd4

Temporal-varying failures of nodes in networks

Georgie Knight, Giampaolo Cristadoro, Eduardo G. Altmann
2015 Physical Review E  
We propose approximations of the failure-centrality which are valid for temporal-varying failures and we dwell on the possibility of externally changing the relative importance of nodes in a given network  ...  We consider networks in which random walkers are removed because of the failure of specific nodes.  ...  (a) Fully open network ω = [0] ∞ . (b) Temporal-varying failures with protocol ω = [01011] ∞ .The error -as in Tab. I -between (γ, µ) is 160 and between (γ,γ) is 98.6.  ... 
doi:10.1103/physreve.92.022810 pmid:26382457 fatcat:3f4v75mev5g2jfagidwis3657a
« Previous Showing results 1 — 15 out of 348,439 results