Related papers: Tripodal structure in undersaturated random graphs
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…
Settling a first case of a conjecture of M. Kahle on the homology of the clique complex of the random graph $G=G_{n,p}$, we show, roughly speaking, that (with high probability) the triangles of $G$ span its cycle space whenever each of its…
Experiments on bilayer graphene unveiled a fascinating realization of stacking disorder where triangular domains with well-defined Bernal stacking are delimited by a hexagonal network of strain solitons. Here we show by means of numerical…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes.…
Abrupt transition to turbulence may occur in pipe and channel flows at moderate flow rates, an unexpected event according to linear stability theory, and has been an open problem in fluid dynamics for more than a century. Extensive…
The focus of this thesis is about statistical mechanics on heterogeneous random graphs, i.e. how this heterogeneity affects the cooperative behavior of model systems. It is not intended as a review on it, rather it is showed how this…
Compared to the classical binomial random (hyper)graph model, the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of different edges. We develop an edge-switching technique for…
The genus of a graph is a topological invariant that measures the minimum genus of a surface on which the graph can be embedded without any edges crossing. Graph genus plays a fundamental role in topological graph theory, used to classify…
We theoretically study the topography of a biphasic surfactant monolayer in the vicinity of domain boundaries. The differing elastic properties of the two phases generally lead to a nonflat topography of ``mesas'', where domains of one…
Scanning tunneling microscopy (STM) and spectroscopy (STS) in combination with density functional theory (DFT) calculations are employed to study the surface and subsurface properties of the metastable phase of the phase change material…
We study the spectrum of elementary excitations of a dipolar Bose gas in a three-dimensional anisotropic trap across the superfluid-supersolid phase transition. Theoretically, we show that, when entering the supersolid phase, two distinct…
In low dimensions, conformal anomaly has profound influence on the critical behavior of random surfaces with extrinsic curvature rigidity $1/\a$. We illustrate this by making a small $D$ expansion of rigid random surfaces, where a…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
We determine the phase diagram of hardcore bosons on a triangular lattice with nearest neighbor repulsion, paying special attention to the stability of the supersolid phase. Similar to the same model on a square lattice we find that for…
We propose a simple model for a binary decision making process on a graph, motivated by modeling social decision making with cooperative individuals. The model is similar to a random field Ising model or fiber bundle model, but with key…
We consider the problem of estimating the edge density of densest $K$-node subgraphs of an Erd\"os-R\'{e}nyi graph $\mathbb{G}(n,1/2)$. The problem is well-understood in the regime $K=\Theta(\log n)$ and in the regime $K=\Theta(n)$. In the…