Related papers: Nested Subgraphs of Complex Networks

In this paper, we revisit a well-known distributed projected subgradient algorithm which aims to minimize a sum of cost functions with a common set constraint. In contrast to most of existing results, weight matrices of the time-varying…

For integers $n \geq k \geq 1$, the {\em Kneser graph} $K(n, k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\ldots,n\}$, where two $k$-element sets are adjacent in $K(n,k)$ if they are disjoint. We show…

Recent developments in graph theoretic analysis of complex networks have led to deeper understanding of brain networks. Many complex networks show similar macroscopic behaviors despite differences in the microscopic details. Probably two…

A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…

The study of percolation in so-called {\em nested subgraphs} implies a generalization of the concept of percolation since the results are not linked to specific graph process. Here the behavior of such graphs at criticallity is studied for…

It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph…

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…

Graphs have become increasingly popular in modeling structures and interactions in a wide variety of problems during the last decade. Graph-based clustering and semi-supervised classification techniques have shown impressive performance.…

The organisation of a network in a maximal set of nodes having at least $k$ neighbours within the set, known as $k$-core decomposition, has been used for studying various phenomena. It has been shown that nodes in the innermost $k$-shells…

We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be…

Here, we propose a class of scale-free networks $G(t;m)$ with some intriguing properties, which can not be simultaneously held by all the theoretical models with power-law degree distribution in the existing literature, including (i)…

$k$-core percolation is a percolation model which gives a notion of network functionality and has many applications in network science. In analysing the resilience of a network under random damage, an extension of this model is introduced,…

The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets…

Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance…

While representation learning has yielded a great success on many graph learning tasks, there is little understanding behind the structures that are being captured by these embeddings. For example, we wonder if the topological features,…

Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration…

Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…

An edge subset $S$ of a connected graph $G$ is called an anti-Kekul\'{e} set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekul\'{e} set if and only if each spanning tree of $G$ has a…

Let ${\cal G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$. We denote by ${\cal A}_k ({\cal G})$ the set…