Related papers: The aggregate path coupling method for the Potts m…
We solve a recent question of Caro, Patk\'os and Tuza by determining the exact maximum number of edges in a bipartite connected graph as a function of the longest path it contains as a subgraph and of the number of vertices in each side of…
Comparative analyses of graph structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large…
A strongly separating path system in a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that, for every two edges $e$ and $f$ of $G$, there is a paths in $\mathcal{P}$ with $e$ and not $f$, and vice-versa. The minimum number of…
Addressing a question posed by Erd\H{o}s and Hajnal, Chen and Ma proved that, for all $n \ge 600$, the complete bipartite graph $K_{n,n+1}$ is the unique graph on $2n+1$ vertices with at least $n^2+n$ edges that contains no two vertices of…
In this work we derive the general conditions for obtaining nonreciprocity in multi-mode parametrically-coupled systems. The results can be applied to a broad variety of optical, microwave, and hybrid systems including recent electro- and…
We study the bi-dimensional $q$-Potts model with long-range bond correlated disorder. Similarly to [C. Chatelain, Phys. Rev. E 89, 032105], we implement a disorder bimodal distribution by coupling the Potts model to auxiliary…
We introduce COPT, a novel distance metric between graphs defined via an optimization routine, computing a coordinated pair of optimal transport maps simultaneously. This gives an unsupervised way to learn general-purpose graph…
We develop a bifurcation theory for infinite dimensional systems satisfying abstract hypotheses that are tailored for applications to mean field coupled chaotic maps. Our abstract theory can be applied to many cases, from globally coupled…
A pathwise large deviation result is proved for the pure jump models of $k$-nary interacting particle system introduced by Kolokoltsov that generalize classical Boltzmann's collision model, Smoluchovski's coagulation model and many others.…
Consider observations $y_1,\dots,y_n$ on nodes of a connected graph, where the $y_i$ independently come from $N(\theta_i, \sigma^2)$ distributions and an unknown partition divides the $n$ observations into blocks. One well-studied class of…
We develop an algorithm that finds the consensus of many different clustering solutions of a graph. We formulate the problem as a median set partitioning problem and propose a greedy optimization technique. Unlike other approaches that find…
We study Glauber dynamics for the mean-field (Curie-Weiss) Potts model with $q\geq 3$ states and show that it undergoes a critical slowdown at an inverse-temperature $\beta_s(q)$ strictly lower than the critical $\beta_c(q)$ for uniqueness…
Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges with a graph's deviation from series-parallel topology is…
For n at least 2, the concept of n-way expanders was defined by various researchers. Bigger n gives a weaker notion in general, and 2-way expanders coincide with expanders in usual sense. Koji Fujiwara asked whether these concepts are…
The K-way vertex cut problem} consists in, given a graph G, finding a subset of vertices of a given size, whose removal partitions G into the maximum number of connected components. This problem has many applications in several areas. It…
We use the transport methods developped in [3] to obtain universality results for local statistics of eigenvalues in the bulk and at the edge for $\beta$-matrix models in the multi-cut regime. We construct an approximate transport map…
In this paper we consider the algorithmic problem of sampling from the Potts model and computing its partition function at low temperatures. Instead of directly working with spin configurations, we consider the equivalent problem of…
This work establishes novel optimum mixing bounds for the Glauber dynamics on the Hard-core and Ising models. These bounds are expressed in terms of the local connective constant of the underlying graph $G$. This is a notion of effective…
Motivated by the Cauchy-Davenport theorem for sumsets, and its interpretation in terms of Cayley graphs, we prove the following main result : There is a universal constant e > 0 such that, if G is a connected, regular graph on n vertices,…
We consider the problem of sampling from the ferromagnetic $q$-state Potts model on the random $d$-regular graph with parameter $\beta>0$. A key difficulty that arises in sampling from the model is the existence of a metastability window…