Related papers: The asymptotics of the clustering transition for r…
We study the problem of $k$-way clustering in signed graphs. Considerable attention in recent years has been devoted to analyzing and modeling signed graphs, where the affinity measure between nodes takes either positive or negative values.…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
In our daily lives, we encounter numerous independent events, each occurring with varying probabilities over time. This letter delves into the scientific background behind the inhomogeneous distribution of these events over time, often…
Control landscape phase transitions (CLPTs) occur as abrupt changes in the cost function landscape upon varying a control parameter, and can be revealed by non-analytic points in statistical order parameters. A prime example are quantum…
We present new results for LambdaCC and MotifCC, two recently introduced variants of the well-studied correlation clustering problem. Both variants are motivated by applications to network analysis and community detection, and have…
Constraint Satisfaction Problem (CSP) is a framework for modeling and solving a variety of real-world problems. Once the problem is expressed as a finite set of constraints, the goal is to find the variables' values satisfying them. Even…
Many inference problems, notably the stochastic block model (SBM) that generates a random graph with a hidden community structure, undergo phase transitions as a function of the signal-to-noise ratio, and can exhibit hard phases in which…
We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of $m$ points in $n$ dimensions, $n,m \rightarrow \infty$ and $\alpha = m/n$ stays finite. Using exact but non-rigorous methods…
The ubiquitous occurrence of cluster patterns in nature still lacks a comprehensive understanding. It is known that the dynamics of many such natural systems is captured by ensembles of Stuart-Landau oscillators. Here, we investigate…
Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
The $k$-center problem is a canonical and long-studied facility location and clustering problem with many applications in both its symmetric and asymmetric forms. Both versions of the problem have tight approximation factors on worst case…
We study the singularity of the order parameter at the transition between a critical phase and an ordered phase of bond percolation on pointed hierarchical graphs. In pointed hierarchical graphs, the renormalization group (RG) equation…
In the last 30 years it was found that many combinatorial systems undergo phase transitions. One of the most important examples of these can be found among the random k-satisfiability problems (often referred to as k-SAT), asking whether…
Applying the "Complexity=Action" conjecture, we study the holographic complexity close to crossover/phase transition in a holographic QCD model proposed by Gubser et al. This model can realize three types of phase transition, crossover or…
Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with $n$ variables and $m$ clauses, there is a value of $m = \Omega(n)$ beyond which the CSP will be…
An (improper) graph colouring has "defect" $d$ if each monochromatic subgraph has maximum degree at most $d$, and has "clustering" $c$ if each monochromatic component has at most $c$ vertices. This paper studies defective and clustered…
We study the scaling behavior of period doublings in two unidirectionally-coupled one-dimensional maps near a bicritical point where two critical lines of period-doubling transition to chaos in both subsystems meet. Note that the bicritical…
The $H$-Coloring problem is a well-known generalization of the classical NP-complete problem $k$-Coloring where the task is to determine whether an input graph admits a homomorphism to the template graph $H$. This problem has been the…
Sudoku is a widely popular $\mathcal{NP}$-Complete combinatorial puzzle whose prospects for studying human computation have recently received attention, but the algorithmic hardness of Sudoku solving is yet largely unexplored. In this…