Related papers: A random link via bridge position is hyperbolic
Association models for a pair of random elements $X$ and $Y$ (e.g., vectors) are considered which specify the odds ratio function up to an unknown parameter $\bolds\theta$. These models are shown to be semiparametric in the sense that they…
In this paper we study the relationships between links in plat position, the dynamics of the braid group, and Heegaard splittings of double branched covers of $S^3$ over a link. These relationships offer new ways to view links in plat…
This paper studies the linking numbers of random links within the grid model. The linking number is treated as a random variable on the isotopy classes of 2-component links, with the paper exploring its asymptotic growth as the diagram size…
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…
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…
We suggest a new model for the dynamics of a suspension bridge through a system of nonlinear nonlocal hyperbolic differential equations. The equations are of second and fourth order in space and describe the behavior of the main components…
We show that if $K$ is a nontrivial knot then the proportion of satellites of $K$ among all of the prime non-split links of $n$ or fewer crossings does not converge to $0$ as $n$ approaches infinity. This implies in particular that the…
Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…
A watermelon is a set of $p$ Bernoulli paths starting and ending at the same ordinate, that do not intersect. In this paper, we show the convergence in distribution of two sorts of watermelons (with or without wall condition) to processes…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
Let $F$ be a compact orientable surface with nonempty boundary other than a disk. Let $L$ be a link in $F \times I$ with a connected weakly prime cellular alternating projection to $F$. We provide simple conditions that determine exactly…
We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irreducible. In both cases, we provide a combinatorial…
The volume density of a hyperbolic link is defined as the ratio of hyperbolic volume to crossing number. We study its properties and a closely-related invariant called the determinant density. It is known that the sets of volume densities…
We use the probabilistic method to construct examples of conjectured phenomenon about asymptotic syzygies. In particular, we use the Stanley-Reisner ideals of random flag complexes to construct new examples of Ein and Lazarsfeld's…
This paper provides a generalization of a classical result obtained by Wilks about the asymptotic behavior of the likelihood ratio. The new results deal with the asymptotic behavior of the joint distribution of a vector of likelihood ratios…
We prove that every robustly transitive and every stably ergodic symplectic diffeomorphism on a compact manifold admits a dominated splitting. In fact, these diffeomorphisms are partially hyperbolic.
Our first result gives a partial converse to a well-known theorem of A. Ancona for hyperbolic groups. We prove that a group $G$, equipped with a symmetric probability measure whose finite support generates $G$, is hyperbolic if it is…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
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 consider random walks X_n in Z+, obeying a detailed balance condition, with a weak drift towards the origin when X_n tends to infinity. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional…