3,639 Hits in 2.8 sec

Randomizing growing networks with a time-respecting null model

Zhuo-Ming Ren, Manuel Sebastian Mariani, Yi-Cheng Zhang, Matúš Medo
2018 Physical review. E  
by paradigmatic node centrality metrics such as indegree and Google's PageRank.  ...  Complex networks are often used to represent systems that are not static but grow with time: people make new friendships, new papers are published and refer to the existing ones, and so forth.  ...  Configuration model For a directed network, the (static) CM [1, 14, 38] generates directed random networks with given out-and indegree sequences {k out i } and {k in i }, whose values are preserved either  ... 
doi:10.1103/physreve.97.052311 pmid:29906916 fatcat:otrk2navnvhydbahw6buejsmyq

Recursive module extraction using Louvain and PageRank

Dimitri Perrin, Guido Zuccon
2018 F1000Research  
In this article we propose a recursive method based on the Louvain algorithm for community detection and the PageRank algorithm for authoritativeness weighting in networks.  ...  This method is evaluated on a heterogeneous set of six biological networks from the Disease Module Identification DREAM Challenge.  ...  The authors also wish to acknowledge the work from Charlie Shaw-Feather, who helped configure and run local Pascal evaluations.  ... 
doi:10.12688/f1000research.15845.1 fatcat:ehxnprd7bbastfzczph4agkneq

Ranking Vertices or Edges of a Network by Loops: A New Approach

Valery Van Kerrebroeck, Enzo Marinari
2008 Physical Review Letters  
We introduce Loop Ranking, a new ranking measure based on the detection of closed paths, which can be computed in an efficient way.  ...  We argue that Loop Ranking is a very appropriate measure to quantify the role of both vertices and edges in the network traffic.  ...  In general the importance of a vertex, and thus its ranking, depends very much on the type of network which is under consideration.  ... 
doi:10.1103/physrevlett.101.098701 pmid:18851664 fatcat:is3u5ud6oveqbm3425uudkxe4m

Malware Containment Using Weight based on Incremental PageRank in Dynamic Social Networks

2015 KSII Transactions on Internet and Information Systems  
The weighted directions and activities between the nodes are taken into account to select reliable key nodes from the generated subgroups, and the Incremental PageRanking algorithm reflecting dynamic social  ...  In this paper, an effective patch strategy is proposed to deal with malicious worms based on social networks.  ...  network configuration [4] [5] [6] .  ... 
doi:10.3837/tiis.2015.01.026 fatcat:6nr4txa2w5elfiskdwo2gagdqa

Distributed Computing Engines for Big Data Analytics

2019 International journal of recent technology and engineering  
In this paper, empirical study is made on the three frameworks like Hadoop, Apache Spark and Apache Flink with different parameters like type of network, block size of HDFS, input data size and other configuration  ...  Different input generators like RandomTextWriter, TeraGen, DataGen and GenKMeansDataset are used for generating test data. The network  ...  There is impact of interconnect network on the execution time.  ... 
doi:10.35940/ijrte.b3771.078219 fatcat:bbpnou3i2rbtdiqxufjj2kdzwe

PageRank in scale-free random graphs [article]

Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto
2014 arXiv   pre-print
We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of the root node of an  ...  Directed Random Graphs We will give below an algorithm, taken from [7] , that can be used to generate a scale-free directed graph.  ...  Specifically, we assume that the underlying graph is a directed configuration model (DCM) with given degree distributions, as developed by Chen and Olvera-Cravioto [7] .  ... 
arXiv:1408.3610v1 fatcat:q7dvmmqqabhbrmss7sgrqt6fr4

PageRank in Scale-Free Random Graphs [chapter]

Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto
2014 Lecture Notes in Computer Science  
We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of the root node of an  ...  Directed Random Graphs We will give below an algorithm, taken from [7] , that can be used to generate a scale-free directed graph.  ...  Specifically, we assume that the underlying graph is a directed configuration model (DCM) with given degree distributions, as developed by Chen and Olvera-Cravioto [7] .  ... 
doi:10.1007/978-3-319-13123-8_10 fatcat:mnsu6r6ixneulh7pynlazxfvky

Exploring the Characteristics of an Intra-Urban Bus Service Network: A Case Study of Shenzhen, China

Xiping Yang, Shiwei Lu, Weifeng Zhao, Zhiyuan Zhao
2019 ISPRS International Journal of Geo-Information  
The urban bus service system is one of the most important components of a public transport system.  ...  A case study of Shenzhen, China was implemented to understand the statistical properties and spatial characteristics of the urban bus network configuration.  ...  This study did not consider the directions of the bus lines, and pairs of bus stops with the same name on either side of the road were merged into one stop.  ... 
doi:10.3390/ijgi8110486 fatcat:6vllifow45dkxitrezkbsxyil4

A Probabilistic Model for Road Selection in Mobile Maps [chapter]

Thomas C. van Dijk, Jan-Henrik Haunert
2013 Lecture Notes in Computer Science  
Underlying the PageRank calculation is a probabilistic model of user behavior. We provide suitable generalizations of this model to road networks.  ...  Two maps that show different subsets of edges (black) of a road network (gray).  ...  Generally, however, algorithms are missing that are configurable for multiple applications.  ... 
doi:10.1007/978-3-642-37087-8_16 fatcat:5mwehrbutfg55m65hvemmfhycm

Cut to Fit: Tailoring the Partitioning to the Computation [article]

Iacovos Kolokasis, Polyvios Pratikakis
2018 arXiv   pre-print
We concentrate on the impact of partitioning strategies on the performance of computations on social graphs.  ...  These, however, are profiled and optimized for the general case and have to perform for all kinds of graphs.  ...  Specifically, we ran the PageRank algorithm on the big dataset, follow dec after updating the network Infrastructure to 40Gbps, compared to 1Gbps above.  ... 
arXiv:1804.07747v1 fatcat:fapg4zxm65fjrjzskcazqq7gza

Impact of hierarchical modular structure on ranking of individual nodes in directed networks

Naoki Masuda, Yoji Kawamura, Hiroshi Kori
2009 New Journal of Physics  
To assess the importance of a node in a directed network, various centrality measures based on different criteria have been proposed.  ...  Many systems, ranging from biological and engineering systems to social systems, can be modeled as directed networks, with links representing directed interaction between two nodes.  ...  With the remaining probability i =i, j =i w i j / i , j w i j , the configuration of types A and B on the network does not change.  ... 
doi:10.1088/1367-2630/11/11/113002 fatcat:rtrqwtpqpzf2tmuqys3xbfoj3m

Collective frequency variation in network synchronization and reverse PageRank

Per Sebastian Skardal, Dane Taylor, Jie Sun, Alex Arenas
2016 Physical review. E  
Here we study the dynamics of self-organizing systems and show that for generic directed networks the collective frequency of the ensemble is not the same as the mean of the individuals' natural frequencies  ...  Our findings uncover an intricate dependence of the collective frequency on both the structural directedness and dynamical heterogeneity of the network, and also reveal an unexplored connection between  ...  Formally the PageRank of a network represents the steady state of a Markovian random walk on the network.  ... 
doi:10.1103/physreve.93.042314 pmid:27176319 pmcid:PMC5131881 fatcat:iaxptytkprayponpwmjckhwuvu

TensorFlow Solver for Quantum PageRank in Large-Scale Networks [article]

Hao Tang, Tian-Shen He, Ruo-Xi Shi, Yan-Yan Zhu, Marcus Lee, Tian-Yu Wang, Xian-Min Jin
2020 arXiv   pre-print
We demonstrate its performance in solving quantum PageRank for the USA major airline network with up to 922 nodes.  ...  Google PageRank is a prevalent and useful algorithm for ranking the significance of nodes or websites in a network, and a recent quantum counterpart for PageRank algorithm has been raised to suggest a  ...  It takes around 3 hours for our TensorFlow CPU solution to fin- ish the task on a common laptop (CPU configuration: i74700M Q), and around 1 hour on a desktop CPU with higher configurations.  ... 
arXiv:2003.04930v1 fatcat:zkaqzfgjhzeuzlua24jzt6pwmq

Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities [article]

Doina Bucur, Petter Holme
2020 arXiv   pre-print
Typically, these successful combinations include one normalized spectral centralities (such as PageRank or Katz centrality) and one measure that is sensitive to the number of edges in the graph.  ...  Identifying important nodes for disease spreading is a central topic in network epidemiology.  ...  Acknowledgments We thank the organizers of the YEP 2019 workshop on Information Diffusion on Random Networks at TU Eindhoven, where we initiated this work.  ... 
arXiv:1909.10021v2 fatcat:u3ixeihrj5bttddwzhoqkicq5q

Local weak convergence for PageRank [article]

Alessandro Garavaglia and Remco van der Hofstad and Nelly Litvak
2018 arXiv   pre-print
This may help to identify general network structures in which the power-law hypothesis holds.  ...  One of the intriguing empirical properties of PageRank is the so-called 'power-law hypothesis': in a scale-free network the PageRank scores follow a power law with the same exponent as the (in-)degrees  ...  This work is supported in part by the Netherlands Organisation for Scientific Research (NWO) through the Gravitation Networks grant 024.002.003.  ... 
arXiv:1803.06146v1 fatcat:oi2gdguchrg75irhymly7gkwke
« Previous Showing results 1 — 15 out of 3,639 results