Related papers: Linking number of grid models
A disordered medium is often constructed by $N$ points independently and identically distributed in a $d$-dimensional hyperspace. Characteristics related to the statistics of this system is known as the random point problem. As $d \to…
This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially…
This Letter introduces a generalization of known duplication-divergence models for growing random graphs. This general duplication-divergence model includes a new coupled divergence asymmetry rate, which allows to obtain the structure of…
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
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…
This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…
We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…
We describe a model of random links based on random 4-valent maps, which can be sampled due to the work of Schaeffer. We will look at the relationship between the combinatorial information in the diagram and the hyperbolic volume.…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth, as a function of time. We consider both uniform attachment, where incoming nodes form links to existing nodes…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
The winding number is the topological invariant that classifies chiral symmetric Hamiltonians with one-dimensional parametric dependence. In this work we complete our study of the winding number statistics in a random matrix model belonging…