Related papers: A pattern theorem for lattice clusters
In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\lambda^{\# \mbox{edges}} n^{\# \mbox{loops}},}$$ where $\lambda, n \in…
Cluster synchronization is a phenomenon in which a network self-organizes into a pattern of synchronized sets. It has been shown that diverse patterns of stable cluster synchronization can be captured by symmetries of the network. Here we…
Synchrony patterns characterize network states in which nodes organize into clusters based on their synchronized dynamics. The synchronized clusters may further exhibit either active or inactive states. The simultaneous invariance of active…
Let $S_n$ be a lattice random walk with mean zero and finite variance, and let $\Lambda^a_n$ be its occupation measure at level $a$. In this note, we prove local limit theorems for $\Pr[S_n=x,\Lambda^a_n=\ell]$ and…
The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…
Kleinberg introduced three natural clustering properties, or axioms, and showed they cannot be simultaneously satisfied by any clustering algorithm. We present a new clustering property, Monotonic Consistency, which avoids the well-known…
The eigenvalue spectra of the transition probability matrix for random walks traversing critically disordered clusters in three different types of percolation problems show that the random walker sees a developing Euclidean signature for…
We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…
We consider the observability model in networks with arbitrary topologies. We introduce a system of coupled nonlinear equations, valid under the locally tree-like ansatz, to describe the size of the largest observable cluster as a function…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
In this paper we propose a measure of clustering quality or accuracy that is appropriate in situations where it is desirable to evaluate a clustering algorithm by somehow comparing the clusters it produces with ``ground truth' consisting of…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…
In this paper, we investigate temporal clusters of extremes defined as subsequent exceedances of high thresholds in a stationary time series. Two meaningful features of these clusters are the probability distribution of the cluster size and…
We consider a continuous-time branching random walk on a multidimensional lattice with two types of particles and an infinite number of initial particles. The main results are devoted to the study of the generating function and the limiting…
Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality…
Rotating clusters or vortices are formations of agents that rotate around a common center. These patterns may be found in very different contexts: from swirling fish to surveillance drones. Here, we propose a minimal model for…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…