• Corpus ID: 55194194

Structure of Business Firm Networks and Scale-Free Models

  title={Structure of Business Firm Networks and Scale-Free Models},
  author={Maksim Kitsak and Massimo Riccaboni and Shlomo Havlin and Fabio Pammolli and Harry Eugene Stanley},
  journal={arXiv: Physics and Society},
We study the structure of business firm networks in the Life Sciences (LS) and the Information and Communication Technology (ICT) sectors. We analyze business firm networks and scale-free models with degree distribution P(q) proportional to (q + c)^-λ using the method of k-shell decomposition. We find that the LS network consists of three components: a "nucleus", which is a small well connected subgraph, "tendrils", which are small subgraphs consisting of small degree nodes connected… 
1 Citations

Figures from this paper

Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics
The novel concept of ModuLand is introduced, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases.


Evolution of networks
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
The structure and dynamics of networks
  • M. Newman
  • Computer Science
    Princeton studies in complexity
  • 2006
The degree distribution, twopoint correlations, and clustering are the studied topological properties and an evolution of networks is studied to shed light on the influence the dynamics has on the network topology.
Social Network Analysis
This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued
Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős
Preface (B. Bollobas). Paul Erdos at Seventy-Five (B. Bollobas). Packing Smaller Graphs into a Graph (J. Akiyama, F. Nakada, S. Tokunaga). The Star Arboricity of Graphs (I. Algor, N. Alon). Graphs
Introduction to percolation theory
Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in
In Palfreyman & Tapper (2014) ‘Reshaping the University: The Rise of the Regulated Market in Higher Education’ (Oxford University Press) we have tried to explain how English HE has reached the
Graph theory and combinatorics
Working papers on Trust-based Recommendation Systems: An axiomatic Approach, submitted to WWW and on Learning submodular functions, to be submitted to ICALP.
Fractals and Disordered Systems
1 Fractals and Multifractals: The Interplay of Physics and Geometry (With 30 Figures).- 1.1 Introduction.- 1.2 Nonrandom Fractals.- 1.3 Random Fractals: The Unbiased Random Walk.- 1.4 The Concept of
  • Natl. Acad. Sci. USA 104, 11150
  • 2007
Random Graphs (Cambridge
  • 2001