Related papers: Mixing time trichotomy in regenerating dynamic dig…
We consider tilings of a closed region of the Kagome lattice (partition of the plane into regular hexagons and equilateral triangles such that each edge is shared by one triangle and one hexagon). We are interested in the rate of…
We consider the time dependent probability distribution of a coarse grained observable Y whose evolution is governed by a discrete time map. If the map is mixing, the time dependent one-step transition probabilities converge in the long…
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
We consider a random graph model evolving in discrete time-steps that is based on 3-interactions among vertices. Triangles, edges and vertices have different weights; objects with larger weight are more likely to participate in future…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
Stationary probability distributions of one-dimensional random walks on lattices with aperiodic disorder are investigated. The pattern of the distribution is closely related to the diffusional behavior, which depends on the wandering…
What happens when a continuously evolving stochastic process is interrupted with large changes at random intervals $\tau$ distributed as a power-law $\sim \tau^{-(1+\alpha)};\alpha>0$? Modeling the stochastic process by diffusion and the…
We study the Dominating set problem and Independent Set Problem for dynamic graphs in the vertex-arrival model. We say that a dynamic algorithm for one of these problems is $k$-stable when it makes at most $k$ changes to its output…
We consider a system of parallel straight edge dislocations and we analyse its asymptotic behaviour in the limit of many dislocations. The dislocations are represented by points in a plane, and they are arranged in vertical walls; each wall…
The mixing process of discrete-time quantum walks on one-dimensional lattices is revisited in a setting where the walker is coupled to an environment, and the time evolution of the walker and the environment is unitary. The mixing process…
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
We study the condensation regime of the finite reversible inclusion process, i.e., the inclusion process on a finite graph $S$ with an underlying random walk that admits a reversible measure. We assume that the random walk kernel is…
A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and…
We address the question of convergence of evolving interacting particle systems as the number of particles tends to infinity. We consider two types of particles, called positive and negative. Same-sign particles repel each other, and…
We study a stochastic system of interacting neurons and its metastable properties. The system consists of $N$ neurons, each spiking randomly with rate depending on its membrane potential. At its spiking time, the neuron potential is reset…
Symmetry-breaking order at low temperatures is often accompanied by slow relaxation dynamics, due to diverging free-energy barriers arising from interfaces between different ordered states. Here, we extend this correspondence to classical…
Many regular graphs admit a natural partition of their edge set into cliques of the same order such that each vertex is contained in the same number of cliques. In this paper, we study the mixing rate of certain random walks on such graphs…
We study a natural random walk over the upper triangular matrices, with entries in the field $\Z_2$, generated by steps which add row $i+1$ to row $i$. We show that the mixing time of the lazy random walk is $O(n^2)$ which is optimal up to…
Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are…