Filters








187 Hits in 5.7 sec

Dynamic Laplace: Efficient Centrality Measure for Weighted or Unweighted Evolving Networks [article]

Mário Cordeiro, Pavel Brazdil Doctoral Program in Informatics Engineering - Faculty of Engineering at University of Porto, INESC TEC - Institute for Systems and Computer Engineering Technology and Science)
2018 arXiv   pre-print
Our contribution is the proposal of two incremental versions of the Laplacian Centrality measure, that can be applied not only to large graphs but also to, weighted or unweighted, dynamically changing  ...  The experimental evaluation was performed with several tests in different types of evolving networks, incremental or fully dynamic.  ...  Rui Portocarrero Sarmento also gratefully acknowledges funding from FCT (Portuguese Foundation for Science and Technology) through a PhD grant (SFRH/BD/119108/2016)  ... 
arXiv:1808.02960v1 fatcat:ln4iygshbffivcphm5ki7qc6bu

Forman-Ricci Flow for Change Detection in Large Dynamic Data Sets

Melanie Weber, Jürgen Jost, Emil Saucan
2016 Axioms  
We present a viable geometric solution for the detection of dynamic effects in complex networks.  ...  We study the classical Ricci-flow in a network-theoretic setting and introduce an analytic tool for characterizing dynamic effects.  ...  Acknowledgments: Emil Saucan acknowledges the warm support of the Max-Planck-Institute for Mathematics in the Sciences, Leipzig, for the warm hospitality during the writing of this paper.  ... 
doi:10.3390/axioms5040026 fatcat:6ifogixlbfbava4svvje2kctim

Forman-Ricci flow for change detection in large dynamic data sets [article]

Melanie Weber, Jürgen Jost, Emil Saucan
2016 arXiv   pre-print
We present a viable solution to the challenging question of change detection in complex networks inferred from large dynamic data sets.  ...  Furthermore we adapt the classical Ricci flow that already proved to be a powerful tool in image processing and graphics, to the case of undirected and weighted networks.  ...  Acknowledgements ES acknowledges the warm support of the Max-Planck-Institute for Mathematics in the Sciences, Leipzig, for the warm hospitality during the writing of this paper.  ... 
arXiv:1604.06634v2 fatcat:3f56kfyx35b7hpbt5nhifxdvdi

Generalized master equations for non-Poisson dynamics on networks

Till Hoffmann, Mason A. Porter, Renaud Lambiotte
2012 Physical Review E  
The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network.  ...  We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.  ...  Saramäki for fruitful discussions. APPENDIX: NUMERICAL SIMULATION We implemented our numerical simulations using PYTHON.  ... 
doi:10.1103/physreve.86.046102 pmid:23214647 fatcat:komkc7emxzdpjfi57bbxx6m7ga

Evolving Networks and Social Network Analysis Methods and Techniques [chapter]

Mário Cordeiro, Rui P. Sarmento, Pavel Brazdil, João Gama
2018 Social Media and Journalism - Trends, Connections, Implications  
dynamic versions that allow the efficient analysis of evolving networks.  ...  They are a natural extension of network science since almost all real-world networks evolve over time, either by adding or by removing nodes or links over time: elementary actor-level network measures  ...  The authors also want to thank the reviewers for the constructive reviews provided in the development of this publication.  ... 
doi:10.5772/intechopen.79041 fatcat:x4m2g5borjfijknqck54ierppq

Nonlocal network dynamics via fractional graph Laplacians [article]

Michele Benzi, Daniele Bertaccini, Fabio Durastante, Igor Simunec
2020 arXiv   pre-print
We introduce nonlocal dynamics on directed networks through the construction of a fractional version of a nonsymmetric Laplacian for weighted directed graphs.  ...  Furthermore, we provide an analytic treatment of fractional dynamics for both directed and undirected graphs, showing the possibility of exploring the network employing random walks with jumps of arbitrary  ...  Acknowledgment We would like to thank two anonymous referees for their helpful comments on an earlier draft of the paper.  ... 
arXiv:1912.07288v4 fatcat:wb5jajn3hrdlbke3mozmdl4eby

Dynamics of cascades on burstiness-controlled temporal networks [article]

Samuel Unicomb, Gerardo Iñiguez, James P. Gleeson, Márton Karsai
2020 arXiv   pre-print
to epidemic contagion and language dynamics.  ...  However, an analytical framework capturing the effect of burstiness on generic dynamics is lacking.  ...  We shall see that the computation of the forward Laplace transform is the bottleneck, as opposed to finding the weights.  ... 
arXiv:2007.06223v1 fatcat:57ctpsg5tvct5bi5tdr6lt4fwm

Non-Markovianity over Ensemble Averages in Quantum Complex Networks

Johannes Nokkala, Sabrina Maniscalco, Jyrki Piilo
2017 Open systems & information dynamics  
We consider bosonic quantum complex networks as structured finite environments for a quantum harmonic oscillator and investigate the interplay between the network structure and its spectral density, excitation  ...  This suggests that tree networks are the random networks optimizing this quantity.  ...  N. acknowledges the Wihuri foundation for financing his graduate studies.  ... 
doi:10.1142/s1230161217400182 fatcat:ym62vpkut5fx3l2owzakmff3wq

Characterizing Complex Networks with Forman-Ricci Curvature and Associated Geometric Flows [article]

Melanie Weber, Emil Saucan, Jürgen Jost
2016 arXiv   pre-print
Following a theoretical introduction and mathematical motivation, we apply the proposed network-analytic methods to static and dynamic complex networks and compare the results with established node-based  ...  We introduce Forman-Ricci curvature and its corresponding flow as characteristics for complex networks attempting to extend the common approach of node-based network analysis by edge-based characteristics  ...  Acknowledgements The authors thank Areejit Samal for helpful discussions.  ... 
arXiv:1607.08654v2 fatcat:uhaxszhkm5ervneh5gl55vs5py

Characterizing complex networks with Forman-Ricci curvature and associated geometric flows

Melanie Weber, Emil Saucan, Jürgen Jost
2017 Journal of Complex Networks  
Following a theoretical introduction and mathematical motivation, we apply the proposed network-analytic methods to static and dynamic complex networks and compare the results with established node-based  ...  We introduce Forman-Ricci curvature and its corresponding flow as characteristics for complex networks attempting to extend the common approach of node-based network analysis by edge-based characteristics  ...  Acknowledgements The authors thank Areejit Samal for helpful discussions.  ... 
doi:10.1093/comnet/cnw030 fatcat:zxne5yllpvanpnel3rtsygpphm

Heat-Diffusion: Pareto Optimal Dynamic Routing for Time-Varying Wireless Networks [article]

Reza Banirazi, Edmond Jonckheere, Bhaskar Krishnamachari
2019 arXiv   pre-print
A dynamic routing policy, referred to as Heat-Diffusion (HD), is developed for multihop uniclass wireless networks subject to random traffic, time-varying topology and inter-channel interference.The policy  ...  Further, HD minimizes average network delay in the class of routing policies that base decisions only on current condition of traffic congestion and channel states.  ...  Acknowledgment The authors thank Professor Michael Neely at USC, for his helpful feedback and discussions on this work.  ... 
arXiv:1902.05649v1 fatcat:wjbeeuhsnrdshlknyaks2k6ywq

Variational Kinetic Clustering of Complex Networks

Vladimir Koskin, Adam Kells, Joe Clayton, Alexander Hartmann, Alessia Annibale, Edina Rosta
2022 Journal of Chemical Physics  
Efficiently identifying the most important communities and key transition nodes in weighted and unweighted networks is a prevalent problem in a wide range of disciplines.  ...  they separate.We also propose an efficient method that first projects the network nodes onto a 1D reaction coordinate and subsequently performs a variational boundary search using a parallel tempering  ...  Martin for discussions and comments on the manuscript. This work was supported by funding from EPSRC (EP/R013012/1) and ERC (project 757850 BioNet).  ... 
doi:10.1063/5.0105099 fatcat:lt4mwkinongpvejw6jrncbawbe

Random walks and diffusion on networks

Naoki Masuda, Mason A. Porter, Renaud Lambiotte
2017 Physics reports  
Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures.  ...  dense groups of entities in a network.  ...  (The simplest -and a rather popular -measure of centrality in networks is simply to calculate node degrees and/or node strengths.)  ... 
doi:10.1016/j.physrep.2017.07.007 fatcat:wvjtv3muo5drhjgbnzzn6j2nsi

Bank Networks from Text: Interrelations, Centrality and Determinants [article]

Samuel Rönnqvist, Peter Sarlin
2015 arXiv   pre-print
For qualitative assessment of bank networks, we put forward a visual, interactive interface for better illustrating network structures.  ...  To quantify bank importance, we propose an information centrality measure to rank and assess trends of bank centrality in discussion.  ...  We propose a method to stabilize the centrality measurement by applying Laplace smoothing to the link weights before calculation of information centrality.  ... 
arXiv:1406.7752v2 fatcat:brdpxk5pnng5pi7v3jlidlgj4y

Cluster-based Characterization and Modeling for UAV Air-to-Ground Time-Varying Channels [article]

Zhuangzhuang Cui, Ke Guan, Claude Oestges, César Briso-Rodríguez, Bo Ai, Zhangdui Zhong
2021 arXiv   pre-print
For characterizing time-variant clusters, we exploit a clustering-based tracking (CBT) method, which efficiently quantifies the survival lengths of clusters.  ...  Then, we cluster the extracted MPCs considering their static and dynamic characteristics by employing K-Power-Means (KPM) algorithm under multipath component distance (MCD) measure.  ...  Accordingly, we first show the 2D tracking results in Fig. 10 , where (a) and (b) consider the unweighted and weighted distance-delay measure, whereas (c) and (d) consider the unweighted and weighted  ... 
arXiv:2108.11902v1 fatcat:xtofolqz5va6tb7j2r6sou3zmi
« Previous Showing results 1 — 15 out of 187 results