Related papers: Graph covers and ergodicity for 0-dimensional syst…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…
Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…
In this paper, solution space organization of minimum vertex-cover problem is deeply investigated using the K\"{o}nig-Eg\'{e}rvary (KE) graph and theorem, in which a hierarchical decomposition mechanism named KE-layer structure of general…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results. Although the studies in this direction are successful, we still need a…
We classify the ergodic invariant random subgroups of block-diagonal limits of symmetric groups in the cases when the groups are simple and the associated dimension groups have finite dimensional state spaces. These block-diagonal limits…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
We present a computational study of a visualization method for invariant sets based on ergodic partition theory, first proposed in [1,2]. The algorithms for computation of the time averages of observables on phase space are developed and…
In this article we study conditions to be a continuous or a measurable eigenvalue of finite rank minimal Cantor systems, that is, systems given by an ordered Bratteli diagram with a bounded number of vertices per level. We prove that…
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as…
We study the invariant measures of typical $C^0$ maps on compact connected manifolds with or without boundary, and also of typical homeomorphisms. We prove that the weak$^*$ closure of the set of ergodic measurescoincides with the weak$^*$…
We study the set S of ergodic probability Borel measures on stationary non-simple Bratteli diagrams which are invariant with respect to the tail equivalence relation. Equivalently, the set S is formed by ergodic probability measures…
A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…