Related papers: Tripodal structure in undersaturated random graphs
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
We study a one-dimensional quasiperiodic system described by the off-diagonal Aubry-Andr\'{e} model and investigate its phase diagram by using the symmetry and the multifractal analysis. It was shown in a recent work ({\it Phys. Rev. B}…
Turan's Theorem states that every graph of a certain edge density contains a complete graph $K^k$ and describes the unique extremal graphs. We give a similar Theorem for l-partite graphs. For large l, we find the minimal edge density…
We study the thermodynamics of the one-dimensional extended Hubbard model at half-filling using a density-matrix renormalization group method applied to transfer matrices. We show that the various phase transitions in this system can be…
We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…
We study theoretically and experimentally the emergence of supersolid properties in a dipolar Bose-Einstein condensate. The theory reveals a ground state phase diagram with three distinct regimes - a regular Bose-Einstein condensate,…
Spectral graph theory studies how the eigenvalues of a graph relate to the structural properties of a graph. In this paper, we solve three open problems in spectral extremal graph theory which generalize the classical Tur\'{a}n-type…
The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric.…
Driven diffusive systems have provided simple models for non-equilibrium systems with non-trivial structures. Steady state behaviour of these systems with constant boundary conditions have been studied extensively. Comparatively less work…
This paper investigates a diffusion process in a narrow tubular domain with reflecting boundary conditions, where the geometry serves as a singular perturbation of an underlying graph in $\mathbb{R}^2$ or $\mathbb{R}^3$. The construction…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
We study a new kind of proximity graphs called proportional-edge proximity catch digraphs (PCDs)in a randomized setting. PCDs are a special kind of random catch digraphs that have been developed recently and have applications in statistical…
We study the phase diagram of $\nu_e=7/3$ state in the $N=1$ Landau level in the presence of band mass anisotropy. Using density matrix renormalization group on an infinite cylinder geometry, we find a continuous transition from the…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…
A network as a substrate for dynamic processes may have its own dynamics. We propose a model for networks which evolve together with diffusing particles through a coupled dynamics, and investigate emerging structural property. The model…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
Spatial graphs are particular graphs for which the nodes are localized in space (e.g., public transport network, molecules, branching biological structures). In this work, we consider the problem of spatial graph reduction, that aims to…
Using a version of density-functional theory which combines Onsager approximation and fundamental-measure theory for spatially nonuniform phases, we have studied the phase diagram of freely rotating hard rectangles and hard discorectangles.…