相关论文: The Klee-Minty random edge chain moves with linear…

This paper gives conditions for the rightmost particle in the $n$th generation of a multitype branching random walk to have a speed, in the sense that its location divided by n converges to a constant as n goes to infinity. Furthermore, a…

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

A large (infinitely-dimensional) class of completely integrable (possibly non-autonomous) spin chains is discovered associated to an infinite-dimensional Lie Algebra of infinite rank. The complete set of integrals of motion is constructed…

The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…

Consider a system of Brownian particles on the real line where each pair of particles coalesces at a certain rate according to their intersection local time. Assume that there are infinitely many initial particles in the system. We give a…

Mott variable range hopping is a fundamental mechanism for low-temperature electron conduction in disordered solids in the regime of Anderson localization. In a mean field approximation, it reduces to a random walk (shortly, Mott random…

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…

A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability…

We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…

A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…

We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…

We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of lengths taken in the l_p norm. We show…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We consider the triangle-free process: given an integer n, start by taking a uniformly random ordering of the edges of the complete n-vertex graph K_n. Then, traverse the ordered edges and add each traversed edge to an (initially empty)…

We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…

We describe an exponential Fermi accelerator in a two-dimensional billiard with a moving slit. We have found a mechanism of trapping regions which provides the exponential acceleration for almost all initial conditions with sufficiently…

For a L\'evy process on the real line, we provide complete criteria for the finiteness of exponential moments of the first passage time into the interval $(r,\infty)$, the sojourn time in the interval $(-\infty,r]$, and the last exit time…

We describe a variant of the Bellman-Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and uses this randomized order to process the vertices within each…

Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible transition probabilities are used. More precisely, a mixing time…

We compute the rate of exponential growth of the free inverse monoid of rank $r$ (and hence an upper bound on the corresponding rate for all $r$-generated inverse monoids and semigroups). This turns out to be an algebraic number strictly…