相关论文: Circular automata synchronize with high probabilit…

We propose a novel generalized cellular automaton(GCA) model for discrete-time pulse-coupled oscillators and study the emergence of synchrony. Given a finite simple graph and an integer $n\ge 3$, each vertex is an identical oscillator of…

For a fixed d-regular graph H, a random n-lift is obtained by replacing each vertex v of H by a "fibre" containing n vertices, then placing a uniformly random matching between fibres corresponding to adjacent vertices of H. We show that…

The homogeneous Kuramoto model on a graph $G = (V,E)$ is a network of $|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph $G$ is said…

The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but…

We present conditions that allow us to pass from the convergence of probability measures in distribution to the uniform convergence of the associated quantile functions. Under these conditions, one can in particular pass from the asymptotic…

We study the problem of how to coordinate the actions of independent agents in a distributed system where message arrival times are unbounded, but are determined by an exponential probability distribution. Asynchronous protocols executed in…

In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\log…

There are few known universality classes of absorbing phase transitions in one dimension and most models fall in the well-known directed percolation (DP) class. Synchronization is a transition to an absorbing state and this transition is…

This paper considers scheduling on identical machines. The scheduling objective considered in this paper generalizes most scheduling minimization problems. In the problem, there are $n$ jobs and each job $j$ is associated with a…

We consider the distributed optimization problem for the sum of convex functions where the underlying communications network connecting agents at each time is drawn at random from a collection of directed graphs. Building on an earlier work…

The classical pattern matching paradigm is that of seeking occurrences of one string - the pattern, in another - the text, where both strings are drawn from an alphabet set $\Sigma$. Assuming the text length is $n$ and the pattern length is…

Cellular Automata (CA) are an interesting computational model for designing Pseudorandom Number Generators (PRNG), due to the complex dynamical behavior they can exhibit depending on the underlying local rule. Most of the CA-based PRNGs…

A transformation monoid on a set Omega is called synchronizing if it contains an element of rank 1 (that is, mapping the whole of Omega to a single point). In this paper, I tackle the question: given n and k, what is the probability that…

Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience…

A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random…

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…

Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

We exhibit new conditions under which a primitive automaton is synchronizing. In particular, we show that the primitivity of an automaton forces its synchronizability whenever the automaton has either a letter of defect 1 or a word of rank…