相关论文: Network Landscape from a Brownian Particle's Persp…

Proximity measures on graphs have a variety of applications in network analysis, including community detection. Previously they have been mainly studied in the context of networks without attributes. If node attributes are taken into…

Random walks can reveal communities or clusters in networks, because they are more likely to stay within a cluster than leave it. Thus, one family of community detection algorithms uses random walks to measure distance between pairs of…

Network science plays an increasingly important role to model complex data in many scientific disciplines. One notable feature of network organization is community structure, which refers to clusters of tightly interconnected nodes. A…

Network data appears in very diverse applications, like biological, social, or sensor networks. Clustering of network nodes into categories or communities has thus become a very common task in machine learning and data mining. Network data…

We explore a simple mathematical model of network computation, based on Markov chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social…

We consider a three dimensional spatial network, where $N$ nodes are randomly distributed within a cube $L\times L\times L$. Each two nodes are connected if their mutual distance does not excess a given cutoff $a$. We analyse numerically…

A number of recent studies have focused on the statistical properties of networked systems such as social networks and the World-Wide Web. Researchers have concentrated particularly on a few properties which seem to be common to many…

Motivated by concerns about diversity in social networks, we consider the following pattern formation problems in rings. Assume $n$ mobile agents are located at the nodes of an $n$-node ring network. Each agent is assigned a colour from the…

While the individual travel implicates the trace of individual mobility decision, group travels signify the possible social relationship behind these traces. Different from online social network, spatial interaction between individuals is a…

The connectivity structure of graphs is typically related to the attributes of the nodes. In social networks for example, the probability of a friendship between two people depends on their attributes, such as their age, address, and…

Community detection is considered as a fundamental task in analyzing social networks. Even though many techniques have been proposed for community detection, most of them are based exclusively on the connectivity structures. However, there…

Redundancy needs more precise characterization as it is a major factor in the evolution and robustness of networks of multivariate interactions. We investigate the complexity of such interactions by inferring a connection transitivity that…

Spreading processes are fundamental to complex networks. Identifying influential spreaders with dual local and global roles presents a crucial yet challenging task. To address this, our study proposes a novel method, the Basic Cycle Ratio…

We study a model of network with clustering and desired node degree. The original purpose of the model was to describe optimal structures of scientific collaboration in the European Union. The model belongs to the family of exponential…

Complex networks can be used to represent and model an ample diversity of abstract and real-world systems and structures. A good deal of the research on these structures has focused on specific topological properties, including node degree,…

Recent genomic and bioinformatic advances have motivated the development of numerous random network models purporting to describe graphs of biological, technological, and sociological origin. The success of a model has been evaluated by how…

In this article we discuss six degrees of separation, which has been proposed by Milgram, from a theoretical point of view. Simply if one has $k$ friends, the number $N$ of indirect friends goes up to $\sim k^d$ in $d$ degrees of…

A model for growing information networks is introduced where nodes receive new links through j-redirection, i.e. the probability for a node to receive a link depends on the number of paths of length j arriving at this node. In detail, when…

A key problem in the study and design of complex systems is the apparent disconnection between the microscopic and the macroscopic. It is not straightforward to identify the local interactions that give rise to an observed global…

The appearance of large geolocated communication datasets has recently increased our understanding of how social networks relate to their physical space. However, many recurrently reported properties, such as the spatial clustering of…