Related papers: Tripodal structure in undersaturated random graphs
The Kruskal-Katona theorem together with a theorem of Razborov determine the closure of the set of points defined by the homomorphism density of the edge and the triangle in finite graphs. The boundary of this region is a countable union of…
A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…
We address the formation of topological edge solitons in rotating Su-Schrieffer-Heeger waveguide arrays. The linear spectrum of the non-rotating topological array is characterized by the presence of topological gap with two edge states…
Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of $G(n,p)$ with high…
Given connected graph $H$ which is not a star, we show that the number of copies of $H$ in a dense uniformly random regular graph is asymptotically Gaussian, which was not known even for $H$ being a triangle. This addresses a question of…
We introduce a variant of the asymmetric random average process with continuous state variables where the maximal transport is restricted by a cutoff. For periodic boundary conditions, we show the existence of a phase transition between a…
We study the domain geometry during spinodal decomposition of a 50:50 binary mixture in two dimensions. Extending arguments developed to treat non-conserved coarsening, we obtain approximate analytic results for the distribution of domain…
The long-range spectral density correlations (spectral rigidities $\bar{\Delta}_3(\bar n)$ and related spectral compressibilities) of the $E\otimes (b_1+b_2)$ Jahn-Teller model are found strongly nonuniversal with respect to the Hamiltonian…
We study the spectral properties of the adjacency matrix in the giant connected component of Erd\"os-R\'enyi random graphs, with average connectivity $p$ and randomly distributed hopping amplitudes. By solving the self-consistent cavity…
For a fixed integer $r\geqslant 3$, let $\mathbb{H}_r(n,p)$ be a random $r$-uniform hypergraph on the vertex set $[n]$, where each $r$-set is an edge randomly and independently with probability $p$. The random $r$-generalized triadic…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
Even though the rare-earth tritellurides are tetragonal materials with a quasi two dimensional (2D) band structure, they have a "hidden" 1D character. The resultant near-perfect nesting of the Fermi surface leads to the formation of a…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
In this Letter we study interacting systems with spontaneous discrete symmetry breaking, where the degenerate symmetry-broken states are topologically distinct gapped phases. Edge modes appear at domain walls between the two topological…
We study the Integrated Density of States (IDS) of the random Schr\"odinger operator appearing in the study of certain reinforced random processes in connection with a supersymmetric sigma-model. We rely on previous results on the…
3D bicontinuous two-phase materials are increasingly gaining interest because of their unique multifunctional characteristics and advancements in techniques to fabricate them. Due to their complex topological and structural properties, it…
The phase diagram, ($T,\rho$), of a finite, constrained, and classical system is built from the analysis of cluster distributions in phase and configurational space. The obtained phase diagram can be split in three regions. One, low density…
We develop an asymptotic theory for extremes in decomposable graphical models by presenting results applicable to a range of extremal dependence types. Specifically, we investigate the weak limit of the distribution of suitably normalised…
Ensemble models of graphs are one of the most important theoretical tools to study complex networks. Among them, exponential random graphs (ERGs) have proven to be very useful in the analysis of social networks. In this paper we develop a…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…