相关论文: Multiplicative topological indices: Analytical pro…

Exponential random graph models (ERGMs), also known as p* models, have been utilized extensively in the social science literature to study complex networks and how their global structure depends on underlying structural components. However,…

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…

For a molecular graph, the first multiplicative Zagreb index $\Pi_1$ is equal to the product of the square of the degree of the vertices, while the second multiplicative Zagreb index $\Pi_2$ is equal to the product of the endvertex degree…

We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…

This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…

The study of probabilistic models for the analysis of complex networks represents a flourishing research field. Among the former, Exponential Random Graphs (ERGs) have gained increasing attention over the years. So far, only linear ERGs…

Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $\varphi$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{\varphi(d_u^+,d_v^-)}$,…

Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network models, in which the structure of realized…

We introduce a broad class of multi-hooking networks, wherein multiple copies of a seed are hooked at each step at random locations, and the number of copies follows a predetermined building sequence of numbers. We analyze the degree…

Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…

Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this area has primarily focused on obtaining a representative…

Resting-state functional MRI (rs-fMRI) in functional neuroimaging techniques have improved in brain disorders, dysfunction studies via mapping the topology of the brain connections, i.e. connectopic mapping. Since, there are the slight…

The Erd\H{o}s-R\'enyi random graph is the simplest model for node degree distribution, and it is one of the most widely studied. In this model, pairs of $n$ vertices are selected and connected uniformly at random with probability $p$,…

The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…

We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the…

Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…

With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…