Related papers: Tripodal structure in undersaturated random graphs
Our general subject is the emergence of phases, and phase transitions, in large networks subjected to a few variable constraints. Our main result is the analysis, in the model using edge and triangle subdensities for constraints, of a sharp…
A well-known theorem of Mantel states that every $n$-vertex graph with more than $\lfloor n^2/4\rfloor $ edges contains a triangle. An interesting problem in extremal graph theory studies the minimum number of edges contained in triangles…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
Consider a graph $G$ and an initial random configuration, where each node is black with probability $p$ and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least $r$ black neighbors and white…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
We present an analytical model for the non-spherical collapse of overdense regions out of a Gaussian random field of initial cosmological perturbations. The collapsing region is treated as an ellipsoid of constant density, acted upon by the…
We critically analyze the possibility of finding signatures of a phase transition by looking exclusively at static quantities of statistical systems, like e.g., the topology of potential energy sub-manifolds (PES). This topological…
We study the problem of detecting latent geometric structure in random graphs. To this end, we consider the soft high-dimensional random geometric graph $\mathcal{G}(n,p,d,q)$, where each of the $n$ vertices corresponds to an independent…
We study the discrete-time threshold-$\theta \geq 2$ contact process on random graphs of general degrees. For random graphs with a given degree distribution $\mu$, we show that if $\mu$ is lower bounded by $\theta+2$ and has finite $k$th…
We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomass\'e and Thomassen characterizing those edge densities guaranteeing the existence of a…
The study of topological band structures have sparked prominent research interest the past decade, culminating in the recent formulation of rather prolific classification schemes that encapsulate a large fraction of phases and features.…
We consider the problem of estimating the parameters in a pairwise graphical model in which the distribution of each node, conditioned on the others, may have a different parametric form. In particular, we assume that each node's…
The Topological Hypothesis states that phase transitions should be related to changes in the topology of configuration space. The necessity of such changes has already been demonstrated. We characterize exactly the topology of the…
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…
We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…