<!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>Firm Business Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Chien-Hung Chien</string-name>
          <email>chien-hung.chien@anu.edu.au</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Armin Haller</string-name>
          <email>armin.haller@anu.edu.au</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anton H. Westveld</string-name>
          <email>anton.westveld@anu.edu.au</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Australian National University</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes an ontology-based approach to integrate datasets from Intellectual Property Australia and the Australian Securities Exchange to study rms in business networks. We combine di erent indicator variables with SPARQL queries for research to understand the characteristics of di erent rms in multiple business networks. We use an exponential random graph models approach to describe factors that help rms form business networks. In doing so we nd evidence of homophily for large rms in patents and trademarks business networks. They are more likely to form business networks in comparison with small &amp; medium rms. For rms in patents and shared director and trademarks and directors business networks, rm size does not play an important factor in the formation of business networks and there is limited evidence of homophily.</p>
      </abstract>
      <kwd-group>
        <kwd>semantic web</kwd>
        <kwd>business networks</kwd>
        <kwd>exponential random graph model</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        At a time when governments face budgets constraints, it is important for them
and their statistical agencies to make better use of available resources.
Governments around the world have realised the advantages of integrating their datasets
to use them for purposes beyond which they were collected for. The Australian
Government's open data agenda aims to integrate multiple data sources and
provide information to encourage evidence-based policy development [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The 2017
Productivity Commission inquiry into Data Availability and Use highlighted the
need to create integrated and linked national interest datasets to inform policy
development [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        The need to integrate a large number of datasets from multiple sources has
created a big data challenge for statistical o ces, including the Australian
Bureau of Statistics (ABS). The statistical challenges associated with creating and
analysing data from diverse sources has been discussed extensively in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. A
recent paper by [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] has presented several ABS case studies on using semantic
web technologies to visualise and analyse integrated datasets. This preliminary
research builds on [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Using open and purchased data sources, we focus on
combining semantic web and statistical methods to develop a better understanding
of rms in multiple business networks.
      </p>
      <p>
        Firms seek partners with complementary assets to leverage each other's
strengths and nd competitive advantages to ensure market success. Business
networks play a vital role in nding new market opportunities and obtaining the
necessary resources to achieve growth [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. There are di erent types of business
networks ranging from more structured (business groups or franchising) to less
structured (R&amp;D consortium, trade association and shared directors). These
business networks facilitate di erent degrees of knowledge transfer and create
social capital to enhance business performance [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>Business networks play a particularly important role in ensuring the economic
success of small rms. Firms in business networks have mutual dependence to
ensure each other's success. Business networks can also help better resource
allocation and reduce operational risks through cooperative arrangements. This
is particularly important in sectors with fast technological advancement and
short product life cycle. This is evident by the success of high-tech start-ups
in Taiwan, where business networks play an important role in integrating the
operation of a large number of specialised small rms in subcontracting and
outsourcing industries [8, p.2-4].</p>
      <p>
        There is empirical evidence to support rm R&amp;D collaboration as an
important source of innovation to improve rm performance [
        <xref ref-type="bibr" rid="ref10 ref9">9,10</xref>
        ]. R&amp;D
collaboration enables knowledge transfer between rms to share new managerial ideas
and technology. Firms look for di erent competitive advantages in the
market through business networks [
        <xref ref-type="bibr" rid="ref11 ref12">11,12</xref>
        ]. Firms can also form business networks
through shared directors. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] argued that boards of directors can enhance rm
performance through e ectively monitoring and providing resources. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] also
found that directors serve as an important asset to form business networks,
particularly for young high-tech rms.
      </p>
      <p>
        Governments use a range of initiatives to encourage business networks to
achieve economic growth. The Australian Government, through the Department
of Industry, Innovation and Science, actively supports rm collaboration. It has
established Cooperative Research Centres to encourage collaborative research
partnerships between research institutes and industry partners [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Another
example is Innovation Connections which provides funding to support collaborative
projects between small and medium sized rms to nd expert technology advice
and collaborate with research centres in developing new ideas with commercial
potential [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>It is useful for policy makers to have an understanding of the factors that
could lead to the formation of business networks. Are the factors contributing
to rms forming business networks di erent when we compare rms in multiple
business networks? Are rms with similar characteristics more likely to form
business networks? What kind of impact did the global nancial crisis (GFC)
have on rms in multiple business networks? This study uses open data and
purchased data to address these questions.</p>
    </sec>
    <sec id="sec-2">
      <title>Semantic web</title>
      <p>We use an ontology-based data model to integrate three datasets - patents,
trademarks, and publicly listed companies - to answer our research questions.
The patents and trademarks datasets are from 2017 Intellectual Property
Government Open Data (IPGOD). The publicly listed companies on shared directors
from the Australian Securities Exchange (ASX) is purchased from MorningStar
DatAnalysis Premium. Examples of data visualisation can be found in Appendix
B.</p>
      <p>The semantic web approach is well suited to integrate data from multiple
sources and to extract information on rms in multiple business networks. We
assign a unique Uniform Resource Identi er (URI) for each rm using a unique
rm identi er e.g. Australian Business Numbers (ABNs) or Australian
Company Numbers (ACNs). We attach di erent rm attributes e.g. Industry, Pro t
and Loss etc. from di erent data sources to each rm. Our datasets include
Australian rms in three di erent types of business network relationships: rms that
collaborate in R&amp;D related activities (patents networks), rms that collaborate
for commercial interests (trademarks networks) and rms that share directors
(shared directors networks). We are comparing rms belonging to multiple
networks i.e. patents and shared directors networks, patents and trademarks
networks and trademarks and shared directors networks. In addition, we separate
our sample into three periods: before the global nancial crisis (GFC) from 2003
to 2006, during the GFC from 2007 to 2009 and after the GFC from 2010 to
2013 in our sample.</p>
      <p>For our analysis, it is important to know the data provenance to correctly
compare rms with and without multiple business networks. We use named
graphs in the knowledge graph to distinguish di erent data sources. These named
graphs are then used in the SPARQL queries to retrieve the correct subgraph.
Figure 1 shows the ontology for our data model. We use Ontodia - an OWL and
RDF diagramming tool to visualise our data model. For example, f irm alpha
is connected to f irm beta within a patent business network, while it is also
connected with f irm gamma in a trademark business network. In comparison,
f irm beta is in a patent business network with f irm alpaha and shares a
director with f irm delta.</p>
      <p>We have 518; 870 triples of rms in the patent named graph http://patents,
5; 638; 915 triples of rms in the trademark named graph http://trademarks
and 272; 289 triples in directors named graph http://directors with a total of
6; 430; 074 triples in the integrated knowledge graph. We use legal entities to
represent rms. The IPGOD and ASX datasets contain unique rm identi cation
numbers (ABNs or ACNs) for rms. We use patent and trademark applications
(application number), and directors (director id) to identify rms in di erent
business networks. We use unique ABNs and ACNs to form the URI for the
legal entities. These URIs serve as unique linking keys to correctly retrieve rm
information from di erent sources using SPARQL queries. The bottom right
panel of Figure 1 shows the basic business network relationships. The
Business Network node quali es how rms can be connected through joint patent
or trademark applications or shared directors. An example below shows how
we construct a SPARQL query to retrieve rms belonging to both patent and
trademark networks in the period before the GFC from 2003 to 2006.</p>
      <p>Listing 1.1: intersection SPARQL query
prefix pat : &lt;http :// patents &gt;
prefix tmk : &lt;http :// trademarks &gt;
SELECT ? ABN
FROM NAMED pat :
FROM NAMED tmk :
WHERE {
values (? BN) {(" 2003 _BN ") (" 2004 _BN ") (" 2005 _BN ") (" 2006 _BN ")}
{ GRAPH pat :{
? LegalEntity fnet : hasAustralianBusinessNumber ? ABN ;
fnet : hasBusinessNetwork ? businessNetwork .}}
FILTER EXISTS
{ GRAPH tmk : {
? LegalEntity fnet : hasAustralianBusinessNumber ? ABN ;
fnet : hasBusinessNetwork ? businessNetwork .}}}</p>
    </sec>
    <sec id="sec-3">
      <title>3 Data sources</title>
      <p>
        3.1 Intellectual Property Government Open Data
Patents and trademarks datasets are from the 2017 Intellectual Property
Government Open Data (IPGOD) for this study. IPGOD contains administrative
information on patents and trademarks [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Patent and trademark applications
can be led by one applicant or multiple applicants. Over the sample period
between 2003 and 2013, there are 329; 809 applicant-patent application
combinations with 290; 568 unique patent applications. In comparison, there are
1; 350; 134 applicant-trademark application combinations with 639; 958 unique
trademark applications. Counting unique ABNs and unique ACNs, 15; 617 rms
led patent applications and 152; 539 rms led trademark applications over the
sample period between 2003 and 2013.
      </p>
      <p>
        We do not observe whether rms are in business networks or not. However,
we observe if a rm les a patent or trademark application by itself or with
another rm(s) in IPGOD. Therefore, we de ne a rm as being in a business
network in year t when it shares a patent and/or a trademark application with
at least one other rm. We create indicator variables equal to one if a rm
has a patent and/or trademark application with at lease one other applicant
type (small &amp; medium or large enterprises) in year t. The indicator takes zero
value if a rm les an application by itself. One would support that the business
networks that generate joint patent and/or trademark applications could have
existed before year t and could have lasted beyond year t. Consider one scenario,
rm A, which had a joint application with rm B in 2003. The last available
observation for rm A is in 2005. The network indicator will show rm A was in
a business network from 2003 to 2005. We have made this assumption because
the duration of a standard patent is 25 years and 10 years for a trademark right
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ][
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
3.2
      </p>
      <sec id="sec-3-1">
        <title>Purchased publicly listed company data</title>
        <p>The data on publicly listed companies and their directors is purchased from
MorningStar DatAnalysis Premium data service. This service contains detailed
reports for all current and formerly listed companies on the Australian
Securities Exchange (ASX). There are 1; 722 listed companies and 9; 892 directors
in the sample reference period between 2003 and 2013. We use the following
data items in our analysis - unique director identi cation number (DirectorID),
ABNs, ACNs, Global Industry Classi cation Standard (GICS) industry sectors,
GICS industry groups, director appointed dates and director resigned dates.</p>
        <p>We create an indicator variable if a rm shares a director with at least one
other rm during the sample period. If a director's appointed date is before
01 01 2003, we use 01 01 2003 as the appointed date. We exclude directors
who resigned before 01 01 2003. The duration of the shared director network
is derived by taking into account the director's earliest appointed and latest
resigned dates. For example, if director 001 worked in rm A between 2003 and
2004 and rm B between 2004 and 2005 then rm A and B are connected in
the director network between 2003 to 2005. There is a higher proportion of rms
with network connections in the ASX data compared to IPGOD.
3.3</p>
      </sec>
      <sec id="sec-3-2">
        <title>Multiple business networks</title>
        <p>The scope of the analysis includes rms in three types of multiple business
networks. They include when a rm les a joint patent and a joint trademark
application with at least one other rm, when a rm les a joint patent
application and shares the same director with at least one other rm, and when a rm
les a joint trademark application and shares the same director with at least one
other rm. Figure 2 compares the proportion of large and small &amp; medium
enterprises in these multiple business networks. The number of business networks
has grown over time in the sample. Overall, there are no signi cant di erences
between the proportion of large and small &amp; medium enterprises over di
erent periods. However, we observe a larger increase in the proportion of small &amp;
medium enterprises in multiple networks when we compare between the before
GFC (2003 to 2006) and during GFC (2007 to 2009) periods.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Statistical model</title>
      <p>
        Our research goal is to describe the factors that contribute to the formation of
business networks. There are many interdependent social processes that drive
the formation of business networks. The formation of business networks can
be in uenced by the presence (or absence) of other ties in the network. The
complexity is shown by the business network formed between Verizon Wireless
and Google in 2009. Verizon Wireless, one of the key wireless
telecommunications providers in the United States, wanted to become less reliant on Apple
and iPhone to deliver its service to high-paying customers [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. This was mainly
because AT&amp;T, one of Verizon Wireless's main competitors, had already
established a closed working relationship with Apple [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. The successful partnership
between Verizon Wireless and Google has led to forming of business networks
with other Android phone manufacturers like Samsung [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
      <p>
        Business networks are inherently relational so the occurrence of a
particular relationship, or tie, could depend on the occurrence of other ties [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. The
above example clearly demonstrates the endogenous network structural e ects.
Firms consider factors beyond simple evaluation of the suitable characteristics
of the perspective partners. The decision by Verizon Wireless involves a
strategic response to compete against AT&amp;T by forming other ties with Google and
Samsung. An observed business network can result from a combination of
simultaneous processes with interdependent endogenous factors [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
      <p>
        We use an exponential random graph models (ERGMs) approach which takes
into account the underlying network structure, characteristics of rms and the
characteristics of the dyad in the inference. ERGMs have two main functions:
(1) to describe if a given network structure, e.g. edge or transitivity observed
in a network, occur more than expected by chance; (2) to determine whether
there is an association between network links and rm characteristics and
between network links and dyad characteristics or both [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Table 1 shows selected
commonly observed business network structures [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ].
      </p>
      <p>Note that the dependency structure is shown when a tie being included in
homophily can also be contained in the transitivity structure .</p>
      <p>
        We build on the work of [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] and [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and use ERGMs to study Australian
business networks. We use formula (2) in Appendix C to de ne ERGMs as
P r(Y = y j ; X) =
where y is the observed business network and it takes value 1 if there is a tie
between rm i and rm j and 0 otherwise. The symbol represents unknown
parameters of interest and determines the e ects of the network statistics. We use
g(y; X) to represent the endogenous network statistics in the model. We follow
[
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and include edges and transitivity structures, common network structures
observed in business network data. We use X to denote exogenous explanatory
variables for the network statistics. There are three rm-speci c characteristics.
The variable P roducts is the number of patents or trademark applicants
registered by a rm. Our measures of homophily are LargeF irm and SM E. The
LargeF irm indicates a tie is formed between two large enterprises. The SM E
indicates a tie between two small &amp; medium enterprises. The reference group is
a tie form between a LargeF irm and a SM E. The dyad-speci c characteristic,
Industry, takes the value one if a network contains at least two rms in the
same industry or zero otherwise. The term k( ) is the normalising constant. A
discussion on the key ERGMs assumption and basic concept can be found in
Appendix C.
We use the R ergm package - The Statnet Project to estimate our models. See [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]
for more details. Some useful references and tutorials can be found in [
        <xref ref-type="bibr" rid="ref30 ref31">30,31</xref>
        ].
Table 2 shows the statistical model results. The results are in log-odds as discussed
in Appendix C. Firms with higher numbers of patent or trademark applications
have a slightly higher probability of forming business network. We have some
evidence of homophily, i.e. rms with similar characteristics are more likely to
form business networks with each other. Table 1 shows that the coe cients for
LargeF irm and SM E are signi cant. The probabilities are generally higher for
LargeF irm (0:92) than SM E rms (0:73) in particular for rms in patent and
trademark business networks in the period before the GFC. We do not observe
homophily for rms in trademark and shared director networks as the coe cients
for both LargeF irm and SM E are insigni cant in the three periods. There is a
mixed result for the same industry indicator variable on rms. Firms operating
in same industries appear to have a higher probability of forming trademark and
shared director business networks than patent and shared director networks. See
model results in Appendix A.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and future direction</title>
      <p>This preliminary analysis has shown the bene ts of using semantic web to
integrate datasets to study rms in business networks. We have found that large
rms are more likely to form business networks when they are in patents and
trademarks business networks. The homophily results are mixed for rms in
patents and shared director and trademarks and shared directors business
networks. Our research could be extended in several areas. One possibility is to
combine the open and purchased datasets with ABS business data to obtain
more rm characteristics, such as better industry classi cations or rm
productivity to improve the statistical models.Another possibility is to compare the
model results with latent class model approach to better understand business
network e ects.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>We gratefully acknowledge Laurent Lefort and Chris Conran, who both provided
technical advice for this paper, and Professor Alan Welsh for his comments on
the paper.</p>
    </sec>
    <sec id="sec-7">
      <title>Appendix A</title>
    </sec>
    <sec id="sec-8">
      <title>Model results</title>
    </sec>
    <sec id="sec-9">
      <title>Appendix B</title>
    </sec>
    <sec id="sec-10">
      <title>Visualisation</title>
      <p>C ir</p>
      <p>S
M a</p>
      <p>r
E g
e
L I
n
d
u
s
t
rm ry
r
o
d
u
c
t
s
t e
r d
i
a g
n e</p>
      <p>s
g
l
e
s
.247979 .221305 .()0408 .1162 .()0406 .0899 .()0270 .0076 .()0026 .0022 .()0279 .0939 .()0715 .4419 andTA teN
S w
12 Semantic web and rm business networks</p>
      <p>N B A</p>
      <p>P
1 1
,2 ,1 (0 1 (0 .20
.303 .917 )321 541 .)031 .731 .)824 .826 .)020 .028 .)234 17 )571 571 andA teN</p>
      <p>S w
4 9 )
6 3</p>
      <p>X o
r D
k
P s ep
A d e</p>
      <p>T u n
(0 .00 (0 .58 (0 11 a irn ed</p>
      <p>n
.0 3 .3 1 .2 .1 n g
0 2 8 1 8 9 d t
9 7 7 1 G v
) ) ) T F ra</p>
      <p>M C i</p>
      <p>a
K 2 b
0 le
0 :
T 7
P
A
X o
r
k
P s
A b
K 2
0
0
T 3
M 2
S
X
P
A
T
S
X
S w
X o</p>
      <p>r
P sk
p
&lt;
0
.
0
5 1 1
;
; 9 9 )
1 3
,892 ,952 .(40 .0 .(10 .00 .(10 .705 .(00 .300 .(10 .818 a
0p&lt; .919 .173 )63 088 )40 88 )54 4 )06 3 )93 2 )317 290 dnA
0 S
.
1 X</p>
      <p>Fig. 4 in Appendix shows the innovation hotspots across Australia. We
combine the available latitude and longitude coordinates information with the
product type information from 2017 Intellectual Property Government Open Data
. Each node represent the location of an applicant. There is missing latitude
and longitude information. However, these rms have postcode information. We
use a combination of information from the Post O ce, Google map api and a
research dataset to impute latitude and longitude information for these rms.
The use of postcode is an improvement than using the capital cities for imputing
missing latitude and longitude information.</p>
      <p>
        The colour of the node represents the product type for patent or trademark
applications. Patent and trademark applications are classi ed using di erent
classi cations. This makes it di cult to compare innovations between patent
and trademark applications. [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] proposed an algorithmic links with
probabilities (ALP) approach, which analyses the text descriptions, to concord
International Patent Classi cation (IPC) for patents and Nice Agreement (NICE)
Classi cations for trademarks. We applied their research and concord trademark
applications to IPC.
A = Human Necessities, B = Performing Operations, Transporting, C =
Chemistry, Metallurgy, D = Textiles and Paper, E = Fixed Constructions, F =
Me110 chanical E1n2g0ineering, G13=0 Physics, H140= Electrici1t5y0. 160
lon
      </p>
    </sec>
    <sec id="sec-11">
      <title>ERGMs assumptions and basic concept</title>
      <p>
        The exponential random graph models (ERGMs) maximise the probability of
the observed networks over the networks with the same number of vertices that
could have been observed to estimate parameters. The approach allows
statistical inference without independence assumptions. This is because the approach
allows for endogenous dependencies coming from the networks. It also contains
a set of network statistics that can include exogenous variables coming from the
characteristics of vertices or edges [
        <xref ref-type="bibr" rid="ref33 ref34">33,34</xref>
        ].
      </p>
      <p>
        We follow [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] and specify the general form for an ERGM as:
      </p>
      <p>P (Y = y) =
where Y is the random variable for the state of the network and y is the
observed networks, g(y; X). We use X to denote the observed rm characteristics.
The symbol represents unknown parameters of interest and determines the
e ects of the network statistics. The symbol k( ) is the normalising constant,
it represents the quantity in the numerator summed over all possible networks
(typically constrained to be all networks with the same number of node set as
y). The formula (2) can be re-expressed in terms of the conditional log-odds of
a single tie between two actors as</p>
      <p>
        logit (Yij = 1 j yi{j) = | (yij);
where Yij is the random variable for the state of the rm pair i,j (with
realisation yij). We use yi{j to denote the complement of yij, i.e. all connections
in the network except yij. The vector (yij) contains the change statistic for
each model term. The change statistic records how g(y; X) term changes when
yij is toggled from 0 to 1 [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]. So
logit hP r(Yij = 1 j yi{j)i = log
(Yij = 1 j yi{j)
(Yij = 0 j yi{j)
= | (yij)
      </p>
      <p>
        This means that the coe cients are interpreted as the log-odds of an
individual tie conditional on all other ties [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]. This is the major departure from the
logit or probit model. The inclusion is necessary because P r(Yij) is dependent
on the dyad-wise outcome of all other dyads [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
(2)
(3)
(4)
(5)
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Turnbull</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Speech to the locate 15 conference: The power of open data (12</article-title>
          <year>2015</year>
          ) accessed at link on 2017-
          <volume>06</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Commission</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , et al.:
          <article-title>Data availability and use</article-title>
          .
          <source>Inquiry Report</source>
          <volume>82</volume>
          (
          <year>2017</year>
          ) accessed at link on 2017-
          <volume>08</volume>
          -11.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Tam</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clarke</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Big data, o cial statistics and some initiatives by the australian bureau of statistics</article-title>
          .
          <source>International Statistical Review</source>
          <volume>83</volume>
          (
          <issue>3</issue>
          ) (
          <year>2015</year>
          )
          <volume>436</volume>
          {
          <fpage>448</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Clarke</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chien</surname>
            ,
            <given-names>C.H.</given-names>
          </string-name>
          :
          <article-title>Visualising big data for o cial statistics: The abs experience</article-title>
          . In:
          <article-title>Data Visualization and Statistical Literacy for Open and Big Data</article-title>
          .
          <source>IGI Global</source>
          (
          <year>2017</year>
          )
          <volume>224</volume>
          {
          <fpage>252</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Clarke</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chien</surname>
            ,
            <given-names>C.H.</given-names>
          </string-name>
          :
          <article-title>Connectedness and Meaning: New Analytical Directions for O cial</article-title>
          .
          <source>In: Proceedings of the 3rd International Workshop on Semantic Statistics</source>
          , Bethlehem,
          <string-name>
            <surname>U.S.</surname>
          </string-name>
          (
          <year>October 2015</year>
          )
          <article-title>page where your paper starts{ends accessed at link on</article-title>
          <year>2018</year>
          -
          <volume>04</volume>
          -01.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennings</surname>
            ,
            <given-names>J.M.:</given-names>
          </string-name>
          <article-title>Internal capabilities, external networks, and performance: A study on technology-based ventures</article-title>
          .
          <source>Strategic Management Journal</source>
          <volume>22</volume>
          (
          <issue>6</issue>
          /7) (
          <year>2001</year>
          )
          <volume>615</volume>
          {
          <fpage>640</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Inkpen</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsang</surname>
            ,
            <given-names>E.W.K.</given-names>
          </string-name>
          :
          <article-title>Social capital, networks, and knowledge transfer</article-title>
          .
          <source>The Academy of Management Review</source>
          <volume>30</volume>
          (
          <issue>1</issue>
          ) (
          <year>2005</year>
          )
          <volume>146</volume>
          {165 accessed at link on 2017-
          <volume>08</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Perry</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knapp</surname>
            ,
            <given-names>A.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piggott</surname>
            ,
            <given-names>V.C.</given-names>
          </string-name>
          :
          <article-title>Small Firms and Network Economies</article-title>
          .
          <source>Routledge</source>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Ahuja</surname>
          </string-name>
          , G.:
          <article-title>Collaboration networks, structural holes, and innovation: A longitudinal study</article-title>
          .
          <source>Administrative Science Quarterly</source>
          <volume>45</volume>
          (
          <issue>3</issue>
          ) (
          <year>2000</year>
          )
          <volume>425</volume>
          {455 accessed at link.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Belderbos</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carree</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lokshin</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Cooperative r&amp;d and rm performance</article-title>
          .
          <source>Research Policy</source>
          <volume>33</volume>
          (
          <issue>10</issue>
          ) (
          <year>2004</year>
          )
          <volume>1477</volume>
          {1492 accessed at link.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Miotti</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sachwald</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Co-operative r&amp;d why and with whom?</article-title>
          <source>Research Policy</source>
          <volume>32</volume>
          (
          <issue>8</issue>
          ) (
          <year>2003</year>
          )
          <volume>1481</volume>
          {1499 accessed at link.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Chuluun</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prevost</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Upadhyay</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Firm network structure and innovation</article-title>
          .
          <source>Journal of Corporate Finance</source>
          <volume>44</volume>
          (
          <year>2017</year>
          )
          <volume>193</volume>
          {214 accessed at link.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Hillman</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dalziel</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Boards of Directors and Firm Performance: Integrating Agency and Resource Dependence Perspectives</article-title>
          .
          <source>The Academy of Management Review</source>
          <volume>28</volume>
          (
          <issue>3</issue>
          ) (
          <year>2003</year>
          )
          <volume>383</volume>
          {
          <fpage>396</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Collins,
          <string-name>
            <given-names>C.J.</given-names>
            ,
            <surname>Clark</surname>
          </string-name>
          , K.D.:
          <article-title>Strategic Human Resource Practices, Top Management Team Social Networks, and Firm Performance: The Role of Human Resource Practices in Creating Organizational Competitive Advantage</article-title>
          .
          <source>The Academy of Management Journal</source>
          <volume>46</volume>
          (
          <issue>6</issue>
          ) (
          <year>2003</year>
          )
          <volume>740</volume>
          {
          <fpage>751</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. Department of Industry, Innovation and Science: Cooperative research centres programme (
          <year>2017</year>
          ) accessed at link on 2018-
          <volume>04</volume>
          -01.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Department of Industry, Innovation and Science: Innovation connections (
          <year>2018</year>
          ) accessed at link on 2018-
          <volume>06</volume>
          -24.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. IP Australia:
          <article-title>Intellectual property government open data 2017 (2017) accessed</article-title>
          at link on 2017-
          <volume>08</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. IP Australia:
          <article-title>Patent basics (</article-title>
          <year>2018</year>
          ) accessed at link on 2018-
          <volume>04</volume>
          -01.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. IP Australia:
          <article-title>Trademark basics (</article-title>
          <year>2018</year>
          ) accessed at link on 2018-
          <volume>05</volume>
          -16.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Svensson</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Verizon, google in android partnership (6 2009) accessed</article-title>
          at link on 2018-
          <volume>12</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Cohan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Project Vogue: Inside Apple's iPhone Deal With</article-title>
          AT&amp;
          <source>T (9</source>
          <year>2013</year>
          ) accessed at link on 2018-
          <volume>12</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Tibken</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Samsung, verizon will partner on 5g smartphone in rst half of 2019 (12 2018) accessed</article-title>
          at link on 2018-
          <volume>12</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Koskinen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daraganova</surname>
          </string-name>
          , G.:
          <article-title>Exponential random graph model fundamentals</article-title>
          . In Lusher, D.,
          <string-name>
            <surname>Koskinen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robins</surname>
          </string-name>
          , G., eds.:
          <article-title>Exponential random graph models for social networks: Theory, methods, and applications</article-title>
          . Cambridge University Press (
          <year>2013</year>
          )
          <volume>49</volume>
          {
          <fpage>76</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Howard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Cox</given-names>
            <surname>Pahnke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Boeker</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.</surname>
          </string-name>
          :
          <article-title>Understanding network formation in strategy research: Exponential random graph models</article-title>
          .
          <source>Strategic management journal 37(1)</source>
          (
          <year>2016</year>
          )
          <volume>22</volume>
          {
          <fpage>44</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Valente</surname>
          </string-name>
          , T.W.:
          <article-title>Social networks and health: Models, methods, and applications</article-title>
          . Volume
          <volume>1</volume>
          . Oxford University Press New York (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Robbins</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Simpli ed account of an exponential random graph model as a statistical model</article-title>
          . In Lusher, D.,
          <string-name>
            <surname>Koskinen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robins</surname>
          </string-name>
          , G., eds.:
          <article-title>Exponential random graph models for social networks: Theory, methods, and applications</article-title>
          . Cambridge University Press (
          <year>2013</year>
          )
          <volume>29</volume>
          {
          <fpage>36</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Desmarais</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cranmer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Statistical mechanics of networks: Estimation and uncertainty</article-title>
          .
          <source>Physica A: Statistical Mechanics and its Applications</source>
          <volume>391</volume>
          (
          <issue>4</issue>
          ) (
          <year>2012</year>
          )
          <year>1865</year>
          {
          <article-title>1876 accessed at link</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Balland</surname>
            ,
            <given-names>P.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belso-Mart nez</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morrison</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The dynamics of technical and business knowledge networks in industrial clusters: Embeddedness, status</article-title>
          , or proximity?
          <source>Economic Geography</source>
          <volume>92</volume>
          (
          <issue>1</issue>
          ) (
          <year>2016</year>
          )
          <volume>35</volume>
          {
          <fpage>60</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Handcock</surname>
            ,
            <given-names>M.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hunter</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Butts</surname>
            ,
            <given-names>C.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodreau</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krivitsky</surname>
            ,
            <given-names>P.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morris</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>: ergm: Fit, Simulate and Diagnose Exponential-Family Models for Networks. The Statnet Project (http://www</article-title>
          .statnet.
          <source>org)</source>
          .
          <source>(2018) R package version 3.9.4.</source>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Hunter</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          :
          <article-title>Curved exponential family models for social networks</article-title>
          .
          <source>Social networks 29(2)</source>
          (
          <year>2007</year>
          )
          <volume>216</volume>
          {
          <fpage>230</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Ergm tutorial</article-title>
          . = http://michaellevy.name/blog/ERGM-tutorial/ (
          <year>2016</year>
          ) Accessed:
          <fpage>22</fpage>
          -
          <lpage>09</lpage>
          -
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Lybbert</surname>
            ,
            <given-names>T.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zolas</surname>
            ,
            <given-names>N.J.:</given-names>
          </string-name>
          <article-title>Getting patents and economic data to speak to each other: an `algorithmic links with probabilities' approach for joint analyses of patenting and economic activity</article-title>
          .
          <source>Research Policy</source>
          <volume>43</volume>
          (
          <issue>3</issue>
          ) (
          <year>2014</year>
          )
          <volume>530</volume>
          {
          <fpage>542</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Cranmer</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Desmarais</surname>
            ,
            <given-names>B.A.</given-names>
          </string-name>
          :
          <article-title>Inferential network analysis with exponential random graph models</article-title>
          .
          <source>Political Analysis</source>
          <volume>19</volume>
          (
          <issue>1</issue>
          ) (
          <year>2011</year>
          )
          <volume>66</volume>
          {
          <fpage>86</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Cranmer</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leifeld</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McClurg</surname>
            ,
            <given-names>S.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rolfe</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Navigating the range of statistical tools for inferential network analysis</article-title>
          .
          <source>American Journal of Political Science</source>
          <volume>61</volume>
          (
          <issue>1</issue>
          ) (
          <year>2017</year>
          )
          <volume>237</volume>
          {
          <fpage>251</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Morris</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Handcock</surname>
            ,
            <given-names>M.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Butts</surname>
            ,
            <given-names>C.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hunter</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodreau</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Moll</surname>
          </string-name>
          , S.B., ,
          <string-name>
            <surname>Krivitsky</surname>
            ,
            <given-names>P.N.</given-names>
          </string-name>
          :
          <article-title>Exponential random graph models (ergms) using statnet tutorial (2016) accessed</article-title>
          at link on 2019-
          <volume>01</volume>
          -03.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Goodreau</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kitts</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morris</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Birds of a feather, or friend of a friend? using exponential random graph models to investigate adolescent social networks</article-title>
          .
          <source>Demography</source>
          <volume>46</volume>
          (
          <issue>1</issue>
          ) (
          <year>2009</year>
          )
          <volume>103</volume>
          {
          <fpage>125</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Martina</surname>
            <given-names>Morris</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steven M. Goodreau</surname>
            ,
            <given-names>S.M.J.:</given-names>
          </string-name>
          <article-title>Network modeling for epidemics (2018) accessed</article-title>
          at link on 2019-
          <volume>01</volume>
          -03.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>