Related papers: Predicting Optimal Lengths of Random Knots
Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
In the past decade, the use of ordinal patterns in the analysis of time series and dynamical systems has become an important and rich tool. Ordinal patterns (otherwise known as a permutation patterns) are found in time series by taking $n$…
Consider the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter $p$ and finite time horizon $n$. Allaart \cite{Allaart} proved that the optimal strategy…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
The interplay of topological constraints and Coulomb interactions in static and dynamic properties of charged polymers is investigated by numerical simulations and scaling arguments. In the absence of screening, the long-range interaction…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We determine the most probable length of paths at finite temperatures, with a preassigned end-to-end distance and a unit of energy assigned to every step on a $D$-dimensional hypercubic lattice. The asymptotic form of the most probable…
In a model of communication in a social network described by a simple consensus model, we pose the problem of finding a subset of nodes with given cardinality and fixed consensus values that enable the fastest convergence rate to…
We propose a version of the follow-the-perturbed-leader online prediction algorithm in which the cumulative losses are perturbed by independent symmetric random walks. The forecaster is shown to achieve an expected regret of the optimal…
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting…
We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…
Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…
A long standing conjecture states that the ropelength of any alternating knot is at least proportional to its crossing number. In this paper we prove that this conjecture is true. That is, there exists a constant $b_0>0$ such that $R(K)\ge…