Effect of landslides on the structural characteristics of land-cover based on complex networks

2017 ◽  
Vol 31 (22) ◽  
pp. 1750156 ◽  
Author(s):  
Jing He ◽  
Chuan Tang ◽  
Gang Liu ◽  
Weile Li
Keyword(s):  
Land Cover ◽  
Complex Networks ◽  
Power Law ◽  
Satellite Images ◽  
Structural Characteristics ◽  
Power Law Distribution ◽  
Graph Topology ◽  
Linear Coefficient ◽  
Area Distribution ◽  
Before And After

Landslides have been widely studied by geologists. However, previous studies mainly focused on the formation of landslides and never considered the effect of landslides on the structural characteristics of land-cover. Here we define the modeling of the graph topology for the land-cover, using the satellite images of the earth’s surface before and after the earthquake. We find that the land-cover network satisfies the power-law distribution, whether the land-cover contains landslides or not. However, landslides may change some parameters or measures of the structural characteristics of land-cover. The results show that the linear coefficient, modularity and area distribution are all changed after the occurence of landslides, which means the structural characteristics of the land-cover are changed.

A Small-World Model of Scale-Free Networks: Features and Verifications

2011 ◽  
Vol 50-51 ◽  
pp. 166-170 ◽  
Author(s):  
Wen Jun Xiao ◽  
Shi Zhong Jiang ◽  
Guan Rong Chen
Keyword(s):  
Complex Networks ◽  
Power Law ◽  
Degree Sequence ◽  
Small World ◽  
Static Condition ◽  
Vertex Degree ◽  
Power Law Distribution ◽  
Least Common Multiple ◽  
Scale Free ◽  
Vertex Degrees

It is now well known that many large-sized complex networks obey a scale-free power-law vertex-degree distribution. Here, we show that when the vertex degrees of a large-sized network follow a scale-free power-law distribution with exponent  2, the number of degree-1 vertices, if nonzero, is of order N and the average degree is of order lower than log N, where N is the size of the network. Furthermore, we show that the number of degree-1 vertices is divisible by the least common multiple of , , . . ., , and l is less than log N, where l = < is the vertex-degree sequence of the network. The method we developed here relies only on a static condition, which can be easily verified, and we have verified it by a large number of real complex networks.

An empirical comparison of sales time series for online and offline channels for commodities in China

2014 ◽  
Vol 24 (5) ◽  
Author(s):  
JINLONG WANG ◽  
CAN WEN ◽  
XIAOYI WANG
Keyword(s):  
Time Series ◽  
Complex Networks ◽  
Power Law ◽  
Constant Parameter ◽  
Power Law Distribution ◽  
Empirical Comparison ◽  
Visibility Graphs ◽  
Offline Channels ◽  
Power Law Distributions

In this paper we make an empirical comparison of sales time series for online and offline channels. In particular, we analyse the sales dynamic and fluctuation level underlying the sales time series in different channels. The accumulative daily sales distributions of commodities are analysed statistically and the daily sales series are also studied from the perspective of complex networks. We find that most of the commodities' accumulative sales distributions can be fitted by power-law distributions. Visibility graphs are constructed for the daily sales series, and the accumulative degree distributions are also investigated – it is found that they also almost follow power-law distribution. The constant parameter α indicates that different specifications of the same goods have different sales characteristics, and different forms of packaging of commodities, either special offer or ordinary, also show distinctive sales fluctuation levels. The differences show that the direction of these relationships is opposite for online and offline channels.

VERTEX COVER IN COMPLEX NETWORKS

2013 ◽  
Vol 24 (11) ◽  
pp. 1350078 ◽  
Author(s):  
MARIANA O. DA SILVA ◽  
GUSTAVO A. GIMENEZ-LUGO ◽  
MURILO V. G. DA SILVA
Keyword(s):  
Approximation Algorithm ◽  
Complex Networks ◽  
Power Law ◽  
Vertex Cover ◽  
Constant Factor ◽  
Power Law Distribution ◽  
Practical Result ◽  
The Best Approximation ◽  
Np Hard Problem ◽  
The Moment

A Minimum Vertex Cover is the smallest set of vertices whose removal completely disconnects a graph. In this paper, we perform experiments on a number of graphs from standard complex networks databases addressing the problem of finding a "good" vertex cover (finding an optimum is a NP-Hard problem). In particular, we take advantage of the ubiquitous power law distribution present on many complex networks. In our experiments, we show that running a greedy algorithm in a power law graph we can obtain a very small vertex cover typically about 1.02 times the theoretical optimum. This is an interesting practical result since theoretically we know that: (1) In a general graph, on n vertices a greedy approach cannot guarantee a factor better than ln n; (2) The best approximation algorithm known at the moment is very involved and has a much larger factor of [Formula: see text]. In fact, in the context of approximation within a constant factor, it is conjectured that there is no (2 – ϵ)-approximation algorithm for the problem; (3) Even restricted to power law graphs and probabilistic guarantees, the best known approximation rate is 1.5.

scholarly journals Network robustness improvement via long-range links

2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Vincenza Carchiolo ◽  
Marco Grassia ◽  
Alessandro Longheu ◽  
Michele Malgeri ◽  
Giuseppe Mangioni
Keyword(s):  
Complex Networks ◽  
Long Range ◽  
Real World ◽  
Network Robustness ◽  
Scale Free ◽  
Area Of Interest ◽  
Before And After ◽  
Significant Area ◽  
Better Than

AbstractMany systems are today modelled as complex networks, since this representation has been proven being an effective approach for understanding and controlling many real-world phenomena. A significant area of interest and research is that of networks robustness, which aims to explore to what extent a network keeps working when failures occur in its structure and how disruptions can be avoided. In this paper, we introduce the idea of exploiting long-range links to improve the robustness of Scale-Free (SF) networks. Several experiments are carried out by attacking the networks before and after the addition of links between the farthest nodes, and the results show that this approach effectively improves the SF network correct functionalities better than other commonly used strategies.

scholarly journals The structure of co-publications multilayer network

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Ghislain Romaric Meleu ◽  
Paulin Yonta Melatagia
Keyword(s):  
Power Law ◽  
Degree Distribution ◽  
Preferential Attachment ◽  
Small World ◽  
Generation Model ◽  
Small World Network ◽  
Power Law Distribution ◽  
Multilayer Networks ◽  
Multilayer Network ◽  
Scientific Papers

AbstractUsing the headers of scientific papers, we have built multilayer networks of entities involved in research namely: authors, laboratories, and institutions. We have analyzed some properties of such networks built from data extracted from the HAL archives and found that the network at each layer is a small-world network with power law distribution. In order to simulate such co-publication network, we propose a multilayer network generation model based on the formation of cliques at each layer and the affiliation of each new node to the higher layers. The clique is built from new and existing nodes selected using preferential attachment. We also show that, the degree distribution of generated layers follows a power law. From the simulations of our model, we show that the generated multilayer networks reproduce the studied properties of co-publication networks.

scholarly journals Power-law behavior of transcription factor dynamics at the single-molecule level implies a continuum affinity model

2021 ◽  
Author(s):  
David A Garcia ◽  
Gregory Fettweis ◽  
Diego M Presman ◽  
Ville Paakinaho ◽  
Christopher Jarzynski ◽  
...  
Keyword(s):  
Transcription Factor ◽  
Single Molecule ◽  
Power Law ◽  
Dwell Time ◽  
Specific Binding ◽  
Power Law Distribution ◽  
Single Molecule Level ◽  
Binding Behavior ◽  
Chromatin Template ◽  
Nuclear Domains

Abstract Single-molecule tracking (SMT) allows the study of transcription factor (TF) dynamics in the nucleus, giving important information regarding the diffusion and binding behavior of these proteins in the nuclear environment. Dwell time distributions obtained by SMT for most TFs appear to follow bi-exponential behavior. This has been ascribed to two discrete populations of TFs—one non-specifically bound to chromatin and another specifically bound to target sites, as implied by decades of biochemical studies. However, emerging studies suggest alternate models for dwell-time distributions, indicating the existence of more than two populations of TFs (multi-exponential distribution), or even the absence of discrete states altogether (power-law distribution). Here, we present an analytical pipeline to evaluate which model best explains SMT data. We find that a broad spectrum of TFs (including glucocorticoid receptor, oestrogen receptor, FOXA1, CTCF) follow a power-law distribution of dwell-times, blurring the temporal line between non-specific and specific binding, suggesting that productive binding may involve longer binding events than previously believed. From these observations, we propose a continuum of affinities model to explain TF dynamics, that is consistent with complex interactions of TFs with multiple nuclear domains as well as binding and searching on the chromatin template.

scholarly journals Improving Land Cover Classification Using Genetic Programming for Feature Construction

2021 ◽  
Vol 13 (9) ◽  
pp. 1623
Author(s):  
João E. Batista ◽  
Ana I. R. Cabral ◽  
Maria J. P. Vasconcelos ◽  
Leonardo Vanneschi ◽  
Sara Silva
Keyword(s):  
Land Cover ◽  
Genetic Programming ◽  
Satellite Images ◽  
State Of The Art ◽  
Binary Classification ◽  
Feature Construction ◽  
Classification Problems ◽  
Construction Methods ◽  
Box Models

Genetic programming (GP) is a powerful machine learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in the field of remote sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs feature construction by evolving hyperfeatures from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyperfeatures from satellite bands to improve the classification of land cover types. We add the evolved hyperfeatures to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (decision trees, random forests, and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyperfeatures to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI, and NBR. We also compare the performance of the M3GP hyperfeatures in the binary classification problems with those created by other feature construction methods such as FFX and EFS.

SateLoc: A Virtual Fingerprinting Approach to Outdoor LoRa Localization Using Satellite Images

2021 ◽  
Vol 17 (4) ◽  
pp. 1-28
Author(s):  
Yuxiang Lin ◽  
Wei Dong ◽  
Yi Gao ◽  
Tao Gu
Keyword(s):  
Land Cover ◽  
Large Scale ◽  
Satellite Images ◽  
Low Cost ◽  
Tracking Error ◽  
Location Based Services ◽  
Distance Constraint ◽  
Combination Strategy ◽  
Land Cover Types ◽  
High Resolution Satellite Images

With the increasing relevance of the Internet of Things and large-scale location-based services, LoRa localization has been attractive due to its low-cost, low-power, and long-range properties. However, existing localization approaches based on received signal strength indicators are either easily affected by signal fading of different land-cover types or labor intensive. In this work, we propose SateLoc, a LoRa localization system that utilizes satellite images to generate virtual fingerprints. Specifically, SateLoc first uses high-resolution satellite images to identify land-cover types. With the path loss parameters of each land-cover type, SateLoc can automatically generate a virtual fingerprinting map for each gateway. We then propose a novel multi-gateway combination strategy, which is weighted by the environmental interference of each gateway, to produce a joint likelihood distribution for localization and tracking. We implement SateLoc with commercial LoRa devices without any hardware modification, and evaluate its performance in a 227,500-m urban area. Experimental results show that SateLoc achieves a median localization error of 43.5 m, improving more than 50% compared to state-of-the-art model-based approaches. Moreover, SateLoc can achieve a median tracking error of 37.9 m with the distance constraint of adjacent estimated locations. More importantly, compared to fingerprinting-based approaches, SateLoc does not require the labor-intensive fingerprint acquisition process.

scholarly journals Accelerate disaster risk mapping using an automated zonal change detection model for loss estimation and recovery: a flood case study

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
Ali Amasha
Keyword(s):  
Change Detection ◽  
Satellite Images ◽  
Flash Flood ◽  
Disaster Risk ◽  
Loss Estimation ◽  
Risk Mapping ◽  
Detection Model ◽  
Applied Model ◽  
High Resolution Satellite Images ◽  
Before And After

Abstract Background The flash flood still constitutes one of the major natural meteorological disasters harmfully threatening local communities, that creates life losses and destroying infrastructures. The severity and magnitude of disasters always reflected from the size of impacts. Most of the conventional research models related to flooding vulnerability are focusing on hydro-meteorological and morphometric measurements. It, however, requires quick estimate of the flood losses and assess the severity using reliable information. An automated zonal change detection model applied, using two high-resolution satellite images dated 2009 and 2011 coupled with LU/LC GIS layer, on western El-Arish City, downstream of Wadi El-Arish basin. The model enabled to estimate the severity of a past flood incident in 2010. Results The model calculated the total changes based on the before and after satellite images based on pixel-by-pixel comparison. The estimated direct-damages nearly 32,951 m2 of the total mapped LU/LC classes; (e.g., 11,407 m2 as 3.17% of the cultivated lands; 6031 m2 as 7.22% of the built-up areas and 4040 m2 as 3.62% of the paved roads network). The estimated cost of losses, in 2010 economic prices for the selected three LU/LC classes, is nearly 25 million USD, for the cultivation fruits and olives trees, ~ 4 million USD for built-up areas and ~ 1 million USD for paved roads network. Conclusion The disasters’ damage and loss estimation process takes many detailed data, longtime, and costed as well. The applied model accelerates the disaster risk mapping that provides an informative support for loss estimation. Therefore, decision-makers and professionals need to apply this model for quick the disaster risks management and recovery.

Sign in / Sign up

Export Citation Format

Share Document