Related papers: Ants on the highway
We consider an infinite sequence of rooted trees naturally emerging in a number-theoretical context. We advance some ideas on its structure by discussing some elementary properties. Some of those properties are shown to be related to…
We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…
Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
We clarify and generalize the ant on a rubber rope paradox, which is a mathematical puzzle with a solution that appears counterintuitive. In this paper, we show that the ant can still reach the end of the rope even if we consider the step…
We prove that for every $\varepsilon > 0$ there is $c_0$ such that if $G\sim G(n,c/n)$, $c\ge c_0$, then with high probability $G$ can be covered by at most $(1+\varepsilon)\cdot \frac{1}{2}ce^{-c} \cdot n$ vertex disjoint paths, which is…
We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…
We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…
It is experimentally known that virus exhibits stochastic motion in cytoplasm of a living cell in the free form as well as the form being contained in the endosome and the exponent of anomalous diffusion of the virus fluctuates depending on…
Traffic simulations are made more realistic by giving individual drivers intentions, i.e. an idea of where they want to go. One possible implementation of this idea is to give each driver an exact pre-computed path, that is, a sequence of…
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…
Consider a family of random walks $S_n^{(a)}=X_1^{(a)}+\cdots+X_n^{(a)}$ with negative drift $\mathbf E X_1^{(a)}=-a<0$ and finite variance $\mbox{var}(X_1^{(a)})=\sigma^2<\infty$.Let $M^{(a)}=\max_{n\ge 0} S_n^{(a)}$ be the maximums of the…
This paper investigates the number of random edges required to add to an arbitrary dense graph in order to make the resulting graph hamiltonian with high probability. Adding $\Theta(n)$ random edges is both necessary and sufficient to…
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
Based on a martingale theory approach, we present a complete characterization of the asymptotic behaviour of a lazy reinforced random walk (LRRW) which shows three different regimes (diffusive, critical and superdiffusive). This allows us…
This paper investigates a special variant of a pursuit-evasion game called lions and contamination. In a graph where all vertices are initially contaminated, a set of lions traverses the graph, clearing the contamination from every vertex…
We introduce a counting process to model the random occurrence in time of car traffic accidents, taking into account some aspects of the self-excitation typical of this phenomenon. By combining methods from probability and differential…
This paper is concerned with realizing Lattes maps as subdivision maps of finite subdivision rules. The main result is that the Lattes maps in all but finitely many analytic conjugacy classes can be realized as subdivision maps of finite…