Related papers: Symmetry-breaking symmetry in directed spectral pa…
We propose two spectral algorithms for partitioning nodes in directed graphs respectively with a cyclic and an acyclic pattern of connection between groups of nodes. Our methods are based on the computation of extremal eigenvalues of the…
A geometric mechanism that may, in analogy to similar notions in physics, be considered as "symmetry breaking" in geometry is described, and several instances of this mechanism in differential geometry are discussed: it is shown how…
Directed graphs have asymmetric connections, yet the current graph clustering methodologies cannot identify the potentially global structure of these asymmetries. We give a spectral algorithm called di-sim that builds on a dual measure of…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for multiprocessor…
We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the…
Spectral graph theory is well known and widely used in computer vision. In this paper, we analyze image segmentation algorithms that are based on spectral graph theory, e.g., normalized cut, and show that there is a natural connection…
In this paper two important aspects related to Caputo fractional-order discrete variant of a class of maps defined on the complex plane, are analytically and numerically revealed: attractors symmetry-broken induced by the fractional-order…
We describe a symmetry breaking construction in coarse geometry which allows to obtain information about equivariant coarse homology classes by restriction to smaller groups and spaces. In the case of equivariant coarse $K$-homology theory…
We study creating and analyzing symmetry and broken symmetry in digital art. Our focus is not so much on computer-generating artistic images, but rather on analyzing concepts and templates for incorporating symmetry and symmetry breaking…
We can break symmetry by eliminating solutions within each symmetry class. For instance, the Lex-Leader method eliminates all but the smallest solution in the lexicographical ordering. Unfortunately, the Lex-Leader method is intractable in…
In this article we study the symmetry breaking phenomenon of solutions of noncooperative elliptic systems. We apply the degree for G-invariant strongly indefinite functionals to obtain simultaneously a symmetry breaking and a global…
We report a new type of symmetry-breaking bifurcation of solitons in optical systems with parity-time-symmetric potentials. In this bifurcation, the two bifurcated branches of asymmetric solitons exhibit opposite stability, which contrasts…
We introduce a dual-core system with double symmetry, one between the cores, and one along each core, imposed by the spatial modulation of local nonlinearity in the form of two tightly localized spots, which may be approximated by a pair of…
Spontaneous symmetry breaking is a cornerstone of modern physics, defining a wealth of phenomena in condensed-matter and high-energy physics, and beyond. It requires an infinite number of degrees of freedom, and even then, for continuous…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…