Study on Partitioning Real-World Directed Graphs of Skewed Degree Distribution

Author(s):  
Jie Yan ◽  
Guangming Tan ◽  
Ninghui Sun
2007 ◽  
Vol 17 (07) ◽  
pp. 2343-2353 ◽  
Author(s):  
SANTO FORTUNATO ◽  
ALESSANDRO FLAMMINI

PageRank, the prestige measure for Web pages used by Google, is the stationary probability of a peculiar random walk on directed graphs, which interpolates between a pure random walk and a process where all nodes have the same probability of being visited. We give some exact results on the distribution of PageRank in the cases in which the damping factor q approaches the two limit values 0 and 1. When q → 0 and for several classes of graphs the distribution is a power law with exponent 2, regardless of the in-degree distribution. When q → 1 it can always be derived from the in-degree distribution of the underlying graph, if the out-degree is the same for all nodes.


Author(s):  
Drew Levin ◽  
Patrick Finley

ObjectiveTo develop a spatially accurate biosurveillance synthetic datagenerator for the testing, evaluation, and comparison of new outbreakdetection techniques.IntroductionDevelopment of new methods for the rapid detection of emergingdisease outbreaks is a research priority in the field of biosurveillance.Because real-world data are often proprietary in nature, scientists mustutilize synthetic data generation methods to evaluate new detectionmethodologies. Colizza et. al. have shown that epidemic spread isdependent on the airline transportation network [1], yet current datagenerators do not operate over network structures.Here we present a new spatial data generator that models thespread of contagion across a network of cities connected by airlineroutes. The generator is developed in the R programming languageand produces data compatible with the popular `surveillance’ softwarepackage.MethodsColizza et. al. demonstrate the power-law relationships betweencity population, air traffic, and degree distribution [1]. We generate atransportation network as a Chung-Lu random graph [2] that preservesthese scale-free relationships (Figure 1).First, given a power-law exponent and a desired number of cities,a probability mass function (PMF) is generated that mirrors theexpected degree distribution for the given power-law relationship.Values are then sampled from this PMF to generate an expecteddegree (number of connected cities) for each city in the network.Edges (airline connections) are added to the network probabilisticallyas described in [2]. Unconnected graph components are each joinedto the largest component using linear preferential attachment. Finally,city sizes are calculated based on an observed three-quarter power-law scaling relationship with the sampled degree distribution.Each city is represented as a customizable stochastic compartmentalSIR model. Transportation between cities is modeled similar to [2].An infection is initialized in a single random city and infection countsare recorded in each city for a fixed period of time. A consistentfraction of the modeled infection cases are recorded as daily clinicvisits. These counts are then added onto statically generated baselinedata for each city to produce a full synthetic data set. Alternatively,data sets can be generated using real-world networks, such as the onemaintained by the International Air Transport Association.ResultsDynamics such as the number of cities, degree distribution power-law exponent, traffic flow, and disease kinetics can be customized.In the presented example (Figure 2) the outbreak spreads over a 20city transportation network. Infection spreads rapidly once the morepopulated hub cities are infected. Cities that are multiple flights awayfrom the initially infected city are infected late in the process. Thegenerator is capable of creating data sets of arbitrary size, length, andconnectivity to better mirror a diverse set of observed network types.ConclusionsNew computational methods for outbreak detection andsurveillance must be compared to established approaches. Outbreakmitigation strategies require a realistic model of human transportationbehavior to best evaluate impact. These actions require test data thataccurately reflect the complexity of the real-world data they wouldbe applied to. The outbreak data generated here represents thecomplexity of modern transportation networks and are made to beeasily integrated with established software packages to allow for rapidtesting and deployment.Randomly generated scale-free transportation network with a power-lawdegree exponent ofλ=1.8. City and link sizes are scaled to reflect their weight.An example of observed daily outbreak-related clinic visits across a randomlygenerated network of 20 cities. Each city is colored by the number of flightsrequired to reach the city from the initial infection location. These generatedcounts are then added onto baseline data to create a synthetic data set forexperimentation.KeywordsSimulation; Network; Spatial; Synthetic; Data


2019 ◽  
Vol 40 ◽  
pp. 183
Author(s):  
Larissa Melchiors Furlan ◽  
Mylena Roehrs ◽  
Glauber Rodrigues de Quadros

Graphs theory is very important in the mathematical world as an excellent way of connecting with the real world. By using the theory of directed graphs it is possible to transform many of the everyday problems into mathematical problems, so as to make an exact study in each case. In this work we explore the matrices related to the various types of graphs, such as the vertex matrix, which is associated with a directed graph, and the adjacency matrix. Moreover, matrices of multi-step connections are constructed so as to separate the various blades between the vertices of a directed graph. Then, we will construct some applications of those results in the form of examples.


Author(s):  
Thomas Bläsius ◽  
Philipp Fischbeck ◽  
Tobias Friedrich ◽  
Maximilian Katzmann

AbstractThe computational complexity of the VertexCover problem has been studied extensively. Most notably, it is NP-complete to find an optimal solution and typically NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on many real-world networks the run time to solve VertexCover is way smaller than even the best known FPT-approaches can explain. We link these observations to two properties that are observed in many real-world networks, namely a heterogeneous degree distribution and high clustering. To formalize these properties and explain the observed behavior, we analyze how a branch-and-reduce algorithm performs on hyperbolic random graphs, which have become increasingly popular for modeling real-world networks. In fact, we are able to show that the VertexCover problem on hyperbolic random graphs can be solved in polynomial time, with high probability. The proof relies on interesting structural properties of hyperbolic random graphs. Since these predictions of the model are interesting in their own right, we conducted experiments on real-world networks showing that these properties are also observed in practice.


2018 ◽  
Vol 7 (3) ◽  
pp. 375-392 ◽  
Author(s):  
L A Bunimovich ◽  
D C Smith ◽  
B Z Webb

AbstractOne of the most important features observed in real networks is that, as a network’s topology evolves so does the network’s ability to perform various complex tasks. To explain this, it has also been observed that as a network grows certain subnetworks begin to specialize the function(s) they perform. Herein, we introduce a class of models of network growth based on this notion of specialization and show that as a network is specialized using this method its topology becomes increasingly sparse, modular and hierarchical, each of which are important properties observed in real networks. This procedure is also highly flexible in that a network can be specialized over any subset of its elements. This flexibility allows those studying specific networks the ability to search for mechanisms that describe their growth. For example, we find that by randomly selecting these elements a network’s topology acquires some of the most well-known properties of real networks including the small-world property, disassortativity and a right-skewed degree distribution. Beyond this, we show how this model can be used to generate networks with real-world like clustering coefficients and power-law degree distributions, respectively. As far as the authors know, this is the first such class of models that can create an increasingly modular and hierarchical network topology with these properties.


2005 ◽  
Vol 42 (03) ◽  
pp. 839-850 ◽  
Author(s):  
Zsolt Katona

Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices then this will be a tree. These graphs have been shown to have a power-law degree distribution, the same as that observed in some large real-world networks. We are interested in the width of the tree and we show that it is at the nth step; this also holds for a slight generalization of the model with another constant. We then see how this theoretical result can be applied to directory trees.


2020 ◽  
Author(s):  
Renato Silva Melo ◽  
André Luís Vignatti

In the Target Set Selection (TSS) problem, we want to find the minimum set of individuals in a network to spread information across the entire network. This problem is NP-hard, so find good strategies to deal with it, even for a particular case, is something of interest. We introduce preprocessing rules that allow reducing the size of the input without losing the optimality of the solution when the input graph is a complex network. Such type of network has a set of topological properties that commonly occurs in graphs that model real systems. We present computational experiments with real-world complex networks and synthetic power law graphs. Our strategies do particularly well on graphs with power law degree distribution, such as several real-world complex networks. Such rules provide a notable reduction in the size of the problem and, consequently, gains in scalability.


2022 ◽  
Vol 12 (1) ◽  
pp. 0-0

Time evolving networks tend to have an element of regularity. This regularity is characterized by existence of repetitive patterns in the data sequences of the graph metrics. As per our research, the relevance of such regular patterns to the network has not been adequately explored. Such patterns in certain data sequences are indicative of properties like popularity, activeness etc. which are of vital significance for any network. These properties are closely indicated by data sequences of graph metrics - degree prestige, degree centrality and occurrence. In this paper, (a) an improved mining algorithm has been used to extract regular patterns in these sequences, and (b) a methodology has been proposed to quantitatively analyse the behavior of the obtained patterns. To analyze this behavior, a quantification measure coined as "Sumscore" has been defined to compare the relative significance of such patterns. The patterns are ranked according to their Sumscores and insights are then drawn upon it. The efficacy of this method is demonstrated by experiments on two real world datasets.


2005 ◽  
Vol 42 (3) ◽  
pp. 839-850 ◽  
Author(s):  
Zsolt Katona

Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices then this will be a tree. These graphs have been shown to have a power-law degree distribution, the same as that observed in some large real-world networks. We are interested in the width of the tree and we show that it is at the nth step; this also holds for a slight generalization of the model with another constant. We then see how this theoretical result can be applied to directory trees.


Sign in / Sign up

Export Citation Format

Share Document