Related papers: Sideways on the highways
The temporal evolution of the entanglement between two qubits evolving by random interactions is studied analytically and numerically. Two different types of randomness are investigated. Firstly we analyze an ensemble of systems with…
We establish a conjecture of Mumford characterizing rationally connected complex projective manifolds in several cases.
A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, depending on the symbol that it reads, it turns to the left…
We consider a mechanical system of three ants on the floor, which move according to two independt rules: Rule A - forces the velocity of any given ant to always point at a neighboring ant, and Rule B - forces the velocity of every ant to be…
We consider a random field, defined on an integer-valued d-dimensional lattice, with covariance function satisfying a condition more general than summability. Such condition appeared in the well-known Newman's conjecture concerning the…
Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.
The goal of this paper is to give a simple proof of Deligne's conjecture (proven by Fujiwara) and to generalize it to the situation appearing in our joint project with David Kazhdan on the global Langlands correspondence over function…
Recently, the first author showed that the giant in random undirected graphs is `almost' local. This means that, under a necessary and sufficient condition, the limiting proportion of vertices in the giant converges in probability to the…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
We observe that the so-called Generalised Equipartition Law for hamiltonian systems is actually valid only under specific hypotheses -- unfortunately omitted in some textbooks -- which limit its applicability when dealing with nonlinear…
We define here a \textit{directed edge reinforced random walk} on a connected locally finite graph. As the name suggests, this walk keeps track of its past, and gives a bias towards directed edges previously crossed proportional to the…
We give conjectures on the "asymptotic" behaviour of the Hilbert series of (quotients by) generic ideals in the exterior algebra, as the number of variables tend to infinity. Our conjectures are supported by extensive computer calculations.
We revisit the diffusion properties and the mean drift induced by an external field of a random walk process in a class of branched structures, as the comb lattice and the linear chains of plaquettes. A simple treatment based on scaling…
We prove that, after suitable rescaling, the simple random walk on the trace of a large critical branching random walk converges to the Brownian motion on the integrated super-Brownian excursion.
In [1], Theorem 3, the authors proved, in one dimension, a generalization of the Hopf Lemma, and the question arose if it could be extended to higher dimensions. In this paper we present two conjectures as possible extensions, and give a…
The elephant random walk (ERW) is a microscopic, one-dimensional, discrete-time, non-Markovian random walk, which can lead to anomalous diffusion due to memory effects. In this study, I propose a multi-dimensional generalization in which…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…
We develop a general theory of random walks on hypergraphs which includes, as special cases, the different models that are found in literature. In particular, we introduce and analyze general random walk Laplacians for hypergraphs, and we…
We determine asymptotically the two extremal constructions for the tiling problem of the $H$-shaped tree. In particular, the first extremal construction is close to the complement of two cliques, in contrast to previously studied bipartite…