English
Related papers

Related papers: Tripodal structure in undersaturated random graphs

200 papers

Using the superstatistics method, we propose an extension of the random matrix theory to cover systems with mixed regular-chaotic dynamics. Unlike most of the other works in this direction, the ensembles of the proposed approach are basis…

Statistical Mechanics · Physics 2007-05-23 A. Y. Abul-Magd

Intriguing issues in one-dimensional non-reciprocal topological systems include the breakdown of usual bulk-edge correspondence and the occurrence of half-integer topological invariants. In order to understand these unusual topological…

Mesoscale and Nanoscale Physics · Physics 2020-07-22 Hui Jiang , Rong Lü , Shu Chen

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…

In this work we analytically explain the origin of the mobility edge in the partially disordered random regular graphs of degree d, i.e., with a fraction $\beta$ of the sites being disordered, while the rest remain clean. It is shown that…

Disordered Systems and Neural Networks · Physics 2024-04-24 Daniil Kochergin , Ivan M. Khaymovich , Olga Valba , Alexander Gorsky

In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…

Probability · Mathematics 2008-10-20 M. Draief , A. Ganesh , L. Massoulie

Twisted graphene layers exhibit extremely low friction for relative sliding. Nevertheless, previous studies suggest that the area contribution to friction for commensurate moir\'e systems is finite and might restrict macroscopic…

Mesoscale and Nanoscale Physics · Physics 2025-11-04 Irina V. Lebedeva , Andrey M. Popov , Yulia G. Polynskaya , Andrey A. Knizhnik , Sergey A. Vyrko , Nikolai A. Poklonski

We discuss numerically the non-perturbative effects in exponential random graphs which are analogue of eigenvalue instantons in matrix models. The phase structure of exponential random graphs with chemical potential for 4-cycles and degree…

High Energy Physics - Theory · Physics 2021-05-19 Alexander Gorsky , Olga Valba

The nontrivial band topology for graphene with regular arrays of nanoholes with $C_{6v}$ symmetry is investigated theoretically. For the case of $3\sqrt{3} \times 3\sqrt{3}$ triangular array of nanoholes, we find an energy gap at $\Gamma$…

Mesoscale and Nanoscale Physics · Physics 2026-05-18 Yong-Cheng Jiang , Xing-Xiang Wang , Xiao Hu

Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…

Combinatorics · Mathematics 2008-05-15 Martin Nehez , Daniel Olejar , Michal Demetrian

This work studies the typical structure of sparse $H$-free graphs, that is, graphs that do not contain a subgraph isomorphic to a given graph $H$. Extending the seminal result of Osthus, Pr\"omel, and Taraz that addressed the case where $H$…

Combinatorics · Mathematics 2025-02-13 Oren Engelberg , Wojciech Samotij , Lutz Warnke

We study how the spectral gap of the normalized Laplacian of a random graph changes when an edge is added to or removed from the graph. There are known examples of graphs where, perhaps counterintuitively, adding an edge can decrease the…

Combinatorics · Mathematics 2015-06-23 Ronen Eldan , Miklós Rácz , Tselil Schramm

Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$…

Combinatorics · Mathematics 2022-07-29 Francisco Martinez-Figueroa

We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\eta)$-quasirandom if for any subset $X\subseteq V$ and every set of pairs $P\subseteq V\times V$ the number of pairs…

Combinatorics · Mathematics 2016-09-20 Christian Reiher , Vojtěch Rödl , Mathias Schacht

We calculate the influence of transverse fluctuations on the longitudinal dynamics in the striped phase of cuprates by using the bosonization technique. We find that a charge density wave instability can arise if the stripe is quarter…

Strongly Correlated Electrons · Physics 2009-11-07 N. Hasselmann , A. H. Castro Neto , C. Morais Smith

It has recently been established that two-dimensional massless graphene-like systems and three-dimensional line-node topological semimetals comprise a special class of centrosymmetric materials where edge/surface states of topological…

Materials Science · Physics 2016-11-15 Ivan I. Naumov , Russell J. Hemley

We study the stability of amorphous solids, focusing on the distribution P(x) of the local stress increase x that would lead to an instability. We argue that this distribution is singular P(x)x^{\theta}, where the exponent {\theta} is…

Soft Condensed Matter · Physics 2014-11-19 Jie Lin , Alaa Saade , Edan Lerner , Alberto Rosso , Matthieu Wyart

We prove inequalities between the densities of various bipartite subgraphs in signed graphs and graphons. One of the main inequalities is that the density of any bipartite graph with girth r cannot exceed the density of the r-cycle. This…

Combinatorics · Mathematics 2010-04-20 László Lovász

Trilayer graphene with a twisted middle layer has recently emerged as a new platform exhibiting correlated phases and superconductivity near its magic angle. A detailed characterization of its electronic structure in the parameter space of…

Mesoscale and Nanoscale Physics · Physics 2021-07-21 Jiseon Shin , Bheema Lingam Chittari , Jeil Jung

A \emph{$k$-planar graph} is a graph that can be drawn in the plane such that every edge is crossed at most $k$ times. For $k \leq 4$, Pach and T\'oth proved a bound of $(k+3)(n-2)$ on the total number of edges of a $k$-planar graph, which…

Computational Geometry · Computer Science 2016-08-31 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

A well-known conjecture by Erd\H{o}s states that every triangle-free graph on $n$ vertices can be made bipartite by removing at most $n^2/25$ edges. This conjecture was known for graphs with edge density at least $0.4$ and edge density at…

Combinatorics · Mathematics 2021-03-29 József Balogh , Felix Christian Clemen , Bernard Lidický