1.7k citations
- Technische Universität DresdenDE86 papers
- Max Planck Institute for the Physics of Complex SystemsDE66 papers
- Max Planck Institute of Molecular Cell Biology and GeneticsDE64 papers
- Physics of LifeDE46 papers
- Centre National de la Recherche ScientifiqueFR16 papers
- Sorbonne UniversitéFR11 papers
- Université Paris Sciences et LettresFR9 papers
- Biotechnologisches ZentrumDE8 papers
- Dresden Center for Computational Materials ScienceDE7 papers
- Institut CurieFR7 papers
- Physique des Cellules et CancersFR7 papers
- Princeton UniversityUS7 papers
8 papers · 1 filter
Event-based spatiotemporal networks for modelling emergent phenomena in complex systems
Matthijs Romeijnders, Michiel van Boven, Francesco Corman +3
Complex systems display emergent phenomena that vary significantly across spatial and temporal scales. These variations originate from fine-grained system processes, yet arriving a…
IGraph/M: graph theory and network analysis for Mathematica
Szabolcs Horvát, Jakub Podkalicki, Gábor Csárdi +4
IGraph/M is an efficient general purpose graph theory and network analysis package for Mathematica. IGraph/M serves as the Wolfram Language interfaces to the igraph C library, and…
Connectedness matters: Construction and exact random sampling of connected graphs
Szabolcs Horvát, Carl D. Modes
We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs…
Modular gateway-ness connectivity and structural core organization in maritime network science
Mengqiao Xu, Qian Pan, Alessandro Muscoloni +2
Around 80% of global trade by volume is transported by sea, and thus the maritime transportation system is fundamental to the world economy. To better exploit new international shi…
Navigability evaluation of complex networks by greedy routing efficiency
Alessandro Muscoloni, Carlo Vittorio Cannistraci
Network navigability is a key feature of complex networked systems. For a network embedded in a geometrical space, maximization of greedy routing (GR) measures based on the node ge…
Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space
Alessandro Muscoloni, Carlo Vittorio Cannistraci
The idea of minimum curvilinearity (MC) is that the hidden geometry of complex networks, in particular when they are sufficiently sparse, clustered, small-world and heterogeneous,…