Self-similar community structure in organisations

Abstract

The formal chart of an organisation is designed to handle routine and easily anticipated problems, but unexpected situations arise which require the formation of new ties so that the corresponding extra tasks can be properly accomplished. The characterisation of the structure of such informal networks behind the formal chart is a key element for successful management. We analyse the complex e-mail network of a real organisation with about 1,700 employees and determine its community structure. Our results reveal the emergence of self-similar properties that suggest that some universal mechanism could be the underlying driving force in the formation and evolution of informal networks in organisations, as happens in other self-organised complex systems.

References in corpus (12)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Community structure in social and biological networks
• Random graphs with arbitrary degree distributions and their applications
• Evolution of networks
• Classes of behavior of small-world networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Hierarchical Organization in Complex Networks
• Scale-free topology of e-mail networks
• Instant Messaging as a Scale-Free Network
• Macro- and micro-structure of trust networks
• The branching structure of diffusion-limited aggregates

Cited by in corpus (288)

• The structure and function of complex networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Community detection in graphs
• Finding community structure in very large networks
• Fast algorithm for detecting community structure in networks
• Functional cartography of complex metabolic networks
• Synchronization in complex networks
• Mixing patterns in networks
• Benchmark graphs for testing community detection algorithms
• Comparing community structure identification
• Defining and identifying communities in networks
• Community detection algorithms: a comparative analysis
• Detecting the overlapping and hierarchical community structure of complex networks
• Quantifying social group evolution
• Community detection in complex networks using Extremal Optimization
• Why social networks are different from other types of networks
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• Structure and dynamics of molecular networks: A novel paradigm of drug discovery. A comprehensive review
• Modularity from Fluctuations in Random Graphs and Complex Networks
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Finding overlapping communities in networks by label propagation
• A Comparative Analysis of Community Detection Algorithms on Artificial Networks
• Extracting the hierarchical organization of complex systems
• Ranking spreaders by decomposing complex networks
• Detecting Network Communities: a new systematic and efficient algorithm
• Identifying influential spreaders in complex networks based on gravity formula
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Modularity-Maximizing Network Communities via Mathematical Programming
• Size reduction of complex networks preserving modularity
• Detecting communities in large networks
• Complex Networks as Hypergraphs
• Information Flow in Social Groups
• Ranking the spreading influence in complex networks
• Absence of influential spreaders in rumor dynamics
• Advanced modularity-specialized label propagation algorithm for detecting communities in networks
• Persistent Homology of Complex Networks
• Network reachability of real-world contact sequences
• Community Detection as an Inference Problem
• The clustering coefficient and community structure of bipartite networks
• Nonparametric Bayesian inference of the microcanonical stochastic block model
• Understanding the spreading power of all nodes in a network: a continuous-time perspective
• Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
• Entropy Rate of Diffusion Processes on Complex Networks
• Identifying the starting point of a spreading process in complex networks
• On Automorphism Groups of Networks
• Robust Reconstruction of Complex Networks from Sparse Data
• On the Origins of Hierarchy in Complex Networks
• A measure of individual role in collective dynamics
• Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
• Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
• Identify influential spreaders in complex networks, the role of neighborhood
• Identifying "communities" within energy landscapes
• Forman curvature for complex networks
• Clustering in complex networks. I. General formalism
• Tuning clustering in random networks with arbitrary degree distributions
• Improved community structure detection using a modified fine tuning strategy
• Maximal-entropy random walks in complex networks with limited information
• Link Prediction with Node Clustering Coefficient
• The evolutionary origins of hierarchy
• Comparative analysis of two discretizations of Ricci curvature for complex networks
• Efficiency of attack strategies on complex model and real-world networks
• Branching Dynamics of Viral Information Spreading
• Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach
• Linking the Network Centrality Measures Closeness and Degree
• Global efficiency of local immunization on complex networks
• Link Prediction via Matrix Completion
• Hypergraph reconstruction from network data
• Self-similar scaling of density in complex real-world networks
• Approximating Spectral Impact of Structural Perturbations in Large Networks
• Multilayer stochastic block models reveal the multilayer structure of complex networks
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Reconstruction methods for networks: the case of economic and financial systems
• Characteristic times of biased random walks on complex networks
• Affinity Paths and Information Diffusion in Social Networks
• Opinion control in complex networks
• Network Community Detection: A Review and Visual Survey
• Removing spurious interactions in complex networks
• Finding missing edges in networks based on their community structure
• M-Centrality: identifying key nodes based on global position and local degree variation
• Diversity of information pathways drives scaling and sparsity in real-world networks
• Leveraging local h-index to identify and rank influential spreaders in networks
• Clustering Drives Assortativity and Community Structure in Ensembles of Networks
• Consistencies and inconsistencies between model selection and link prediction in networks
• The large-scale organization of chemical reaction networks in astrophysics
• Preferential attachment of communities: the same principle, but a higher level
• Qualitative Comparison of Community Detection Algorithms
• Identifying effective multiple spreaders by coloring complex networks
• Emergence of synchronization in multiplex networks of mobile Rössler oscillators
• The networked seceder model: Group formation in social and economic systems
• Multistep greedy algorithm identifies community structure in real-world and computer-generated networks
• Link prediction based on path entropy
• Accuracy and Precision of Methods for Community Identification in Weighted Networks
• Covariance, correlation matrix and the multi-scale community structure of networks
• Enhancing synchronizability of weighted dynamical networks using betweenness centrality
• Markov random walk under constraint for discovering overlapping communities in complex networks
• Universal fractal scaling of self-organized networks
• Enhancing the spectral gap of networks by node removal
• Communication dynamics in finite capacity social networks
• The web of federal crimes in Brazil: topology, weaknesses, and control
• Towards realistic artificial benchmark for community detection algorithms evaluation
• Degree Distribution in Quantum Walks on Complex Networks
• Systematic comparison between methods for the detection of influential spreaders in complex networks
• Optimizing sensors placement in complex networks for localization of hidden signal source: A review
• Gaps in Information Access in Social Networks
• Complex systems approach to natural language
• Systematic evaluation of a new combinatorial curvature for complex networks
• Detecting Communities in Networks by Merging Cliques
• Generalized epidemic process on modular networks
• How Many Nodes are Effectively Accessed in Complex Networks?
• Structural preferential attachment: Network organization beyond the link
• How to become a superhero
• The critical point of k-clique percolation in the Erdos-Renyi graph
• Revealing consensus and dissensus between network partitions
• Synchronization of moving oscillators in three dimensional space
• Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows
• Disentangling homophily, community structure and triadic closure in networks
• Identifying Communities and Key Vertices by Reconstructing Networks from Samples
• Optimizing topological cascade resilience based on the structure of terrorist networks
• Fast and accurate determination of modularity and its effect size
• Characteristic exponents of complex networks
• Poissonian bursts in e-mail correspondence
• Process Flow Diagram of an Ammonia Plant as a Complex Network
• Detecting community structure in networks using edge prediction methods
• Clustering Phase Transitions and Hysteresis: Pitfalls in Constructing Network Ensembles
• Promoting information spreading by using contact memory
• Accuracy Test for Link Prediction in terms of Similarity Index: The Case of WS and BA Models
• Identifying significant edges via neighborhood information
• Traffic-driven SIR epidemic model on networks
• Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach
• Predicting missing links via significant paths
• Genetic Algorithm with a Local Search Strategy for Discovering Communities in Complex Networks
• A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks
• Hierarchical networks of scientific journals
• Sampling motif-constrained ensembles of networks
• Lexical Sorting Centrality to Distinguish Spreading Abilities of Nodes in Complex Networks under the Susceptible-Infectious-Recovered (SIR) Model
• Extracting tag hierarchies
• Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?
• Improving link prediction in complex networks by adaptively exploiting multiple structural features of networks
• Rumor propagation with heterogeneous transmission in social networks
• Dynamics and Processing in Finite Self-Similar Networks
• Persistent homology of unweighted complex networks via discrete Morse theory
• Phase of Ising spins on modular networks analogous to social polarization
• Quantum-Classical Transitions in Complex Networks
• Topological structure and the H-index in complex networks
• Small inter-event times govern epidemic spreading on temporal networks
• Enhancing community detection by local structural information
• Effect of size heterogeneity on community identification in complex networks
• Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks
• Emergence of geometric Turing patterns in complex networks
• Accelerating Growth and Size-dependent Distribution of Human Activities Online
• Scaling in the structure of directory trees in a computer cluster
• Mapping weblog communities
• Finding missing edges and communities in incomplete networks
• Analysis of node2vec random walks on networks
• Graph Compression -- Save Information by Exploiting Redundancy
• Reactive random walkers on complex networks
• Long-term evolution of email networks: Statistical regularities, predictability and stability of social behaviors
• Simulating SIR processes on networks using weighted shortest paths
• Network clustering and community detection using modulus of families of loops
• Complex contagion features without social reinforcement in a model of social information flow
• Power-law relations in random networks with communities
• Learning epidemic threshold in complex networks by Convolutional Neural Network
• Line graphs as social networks
• Same Stats, Different Graphs: Exploring the Space of Graphs in Terms of Graph Properties
• Time evolution of the hierarchical networks between PubMed MeSH terms
• Dynamics in online social networks
• Evolving network structure of academic institutions
• Rethinking $(k,\ell )$-anonymity in social graphs: $(k,\ell )$-adjacency anonymity and $(k,\ell )$-(adjacency) anonymous transformations
• Infection percolation: A dynamic network model of disease spreading
• Uncertainty Reduction for Stochastic Processes on Complex Networks
• On analyzing and evaluating privacy measures for social networks under active attack
• Fuzzy Overlapping Community Quality Metrics
• Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space
• Robustness of community structure to node removal
• Local-ring network automata and the impact of hyperbolic geometry in complex network link-prediction
• Characterization of Subgraphs Relationships and Distribution in Complex Networks
• Detection of core-periphery structure in networks by 3-tuple motifs
• Agent-based simulations of emotion spreading in online social networks
• Community detection based on significance optimization in complex networks
• Ordered community detection in directed networks
• Second-Order Assortative Mixing in Social Networks
• Thermodynamic approach for community discovering within the complex networks: LiveJournal study
• Overlapping modularity at the critical point of k-clique percolation
• Quenched mean-field theory for the majority-vote model on complex networks
• Habituation Effect in Social Networks as a Potential Factor Silently Crushing Influence Maximisation Efforts
• On neighbourhood degree sequences of complex networks
• Heterogeneous message passing for heterogeneous networks
• Nested Subgraphs of Complex Networks
• Micro-bias and macro-performance
• Unfolding network communities by combining defensive and offensive label propagation
• Evolutionary Subnetworks in Complex Systems
• Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks
• Network localization is unalterable by infections in bursts
• Impact of Inter-Country Distances on International Tourism
• Network analysis of online bidding activity
• Robust active attacks on social graphs
• Rank the spreading influence of nodes using dynamic Markov process
• Influence maximization in noisy networks
• Robustness of community structure under edge addition
• A Tractable Fully Bayesian Method for the Stochastic Block Model
• How the online social networks are used: Dialogs-based structure of MySpace
• Simple models for scaling in phylogenetic trees
• Analyzing Trails in Complex Networks
• Multi-level algorithms for modularity clustering
• Inferring propagation paths for sparsely observed perturbations on complex networks
• Coexistence of phases and the observability of random graphs
• Organizational structure and communication networks in a university environment
• DUEF-GA: Data Utility and Privacy Evaluation Framework for Graph Anonymization
• The extensive nature of group quality
• Approximating Orthogonal Matrices with Effective Givens Factorization
• Weighted H-index for identifying influential spreaders
• Characterizing cycle structure in complex networks
• The Community Structure of Econophysicist Collaboration Networks
• Optimization in task--completion networks
• Comparing the hierarchy of keywords in on-line news portals
• Inferring network topology via the propagation process
• Predicting transitions in cooperation levels from network connectivity
• Large deviation theorem for branches of the random binary tree in the Horton-Strahler analysis
• Real-Space Visualization of Quantum Phase Transition by Network Topology
• A shadowing problem in the detection of overlapping communities: lifting the resolution limit through a cascading procedure
• Forman-Ricci curvature and Persistent homology of unweighted complex networks
• Mutual information and the encoding of contingency tables
• EMH: Extended Mixing H-index centrality for identification important users in social networks based on neighborhood diversity
• Efficient network exploration by means of resetting self-avoiding random walkers
• Influence Maximization: Divide and Conquer
• Obtaining Communities with a Fitness Growth Process
• Fingerprint for Network Topologies
• Node Diversification in Complex Networks by Decentralized Coloring
• Spectral properties of the hierarchical product of graphs
• Towards a generalization of information theory for hierarchical partitions
• Emergence of leader-follower hierarchy among players in an on-line experiment
• Adhesion-induced Discontinuous Transitions and Classifying Social Networks
• Analysis of the susceptible-infected-susceptible epidemic dynamics in networks via the non-backtracking matrix
• On weakly optimal partitions in modular networks
• COREATTACK: Breaking Up the Core Structure of Graphs
• A Graph-Neural-Network-Entropy model of vital node identification on network attack and propagation
• Structure and evolution of a European Parliament via a network and correlation analysis
• Temporal-varying failures of nodes in networks
• Balancing Speed and Coverage by Sequential Seeding in Complex Networks
• Systematic comparison of graph embedding methods in practical tasks
• Diffusion dynamics and synchronizability of hierarchical products of networks
• On solving the densest $k$-subgraph problem on large graphs
• D-chain tomography of networks: a new structure spectrum and an application to the SIR process
• Efficient parameter inference in networked dynamical systems via steady states: A surrogate objective function approach integrating mean-field and nonlinear least squares
• A survey on modelling of infectious disease spread and control on social contact networks
• Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms
• Effective vaccination strategy using graph neural network ansatz
• Network growth with preferential attachment and without "rich get richer" mechanism
• Locating influential nodes via dynamics-sensitive centrality
• Navigation by anomalous random walks on complex networks
• Fast Algorithms for Game-Theoretic Centrality Measures
• Reconstructing propagation networks with temporal similarity metrics
• Searchability of central nodes in networks
• Detecting hierarchical and overlapping network communities using locally optimal modularity changes
• Larger holes as narrower degree distributions in complex networks
• The role of susceptible individuals in spreading dynamics
• Partial order similarity based on mutual information
• Incentivized Network Dynamics in Digital Job Recruitment
• On the initial value of PageRank
• Effects of missing data in social networks
• Towards Fast Evaluation of Unsupervised Link Prediction by Random Sampling Unobserved Links
• A novel method based on node correlation to evaluate the important nodes in complex networks
• Simple and Fast Distributed Computation of Betweenness Centrality
• True Nonlinear Dynamics from Incomplete Networks
• Local Articulation Points in Complex Networks
• Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
• On the Estimation and Use of Statistical Modelling in Information Retrieval
• Non-Backtracking Centrality Based Random Walk on Networks
• Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks
• Temporal similarity metrics for latent network reconstruction: The role of time-lag decay
• Community Structure in Interaction Web Service Networks
• On Topological Structure of Web Services Networks for Composition
• Diffusion on dynamic contact networks with indirect transmission links
• On Varying Topology of Complex Networks and Performance Limitations of Community Detection Algorithms
• Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings)
• A study on the performance of similarity indices and its relationship with link prediction: a two-state random network case
• Competitive Dynamics on Complex Networks
• Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics
• Overcoming Tight Constraints in Soft Happy Colouring
• Network Alignment by Discrete Ollivier-Ricci Flow
• Promotion and resignation in employee networks
• Nucleation transitions in polycontextural networks toward consensus
• Interplay between Network Topology and Dynamics in Neural Systems
• Centrality of shortest paths: Algorithms and complexity results
• Comparing the hierarchy of author given tags and repository given tags in a large document archive
• Ranking the spreading influence of nodes in complex networks based on mixing degree centrality and local structure
• The spreading ability of nodes towards localized targets in complex networks