Entrepreneurial ecosystems are wealthy environments in which entrepreneurs, firms, and governments can operate frictionless, contributing to innovation and economic growth. The investigation of the structure of such systems is an open issue. We provide insights on this aspect through the formulation of seven network-based principles associating specific network metrics to distinct structural features of entrepreneurial ecosystems. In this way, we aim to support the measurement of the structural characteristics of an entrepreneurial ecosystem and the design of policy interventions in case of unmet properties. The proposed methodology is applied to an original network built on the relationships occurring on Twitter among 612 noteworthy start-ups from seven different European countries. This is a novel way to conceptualize entrepreneurial ecosystems considering online interactions. Thus, this work represents a first attempt to analyze the structure of entrepreneurial ecosystems considering their network architecture to guide policy-making decisions. Our results suggest a partial ecosystem-like nature of the analyzed network, providing evidence about possible policy recommendations.

This article offers a network perspective on the collaborative effects of technology transfer, providing a research methodology based on the network science paradigm. We argue that such an approach is able to map and describe the set of entities acting in the technology transfer environment and their mutual relationships. We outline how the connections’ patterns shape the organization of the networks by showing the role of the members within the system. By means of a case study of a transnational initiative aiming to support the technology transfer within European countries, we analyse the application of the network science approach, giving evidence of its relative implications.

Innovation networks constitute a valid structure within which to foster members' abilities to interact and cooperate, in order to reduce environmental uncertainty and face the challenges that derive from economic change. Network members take advantage of their participation in the system by creating and extracting value when performing certain deliberate and purposeful activities. Traditionally the interactions between network members are represented in a hierarchical structure with a prominent member performing a leadership role in managing the system. Recently, more complex organizations have emerged in which the power of the decisions is spread among all partners. In this paper, we overcome the single hub model and propose a new organizational framework called “choreography”, which takes into account all network members, extending the roles of coordination and management throughout the entire network. We consider a real inter-organizational innovation network as an eligible case study which supports the choreography model.

We consider the network constraints on the bounds of the assortativity coefficient, which aims to quantify the tendency of nodes with the same attribute values to be connected. The assortativity coefficient can be considered as the Pearson's correlation coefficient of node metadata values across network edges and lies in the interval $[-1,1]$. However, properties of the network, such as degree distribution and the distribution of node metadata values, place constraints upon the attainable values of the assortativity coefficient. This is important as a particular value of assortativity may say as much about the network topology as about how the metadata are distributed over the network—a fact often overlooked in literature where the interpretation tends to focus simply on the propensity of similar nodes to link to each other, without any regard on the constraints posed by the topology. In this paper we quantify the effect that the topology has on the assortativity coefficient in the case of binary node metadata. Specifically, we look at the effect that the degree distribution, or the full topology, and the proportion of each metadata value has on the extremal values of the assortativity coefficient. We provide the means for obtaining bounds on the extremal values of assortativity for different settings and demonstrate that under certain conditions the maximum and minimum values of assortativity are severely limited, which may present issues in interpretation when these bounds are not considered.