<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network ⇤</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Klaus Wehmuth</string-name>
          <email>klaus@lncc.br</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bernardo B. A. Costa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jo a˜o Victor M. Bechara</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Artur Ziviani</string-name>
          <email>ziviani@lncc.br</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Laboratory for Scientific Computing (LNCC) Av. Getu ́ lio Vargas</institution>
          ,
          <addr-line>333, Quitandinha - CEP 25651-075 - Petr o ́polis, RJ -</addr-line>
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>57</fpage>
      <lpage>64</lpage>
      <abstract>
        <p>This paper provides a multilayer and time-varying structural analysis of one air transportation network, having the Brazilian air transportation network as a case study. Using a single mathematical object called MultiAspect Graph (MAG) for this analysis, the multi-layer perspective enables the unveiling of the particular strategies of each airline to both establish and adapt in a moment of crisis its specific flight network.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>2.1. MAG
In this section, we describe the methods and tools that we use in the model construction
as well as to obtain the results presented in this article.</p>
      <p>
        MultiAspect Graph (MAG) [
        <xref ref-type="bibr" rid="ref7">Wehmuth et al. 2016</xref>
        ] is a graph generalization that can
represent high-order networks, such as multi-layer, time-varying, or time-varying multi-layer
complex networks, and so on. In this context, an aspect is an independent feature of the
complex networked system to be modeled, such as localities, layers, and time instants.
One of the key characteristics of a MAG is to be isomorphic to a directed graph and a
companion tuple [
        <xref ref-type="bibr" rid="ref8">Wehmuth et al. 2017</xref>
        ]. In this way, with a MAG, it is possible to apply
the already available knowledge from graph theory for analyzing directed graphs directly
into the MAG environment.
      </p>
      <p>In this work, we model the Brazilian air transportation network as a network
composed of localities (airports), layers (corresponding to the individual air transportation
network of each airline company), and time instants. However, the results obtained are
expressed only regarding locations (airports) and their links (routes). The achieved results
take into account the time and layer structure of the model to respect the time sequence
of available flights as well as the operating boundaries between different airlines.
2.2. K-Core
In our analysis, we use the K-Core algorithm [Seidman 1983] to identify the network core.
The K-Core of a network is obtained through a continuous decomposition of the network
that removes all vertices with connectivity lower than the value of k and their respective
connections. For example, eliminating all vertices of degree 1, the result is a core with
vertices with at least degree 2. The resulting graph in this case is the 2-core. Increasing
the value of k, the final round of the algorithm happens when it is impossible to eliminate
more vertices, in other words, the network with (k+1)-core is empty. In other words, in
this case, the maximum K-Core is achieved. Note that for two cores to be considered
equal they must be composed of the same vertices and edges, i.e., they must have the
vertices linked by the same topological structure.</p>
      <p>By adopting the K-Core algorithm to analyze the air transportation network, the
intent in this paper is to focus on a structural analysis of the most relevant vertices of
the Brazilian air transportation network (i.e., those that compose the core of the network)
under different perspectives as discussed in Section 3.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <p>This section presents the adopted datasets corresponding to the Brazilian air transportation
network in two different periods of time and the structural analysis of this network taking
into account different viewpoints, such as time-varying and multilayer perspectives.</p>
    </sec>
    <sec id="sec-4">
      <title>3.1. Model construction</title>
      <p>
        To represent the Brazilian domestic air transportation network, we use two flight
schedules: one from June 3, 2015, and the other from May 13, 2016, both published by the
National Civil Aviation Agency (ANAC) on its website. These schedule tables contain
information about domestic, international, postal, and cargo flights covering a period of
one week. We extract from these tables the information about domestic commercial
passenger flights, the target of this paper, on both periods
        <xref ref-type="bibr" rid="ref5">(2015 and 2016)</xref>
        , separated by
approximately 11 months.
      </p>
      <p>The MAG-based model proposed in this paper to analyze the Brazilian air
transportation network has four aspects: airports, airlines, flight time instants, and the time
period of the dataset. The first aspect contains all airports in Brazil that had at least one
flight registered in the week each dataset refers to. There are 110 and 109 airports in
the 2015 and in the 2016 dataset, respectively. The second aspect contains all the
airline companies. In the 2015 dataset, there are seven airlines (Azul, Avianca, Gol, Map,
Passaredo, Tam, and Sete). In the 2016 dataset, there are eight airlines (Azul, Avianca,
Gol, Map, Passaredo, Tam, and Sete). We focus our structural analysis on the four largest
airline companies, namely Gol, TAM, Azul, and Avianca, as they together concentrate
more than 90% of the routes between airports and 95% of the flights that use these routes
in the Brazilian domestic air transportation network.</p>
      <p>To ease the modeling, we create two layers for each airline: The first layer
represents the actual flights and the second layer represents the possible connections between
flights, resulting in fourteen layers for the first dataset and in sixteen layers for the second
one. In the third aspect, there is information about all the flight times, in minutes, in a
week. The forth aspect identifies the corresponding time period of the dataset: The value
one is used for the 2015 dataset and the value two for the 2016 dataset.</p>
      <p>(a) July 2015</p>
      <p>(b) May 2016
The severe economic crisis in Brazil in 2016 directly impacted several sectors of the
economy, making them to adapt to the new reality. In this context, civil aviation was no
exception, and there has been an adjustment on the part of the airline companies in their
availability of flights, resulting in a change in the Brazilian domestic air transportation
network from 2015 to 2016 that we start analyzing in this section. Figure 1 shows the full
Brazilian air transportation network for both the 2015 and 2016 datasets, sub-determined
to show only the first MAG aspect, i.e., the locations (airports). In this representation, a
vertex is an airport and an edge is a route between two airports. Table 1 shows the
number of served airports by each airline in the Brazilian air transportation network in 2015
and 2016. There are some slight changes with some airlines serving less airports while
others started serving more airports. imposing changes in the Brazilian air transportation
network. We here analyze not only the changes in the number of served airports, but most
importantly we analyze how these airports are served in terms of routes between them
and also in terms of the number of flights using these routes. In particular, we show that
changes are in general more significant when taking those perspectives into account.</p>
      <p>Table 2 shows a reduction of 15% in the number of routes of the main airlines
in the Brazilian air transportation network between June 2015 and May 2016. The three
largest airlines in the country (Gol, Azul, and TAM) had significant reductions in their
number of routes, specially Gol with a 25% decrease in the number of routes in the time
period. Nevertheless, Avianca increased the number of routes by 6%, showing that it
took advantage of the route reduction made by larger airlines to occupy some niches and
expand. Therefore, the average growth of smaller companies in times of crisis is their
strategy to partially fill the gaps in routes left by larger companies.</p>
      <p>Furthermore, Table 3 shows the difference in the number of flights between June
2015 and May 2016, indicating a 20% decrease in the number of flights. In general, the
changes in the number of flights follow a similar trend as in the change in the number of
routes, but the intensity of the increase or reduction in the number of flights is even larger
in the extreme cases. Considering the number of flights, for instance, Gol had a decrease
of 37%, whereas Avianca had an increase of 13% in their number of flight, suggesting
that the intensity that the airline companies use the route by offering more or less flights
along a week in each route also represents a change in another dimension.</p>
      <p>Additionally, codesharing is regularly used to optimize occupation in flights on
low volume routes. Considering the analyzed datasets, the number of cases of
codesharing went from 923 to 1234 flights per week, an increase of about 33%. This strategy
virtually keeps a declared flight active in a per airline view, but it actually represents a
reduction in the number of real flights on air.</p>
    </sec>
    <sec id="sec-5">
      <title>3.3. Digraph analysis: The route-based perspective</title>
      <p>
        A digraph is a simple directed graph. In our context, a digraph represents the existing
routes between the airports, disregarding how busy each route is (i.e., how many daily
flights compose the route). We first analyze the Brazilian air transportation network with
the digraph format. In contrast to [
        <xref ref-type="bibr" rid="ref3">Couto et al. 2015</xref>
        ], which also uses the digraph
approach, we apply the K-Core methodology to the Brazilian air transportation network.
Moreover, we also apply such a methodology to the flight network of each airline
company, allowing a number of different analyses concerning the structure of the network at
its basic core structure. These properties of the Brazilian air transportation network were
analyzed in two different time periods
        <xref ref-type="bibr" rid="ref5">(2015 and 2016)</xref>
        . The resulting central core of the
flight network of each airline company indicates the key airports for each company, thus
unveiling the strategy of each company in defining its flight network. Therefore, the
obtained information with the K-Core methodology allows the analysis of the concentration
of the activities of each airline, a comparison of the strategies taken by the companies,
and the identification of the hubs of the companies.
      </p>
      <p>First, we analyze the connectivity of the maximum K-Core in the digraph
corresponding to the whole Brazilian air transportation network, thus focusing on the structural
analysis of the basic core of the flight network. Figure 2 shows the geo-referenced K-Core
of the digraph corresponding to the route-based perspective of the complete Brazilian air
transportation network, as indicated by the 2015 and 2016 dataset. The 2015 core network
results from the maximum K-Core with K=18, 17 airports, and 196 routes. Similarly, the
2016 core network results from the maximum K-Core with K=18, 16 airports, and 182
routes. As it could be expected, the south and southeast regions, which present the largest
share in Brazil’s economy, are also the regions that compose the central core of the air
transportation network, with a small trend of even stronger concentration in 2016.</p>
      <p>We now consider the connectivity of the maximum K-Core in the digraph
corresponding to the flight network of each of the four main airline companies in Brazil.
Table 4 shows the maximum core number K as well as the number of airports and routes
in the maximum K-Core of each of the main airline companies, both in June 2015 and
May 2016. The maximum core number K of all airlines remained the same between the
two time periods, although the number of airports and routes in the maximum core of the
main airline companies has been significantly reduced, except for Avianca, which kept
the same core. This indicates that the main airlines have significantly reduced the number
of key airports and routes among them in their core structures, although the same level
of connectivity was kept. The exception here is Avianca that kept the same level on its
structure (the same K-Core size) with only some slight changes in the structure of its core.</p>
    </sec>
    <sec id="sec-6">
      <title>3.4. Multi-digraph analysis: The flight-based perspective</title>
      <p>In this section, we analyze the results obtained from the multi-digraph corresponding to
the flights in the Brazilian air transportation network. Multi-digraph is the oriented graph
that may have multiple (or parallel) edges, i.e., two vertices may be connected by more
than one edge. In other words, a single route between two airports, as seen in the digraph
format in Section 3.3, can be split into multiple flights that use that route. This feature of
the multi-digraph can thus better represent the real usage of a route, since typically many
airport pairs are connected by multiple flights along a single day. The multi-digraph
representation thus allows quantifying how busy a route between an airport pair is.</p>
      <p>Figure 3 shows the geo-referenced K-Core of the Brazilian air transportation
network with a multi-digraph (flight-based) perspective for 2015 and 2016. The trend
towards concentration emerges in Figure 3(b) showing the busiest airports in the country.</p>
      <p>We analyze the connectivity of the maximum K-Core in the multi-digraph
corresponding to flight network of each of the four main airline companies in Brazil. Table 5
shows the maximum core number K as well as the number of airports and flights in the
maximum K-Core of each of the main airline companies, both in June 2015 and May
2016.</p>
    </sec>
    <sec id="sec-7">
      <title>4. Conclusion</title>
      <p>
        This paper provides a structural analysis of the Brazilian air transportation network in two
time periods
        <xref ref-type="bibr" rid="ref5">(June 2015 and May 2016)</xref>
        .A comparative analysis between this two time
periods brings results on how the economic crisis impacted the Brazilian air transportation
network, as it is shown that the main airline companies have reduced the routes they
use between airports and the number of flights that use these routes by 15% and 20%,
respectively, representing a significative contraction of the Brazilian air transportation
network.
      </p>
      <p>
        Moreover, adopting MultiAspect Graphs (MAGs) [
        <xref ref-type="bibr" rid="ref7">Wehmuth et al. 2016</xref>
        ,
        <xref ref-type="bibr" rid="ref8">Wehmuth et al. 2017</xref>
        ] for the modeling enabled a multilayer and time-varying structural
analysis of the Brazilian air transportation network using a single mathematical object,
thus easing the processing and analysis. With such an approach, the multi-layer
perspective enabled the unveiling of the particular strategies of each airline to both establish and
adapt in a moment of crisis their specific flight networks. Similarly, the time-varying
perspective allowed analyses considering different time periods, and thus assessing the
impact of the economic crisis, but also analyzing the different airlines concerning their
routes as well as the flights that use these routes. Altogether, these different perspectives
allowed the analysis of the impact on the Brazilian air transportation network due to
economic restrictions. Therefore, besides the multilayer and time-varying structural analysis
of the Brazilian air transportation network, this paper also acts as a proof-of-concept for
the MAG potential for the modeling and analysis of high-order networks.
      </p>
      <p>
        Future work includes the development and application of new centrality measures
to be applied in MAGs, including time centralities [
        <xref ref-type="bibr" rid="ref2">Costa et al. 2015</xref>
        ], in particular
considering applications for transportation networks.
      </p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgments</title>
      <p>This work was partially supported by CNPq through the grants authors receive(d). In
particular, authors acknowledge the INCT in Data Sciences (CNPq no. 465560/2014-8).
Authors also acknowledge the support of CAPES, FAPERJ, and FAPESP.</p>
      <p>Seidman, S. B. (1983).</p>
      <p>5(3):269–287.</p>
      <p>Network structure and minimum degree. Social Networks,</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Costa</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bechara</surname>
            ,
            <given-names>J. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wehmuth</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Ziviani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>A multilayer and timevarying structural analysis of the Brazilian air transportation network</article-title>
          .
          <source>Technical report</source>
          . Available at http://arxiv.org/abs/1709.03360.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Costa</surname>
            ,
            <given-names>E. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vieira</surname>
            ,
            <given-names>A. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wehmuth</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ziviani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>and da</article-title>
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>A. P. C.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>Time centrality in dynamic complex networks</article-title>
          .
          <source>Advances in Complex Systems</source>
          ,
          <volume>18</volume>
          (
          <year>07n08</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Couto</surname>
            ,
            <given-names>G. S.</given-names>
          </string-name>
          , da
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>A. P. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>L. B.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Benevenuto</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>Structural properties of the brazilian air transportation network</article-title>
          .
          <source>Anais da Academia Brasileira de Cieˆncias</source>
          ,
          <volume>87</volume>
          :
          <fpage>1653</fpage>
          -
          <lpage>1674</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Sternberg</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carvalho</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murta</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soares</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Ogasawara</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>An analysis of Brazilian flight delays based on frequent patterns</article-title>
          .
          <source>Transportation Research Part E: Logistics and Transportation Review</source>
          ,
          <volume>95</volume>
          :
          <fpage>282</fpage>
          -
          <lpage>298</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Tsiotas</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Polyzos</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>Decomposing multilayer transportation networks using complex network analysis: a case study for the Greek aviation network</article-title>
          .
          <source>Journal of Complex Networks</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <fpage>642</fpage>
          -
          <lpage>670</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Verma</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , Ara u´jo,
          <string-name>
            <given-names>N. A. M.</given-names>
            , and
            <surname>Herrmann</surname>
          </string-name>
          ,
          <string-name>
            <surname>H. J.</surname>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>Revealing the structure of the world airline network</article-title>
          .
          <source>Scientific Reports</source>
          ,
          <volume>4</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Wehmuth</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fleury</surname>
            ,
            <given-names>E</given-names>
          </string-name>
          ´., and
          <string-name>
            <surname>Ziviani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>On MultiAspect graphs</article-title>
          .
          <source>Theoretical Computer Science</source>
          ,
          <volume>651</volume>
          :
          <fpage>50</fpage>
          -
          <lpage>61</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Wehmuth</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fleury</surname>
            ,
            <given-names>E</given-names>
          </string-name>
          ´., and
          <string-name>
            <surname>Ziviani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>MultiAspect Graphs: Algebraic Representation and Algorithms</article-title>
          . Algorithms,
          <volume>10</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>Algebraic connectivity maximization of an air transportation network: The flight routes' addition/deletion problem</article-title>
          .
          <source>Transportation Research Part E: Logistics and Transportation Review</source>
          ,
          <volume>61</volume>
          :
          <fpage>13</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>