Related papers: Linking number of grid models
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.
The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…
Networks are widely used to model the interaction between individual dynamical systems. In many instances, the total number of units as well as the interaction coupling are not fixed in time, but rather constantly evolve. In terms of…
We investigate the growth of connectivity in a network. In our model, starting with a set of disjoint nodes, links are added sequentially. Each link connects two nodes, and the connection rate governing this random process is proportional…
We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${\mathbb{R}}^d$. The connectivity function is shown to decay superexponentially, and we…
Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
We investigate the limiting behaviour of the path of random bridges treated as random sets in $\mathbb{R}^{d}$ with the Euclidean metric and the dimension $d$ increasing to infinity. The main result states that, in the square integrable…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…
The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. We study the higher-order connectivity of such a network by investigating the topological…
Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs…
In this paper, we propose a network whose nodes are labeled by the composite numbers and two nodes are connected by an undirected link if they are relatively prime to each other. As the size of the network increases, the network will be…
We study the evolution of a random graph under the constraint that the diameter remain constant as the graph grows. We show that if the graph maintains the form of its link distribution it must be scale-free with exponent between 2 and 3.…
Recently it was shown (I.A.Gruzberg, A. Kl\"umper, W. Nuding and A. Sedrakyan, Phys.Rev.B 95, 125414 (2017)) that taking into account random positions of scattering nodes in the network model with $U(1)$ phase disorder yields a localization…