相关论文: A random link via bridge position is hyperbolic

We offer an alternative proof, using the Stein-Chen method, of Bollob\'{a}s' theorem concerning the distribution of the extreme degrees of a random graph. Our proof also provides a rate of convergence of the extreme degree to its asymptotic…

We consider a random link, which is defined as the closure of a braid obtained from a random walk on the braid group. For such a random link, the expected value for the number of components was calculated by Jiming Ma. In this paper, we…

The probability that a symmetric random walk in a hyperbolic group reaches a proper power has the same exponential rate of decay as the probability of return to the identity.

A hyperbolic-like group is a subgroup of $\operatorname{Homeo}_+(S^1)$ such that every non-trivial element has exactly two fixed points, one attracting and one repelling. We investigate the ping-pong dynamics of hyperbolic-like groups,…

We determine the asymptotic growth rate of the diameter of the random hyperbolic surfaces constructed by Brooks and Makover. This model consists of a uniform gluing of $2n$ hyperbolic ideal triangles along their sides followed by a…

We discuss asymptotically hyperbolic manifold with a noncompact boundary which is close to a horosphere in a certain sense. The model case is a horoball or the complement of a horoball in standard hyperbolic space. We show some geometric…

We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.

Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…

For the d-dimensional model of a subcritical bond percolation (p<p_c) and a point \vec{a} in Z^d, we prove that a cluster conditioned on connecting points (0,...,0) and n\vec{a} if scaled by 1/(n|vec{a}|) along \vec{a} and by 1/sqrt{n} in…

We prove that the Poisson boundary of a random walk with finite entropy on a non-elementary hyperbolic group can be identified with its hyperbolic boundary, without assuming any moment condition on the measure. We also extend our method to…

In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…

Homoclinic and heteroclinic connections can form cycles and networks in phase space, which organize global phenomena in dynamical systems. On the one hand, stability notions for (omni)cycles give insight into how many initial conditions…

Let $\{X_j\}$ be independent, identically distributed random variables. It is well known that the functional CUSUM statistic and its randomly permuted version both converge weakly to a Brownian bridge if second moments exist. Surprisingly,…

We describe in this paper a crossbridge model in which an attached crossbridge behaves like a linear spring with a variable rest length. We assume in particular that the rest length has a linear force-velocity relation, and that the force…

If the number of lattice sites is odd, a quantum particle hopping on a bipartite lattice with random hopping between the two sublattices only is guaranteed to have an eigenstate at zero energy. We show that the localization length of this…

A theorem of Jorgensen and Thurston implies that the volume of a hyperbolic 3-manifold is bounded below by a linear function of its Heegaard genus. Heegaard surfaces and bridge surfaces often exhibit similar topological behavior; thus it is…

Within network analysis, the analytical maximum entropy framework has been very successful for different tasks as network reconstruction and filtering. In a recent paper, the same framework was used for link-prediction for monopartite…

We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…

We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…

We consider the contact process on the model of hyperbolic random graph, in the regime when the degree distribution obeys a power law with exponent $\chi \in(1,2)$ (so that the degree distribution has finite mean and infinite second…