Indirect Estimation of Shortest Path Distributions with Small-World Experiments

Contour polygonal approximation is a simplified representation of a contour by line segments so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex so that a regular network can be modeled. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. We compute the polygonal approximation analyzing the network properties, especially the geodesic path. The paper presents the main characteristics of the method, as well as its functionality. We evaluate the proposed method using benchmark contours and compare its results with other polygonal approximation methods.

Download Full-text

Structural changes in data communication in wireless sensor networks

Open Physics ◽

10.2478/s11534-013-0293-2 ◽

2013 ◽

Vol 11 (12) ◽

Cited By ~ 1

Author(s):

Raquel Silva Cabral ◽

Andre Aquino ◽

Alejandro Frery ◽

Osvaldo Rosso ◽

Jaime Ramírez

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Complex Networks ◽

Shortest Path ◽

Path Length ◽

Structural Changes ◽

Data Communication ◽

Small World ◽

Wireless Sensor ◽

Leibler Divergence

AbstractWireless sensor networks are an important technology for making distributed autonomous measures in hostile or inaccessible environments. Among the challenges they pose, the way data travel among them is a relevant issue since their structure is quite dynamic. The operational topology of such devices can often be described by complex networks. In this work, we assess the variation of measures commonly employed in the complex networks literature applied to wireless sensor networks. Four data communication strategies were considered: geometric, random, small-world, and scale-free models, along with the shortest path length measure. The sensitivity of this measure was analyzed with respect to the following perturbations: insertion and removal of nodes in the geometric strategy; and insertion, removal and rewiring of links in the other models. The assessment was performed using the normalized Kullback-Leibler divergence and Hellinger distance quantifiers, both deriving from the Information Theory framework. The results reveal that the shortest path length is sensitive to perturbations.

Download Full-text

Characteristic Alterations of Network in Patients With Intraoperative Stimulation-Induced Seizures During Awake Craniotomy

Frontiers in Neurology ◽

10.3389/fneur.2021.602716 ◽

2021 ◽

Vol 12 ◽

Author(s):

Shengyu Fang ◽

Chunyao Zhou ◽

Lei Wang ◽

Xing Fan ◽

Yinyan Wang ◽

...

Keyword(s):

Shortest Path ◽

Path Length ◽

Brain Networks ◽

Small World ◽

Awake Craniotomy ◽

Imaging Data ◽

Magnetic Resonance Imaging Data ◽

Subcortical Structures ◽

Sensorimotor Network ◽

History Of

Background: The use of electrocorticography (ECoG) to avoid intraoperative stimulation-induced seizure (ISS) during awake craniotomy is controversial. Although a standard direct cortical stimulating (DCS) protocol is used to identify the eloquent cortices and subcortical structures, ISS still occurs. Epilepsy is related to alterations in brain networks. In this study, we investigated specific alterations in brain networks in patients with ISS.Methods: Twenty-seven patients with glioma were enrolled and categorized into the ISS and non-ISS groups based on their history of ISS occurrence. A standard DCS protocol was used during awake craniotomy without ECoG supervision. Graph theoretical measurement was used to analyze resting-state functional magnetic resonance imaging data to quantitatively reveal alterations in the functional networks.Results: In the sensorimotor networks, the glioma significantly decreased the functional connectivity (FC) of four edges in the ISS group, which were conversely increased in the non-ISS group after multiple corrections (p < 0.001, threshold of p-value = 0.002). Regarding the topological properties, the sensorimotor network of all participants was classified as a small-world network. Glioma significantly increased global efficiency, nodal efficiency, and the sigma value, as well as decreased the shortest path length in the ISS group compared with the non-ISS group (p < 0.05).Conclusions: The specific alterations indicating patient susceptibility to ISS during DCS increased global and nodal efficiencies and decreased the shortest path length and FC induced by gliomas. If the patient has these specific alterations, ECoG is recommended to monitor after-discharge current during DCS to avoid ISS.

Download Full-text

GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS

Modern Physics Letters B ◽

10.1142/s021798490701350x ◽

2007 ◽

Vol 21 (20) ◽

pp. 1343-1349

Author(s):

HUI ZHAO ◽

ZIYOU GAO

Keyword(s):

Complex Networks ◽

Shortest Path ◽

Flux Distribution ◽

Random Network ◽

Transportation Network ◽

Small World ◽

Transportation Systems ◽

Optimal Topology ◽

Traffic Equilibrium ◽

Scale Free

Shortest path plays an important role in the study of complex networks. But in real transportation systems, choosing the shortest path may not be the best way for the drivers. Based on the traffic equilibrium theory, we generalize the concept of shortest path. Flux distribution is also investigated by using the generalized concept on various types of complex networks. We find that the flux differs little in all the edges of lattice while in small-world and scale-free networks, the flux distribution follows a power law, and in the random network, the flux distribution has an exponential tail. We consider lattice may be the optimal topology in design a transportation network.

Download Full-text

Complex Opinion Network Correlation Clustering

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.644-650.2846 ◽

2014 ◽

Vol 644-650 ◽

pp. 2846-2849

Author(s):

Fu Yan Wang ◽

Sha Qiu ◽

Qing Li

Keyword(s):

Complex Network ◽

Shortest Path ◽

Small Groups ◽

Network Structure ◽

Network Theory ◽

Small World ◽

Computer Method ◽

Correlation Clustering ◽

Complex Network Theory ◽

Correlation Data

In this paper, 2112 specific correlation data of 2 types cluster were selected as sample to build a weighted network, including each hour sample is represented by a vertex and a correlation between 2 clusters is represented by an edge. We analysis this network structure by complex network theory and computer method. We found that the correlation clusters of 2 media have an important impact on this complex network, and the specific sample follow a frequency distribution of the weighted degrees. Applying the method of k-core shows small groups in this complex network, also the modularity calculating help us find out the key cluster, the correlation cluster, the medium cluster and the interaction path of them. An apparently small-world effect has found by the shortest path calculating effectively. All of these may provide a scientific and reasonable reference for further research.

Download Full-text

EFFECTS OF ROUTE GUIDANCE SYSTEMS ON SMALL-WORLD NETWORKS

International Journal of Modern Physics C ◽

10.1142/s0129183107011285 ◽

2007 ◽

Vol 18 (08) ◽

pp. 1243-1250 ◽

Cited By ~ 3

Author(s):

JIAN-JUN WU ◽

HUI-JUN SUN ◽

ZI-YOU GAO ◽

SHU-BIN LI

Keyword(s):

Shortest Path ◽

Traffic Congestion ◽

Maximum Degree ◽

Path Length ◽

Small World ◽

Power Laws ◽

Total System ◽

Route Guidance ◽

Small World Networks ◽

Guidance Systems

The route guidance systems (RGS) are efficient in alleviating traffic congestion and reducing transit time of transportation networks. This paper studies the effects of RGS on performance of variably weighted small-world networks. The properties of the average shortest path length, the maximum degree, and the largest betweenness, as important indices for characterizing the network structure in complex networks, are simulated. Results show that there is an optimal guided rate of RGS to minimize the total system cost and the average shortest path length, and proper RGS can reduce the load of the node with maximum degree or largest betweenness. In addition, we found that the load distribution of nodes guided by RGS decay as the power laws which is very important for us to understand and control traffic congestion feasible.

Download Full-text

Optimizing Navigation Satellite Enhancement Information Distribution Network Based on X10 and MPI

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.58-60.2177 ◽

2011 ◽

Vol 58-60 ◽

pp. 2177-2182

Author(s):

Jun Xia Liu ◽

Shao Hua Liu ◽

Jun Sheng Yu ◽

Peng Xie ◽

Ze Jian Lu ◽

...

Keyword(s):

Shortest Path ◽

Path Length ◽

Large Scale ◽

Sparse Matrix ◽

Distribution Network ◽

Small World ◽

Clustering Coefficient ◽

Navigation Satellite ◽

Information Distribution ◽

Performance Requirements

To meet large-scale and time-sensitive needs of navigation Satellite enhance information distribution network in Global Position System(GPS)/Beidou and other systems [1], use small-world network model of complex network to study the topology. Small-world model has a large clustering coefficient and smaller average shortest path length so it can meet performance requirements better. Use Python language to product WS model, and simulate the important parameter-the average shortest path length. Use Dijkstra parallel algorithm and sparse matrix storage method to simulate under the use of X10 parallel language. Analyze the relationship between average shortest path length and random reconnection probability. Additionally, simulate in parallel MPI library and compare the two.

Download Full-text

ASSESSMENT OF AKURE ROAD NETWORK: A SHORTEST PATH APPROACH

Journal of Engineering Studies and Research ◽

10.29081/jesr.v19i2.128 ◽

2016 ◽

Vol 19 (2) ◽

Author(s):

SEUN OLUWAJANA ◽

OLUFIKAYO ADERINLEWO ◽

ADEBAYO OWOLABI ◽

SILVANA CROOPE

Keyword(s):

Shortest Path ◽

Road Network ◽

Shortest Paths ◽

Small World ◽

Edge Length ◽

The Road ◽

Self Organized ◽

Path Lengths ◽

The City ◽

Path Properties

<p>In this paper, the road network of Akure (a city in south western Nigeria) was studied based on its shortest path properties. Three sections, each measuring 1 square mile, were sampled from the entire road network and developed into graphs using both a primal approach and graph theory in which the intersections and streets were represented as nodes and edges respectively. These graphs were assessed for the edge lengths and shortest paths between nodes from which their edge length distributions, average path lengths and efficiencies were also obtained. It was concluded that the city of Akure is self-organized with small world properties since the network case studies showed small path lengths.</p>

Download Full-text