相关论文: The asymptotics of the clustering transition for r…

To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to each other. It is proved that under certain conditions, as r…

The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…

In the graph clustering problem with a planted solution, the input is a graph on $n$ vertices partitioned into $k$ clusters, and the task is to infer the clusters from graph structure. A standard assumption is that clusters induce…

We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…

We prove that the mixing time of the Glauber dynamics for random k-colorings of the complete tree with branching factor b undergoes a phase transition at $k=b(1+o_b(1))/\ln{b}$. Our main result shows nearly sharp bounds on the mixing time…

This paper investigates the reconfiguration variant of the Constraint Satisfaction Problem (CSP), referred to as the Reconfiguration CSP (RCSP). Given a CSP instance and two of its solutions, RCSP asks whether one solution can be…

We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…

We study the size and the lifetime distributions of scale-free random branching tree in which $k$ branches are generated from a node at each time step with probability $q_k\sim k^{-\gamma}$. In particular, we focus on finite-size trees in a…

We consider the random directed graph $\vec{G}(n,p)$ with vertex set $\{1,2,\ldots,n\}$ in which each of the $n(n-1)$ possible directed edges is present independently with probability $p$. We are interested in the strongly connected…

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…

In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…

We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

The tree reconstruction problem is to collect and analyze massive data at the $n$th level of the tree, to identify whether there is non-vanishing information of the root, as $n$ goes to infinity. Its connection to the clustering problem in…

Improving a result of Dyer, Frieze and Greenhill [Journal of Combinatorial Theory, Series B, 2015], we determine the $q$-colorability threshold in random $k$-uniform hypergraphs up to an additive error of $\ln 2+\varepsilon_q$, where…

A colouring of a graph $G$ has clustering $k$ if the maximum number of vertices in a monochromatic component equals $k$. Motivated by recent results showing that many natural graph classes are subgraphs of the strong product of a graph with…

Constraint satisfaction problems (CSPs) are about finding values of variables that satisfy the given constraints. We show that Transformer extended with recurrence is a viable approach to learning to solve CSPs in an end-to-end manner,…

For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…

Contemporary technological challenges often involve many degrees of freedom in a distributed or networked setting. Three aspects are notable: the variables are usually associated with the nodes of a graph with limited communication…