Related papers: Linking number of grid models
Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does…
As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a…
We study statistical properties of the highest degree, or most popular, nodes in growing networks. We show that the number of lead changes increases logarithmically with network size N, independent of the details of the growth mechanism.…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
This paper discusses the enumeration of two-terminal series-parallel networks, i.e. the number of electrical networks built with n identical elements connected in series or parallel with two-terminal nodes. They frequently occur in applied…
In several real-world networks like the Internet, WWW etc., the number of links grow in time in a non-linear fashion. We consider growing networks in which the number of outgoing links is a non-linear function of time but new links between…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
It is known that algebraically split links (links with vanishing pairwise linking number) can be transformed into the trivial link by a series of local moves on the link diagram called delta-moves; we define the delta-unlinking number to be…
Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…
The friendship paradox index is a network summary statistic used to quantify the friendship paradox, which describes the tendency for an individual's friends to have more friends than the individual. In this paper, we utilize Markov's…
We identify the asymptotic probability of a configuration model $\mathrm{CM}_n(\boldsymbol{d})$ to produce a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the modeling strength of differently generated random graph model…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
This paper provides a relationship between a geometric structure of a suspended tree and the number of link components of the associated link diagram.
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We study the random-link matching problem on random regular graphs, alongside with two relaxed versions of the problem, namely the fractional matching and the so-called "loopy" fractional matching. We estimated the asymptotic average…
The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…