Related papers: Smallworldness in Hypergraphs
The analysis of complex and time-evolving interactions like social dynamics represents a current challenge for the science of complex systems. Temporal networks stand as a suitable tool to schematise such systems, encoding all the appearing…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
Small-world (SW) networks have been identified in many different fields. Topological coefficients like the clustering coefficient and the characteristic path length have been used in the past for a qualitative characterization of these…
In a range of scientific coauthorship networks, transitions emerge in degree distributions, correlations between degrees and local clustering coefficients, etc. The existence of those transitions could be regarded as a result of the…
We considered diffusion-driven processes on small-world networks with distance-dependent random links. The study of diffusion on such networks is motivated by transport on randomly folded polymer chains, synchronization problems in…
Human social interactions are typically recorded as time-specific dyadic interactions, and represented as evolving (temporal) networks, where links are activated/deactivated over time. However, individuals can interact in groups of more…
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as "he is a prominent lawyer in Boston" or "she is a Freshman…
Human social interactions in local settings can be experimentally detected by recording the physical proximity and orientation of people. Such interactions, approximating face-to-face communications, can be effectively represented as time…
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as "he is a prominent lawyer in Boston" or "she is a Freshman…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
We investigate two competing contact processes on a set of Watts--Strogatz networks with the clustering coefficient tuned by rewiring. The base for network construction is one-dimensional chain of $N$ sites, where each site $i$ is directly…
Many real-world complex systems such as social, biological, information as well as technological systems results of a decentralized and unplanned evolution which leads to a common structuration. Irrespective of their origin, these so-called…
Higher order interactions are increasingly recognised as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraph as well as simplicial complexes capture the higher-order interactions of complex…
Mobile multi-hop ad hoc networks allow establishing local groups of communicating devices in a self-organizing way. However, in a global setting such networks fail to work properly due to network partitioning. Providing that devices are…
A main goal in the analysis of a complex system is to infer its underlying network structure from time-series observations of its behaviour. The inference process is often done by using bi-variate similarity measures, such as the…
Detecting the dimensionality of graphs is a central topic in machine learning. While the problem has been tackled empirically as well as theoretically, existing methods have several drawbacks. On the one hand, empirical tools are…
Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…
The complexity of many biological, social and technological systems stems from the richness of the interactions among their units. Over the past decades, a great variety of complex systems has been successfully described as networks whose…
Performance of standard processes over large distributed networks typically scales with the size of the network. For example, in planar topologies where nodes communicate with their natural neighbors, the scaling factor is $O(n)$, where $n$…