Related papers: Volumes of Random Alternating Link Diagrams
We study random knots and links in R^3 using the Petaluma model, which is based on the petal projections developed by Adams et al. (2012). In this model we obtain a formula for the distribution of the linking number of a random…
Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present…
We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory. Random tensor networks are simple toy models that help the understanding of the entanglement behavior of a boundary region in the…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
The problem of predicting links in large networks is an important task in a variety of practical applications, including social sciences, biology and computer security. In this paper, statistical techniques for link prediction based on the…
In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…
We apply to bidimensional chaotic maps the numerical method proposed by Ginelli et al. to approximate the associated Oseledets splitting, i.e. the set of linear subspaces spanned by the so called covariant Lyapunov vectors (CLV) and…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
This paper formulates a notion of high-dimensional random dynamical systems that couple to another system, like an embedding environment, in such a way that each system engages in controlled exchange with the other system. Using the…
In this review, a model (the Random Coupling Model) that gives a statistical description of the coupling of radiation into and out of large enclosures through localized and/or distributed channels is presented. The Random Coupling Model…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
Many random flows, including 2D unsteady and stagnation-free 3D steady flows, exhibit non-trivial braiding of pathlines as they evolve in time or space. We show that these random flows belong to a pathline braiding \emph{universality class}…
We consider links that are alternating on surfaces embedded in a compact 3-manifold. We show that under mild restrictions, the complement of the link decomposes into simpler pieces, generalising the polyhedral decomposition of alternating…
Link prediction is a paradigmatic problem in network science with a variety of applications. In latent space network models this problem boils down to ranking pairs of nodes in the order of increasing latent distances between them. The…
Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular,…
R.M. Kashaev conjectured that the asymptotic behavior of his link invariant, which equals the colored Jones polynomial evaluated at a root of unity, determines the hyperbolic volume of any hyperbolic link complement. We observe numerically…
The altenating knots, links and twists projected on the S_2 sphere are identified with the phase Space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossing points, the edges, to the…
The prediction of both the existence and weight of network links at future time points is essential as complex networks evolve over time. Traditional methods, such as vector autoregression and factor models, have been applied to small,…
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…
Linking numbers in higher dimensions and their generalization including gauge fields are studied in the context of BF theories. The linking numbers associated to $n$-manifolds with smooth flows generated by divergence-free p-vector fields,…