Výsledky vyhľadávania - Limits and Structures in Graph Theory
-
1
A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth
ISBN: 9781470440657, 1470440652ISSN: 0065-9266, 1947-6221Vydavateľské údaje: Providence, Rhode Island American Mathematical Society 2020“…In this paper we introduce a general framework for the study of limits of relational structures and graphs in particular, which is based on a combination of model theory and (functional) analysis…”
Získať plný text
E-kniha Kniha -
2
On String Graph Limits and the Structure of a Typical String Graph
ISSN: 0364-9024, 1097-0118, 1097-0118Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 01.04.2017Vydané v Journal of graph theory (01.04.2017)“…We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane…”
Získať plný text
Journal Article -
3
Mean‐field limit of non‐exchangeable systems
ISSN: 0010-3640, 1097-0312Vydavateľské údaje: New York John Wiley and Sons, Limited 01.04.2025Vydané v Communications on pure and applied mathematics (01.04.2025)“… The analysis does not only involve PDEs and stochastic analysis but also graph theory through a new concept of limits of sparse graphs (extended graphons…”
Získať plný text
Journal Article -
4
Application of chemical graph theory to PAH isomer enumeration and structure in laser desorption/ionization mass spectrometry studies of particulate from an ethylene diffusion flame
ISSN: 1540-7489, 1873-2704Vydavateľské údaje: Elsevier Inc 2021Vydané v Proceedings of the Combustion Institute (2021)“… In this paper, we demonstrate that the empirical formula of observed species can aid in the enumeration of isomers and places limits on their structures and thermodynamic stability…”
Získať plný text
Journal Article -
5
Limit theory for the random on-line nearest-neighbor graph
ISSN: 1042-9832, 1098-2418Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2008Vydané v Random structures & algorithms (01.03.2008)“…In the on‐line nearest‐neighbor graph (ONG), each point after the first in a sequence of points…”
Získať plný text
Journal Article -
6
Graph Convolutional Neural Networks as "General-Purpose" Property Predictors: The Universality and Limits of Applicability
ISSN: 1549-960X, 1549-960XVydavateľské údaje: United States 27.01.2020Vydané v Journal of chemical information and modeling (27.01.2020)“…) techniques is a hot topic and includes several crucial steps, one of which is the choice of chemical structure representation…”
Zistit podrobnosti o prístupe
Journal Article -
7
Planted Bipartite Graph Detection
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.06.2024Vydané v IEEE transactions on information theory (01.06.2024)“…We consider the task of detecting a hidden bipartite subgraph in a given random graph…”
Získať plný text
Journal Article -
8
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York, NY IEEE 01.02.2012Vydané v IEEE transactions on information theory (01.02.2012)“… In this paper, we attempt to address the former problem by studying information of graphical structures (i.e., unlabeled graphs…”
Získať plný text
Journal Article -
9
MAGUS: machine learning and graph theory assisted universal structure searcher
ISSN: 2095-5138, 2053-714X, 2053-714XVydavateľské údaje: China Oxford University Press 01.07.2023Vydané v National science review (01.07.2023)“… Here, we introduce a crystal structure prediction method, MAGUS, based on the evolutionary algorithm, which addresses the above challenges with machine learning and graph theory…”
Získať plný text
Journal Article -
10
Equipped Graded Graphs, Projective Limits of Simplices, and Their Boundaries
ISSN: 1072-3374, 1573-8795Vydavateľské údaje: New York Springer US 09.09.2015Vydané v Journal of mathematical sciences (New York, N.Y.) (09.09.2015)“…) and an alternative theory of projective limits of finite-dimensional simplices. An equipment is an additional structure on the graph, namely, a system of “cotransition…”
Získať plný text
Journal Article -
11
Graphs whose spectral radius is bounded by a fixed Hoffman–Smith limit point
ISSN: 0925-9899, 1572-9192Vydavateľské údaje: New York Springer US 01.09.2025Vydané v Journal of algebraic combinatorics (01.09.2025)“…–Smith limit points. For general p , we find upper bounds on the maximum degree of such graphs G and describe the graphs for which the upper bound is achieved with respect to the adjacency matrix…”
Získať plný text
Journal Article -
12
A large twist limit for any operator
ISSN: 1029-8479, 1029-8479Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 06.06.2023Vydané v The journal of high energy physics (06.06.2023)“…A bstract We argue that for any single-trace operator in N = 4 SYM theory there is a large twist double-scaling limit in which the Feynman graphs have an iterative structure…”
Získať plný text
Journal Article -
13
Limit theory for the Gilbert graph
ISSN: 0196-8858, 1090-2074Vydavateľské údaje: Elsevier Inc 01.07.2017Vydané v Advances in applied mathematics (01.07.2017)“… The behavior of the resulting random graph, the Gilbert graph or random geometric graph, is investigated as the intensity of the Poisson point process is increased and the distance parameter goes to zero…”
Získať plný text
Journal Article -
14
Inferring Hidden Structures in Random Graphs
ISSN: 2373-776X, 2373-7778“…We study the two inference problems of detecting and recovering an isolated community of general structure planted in a random graph…”Vydavateľské údaje: Piscataway IEEE 2022
Získať plný text
Journal Article -
15
Pulsation of quantum walk on Johnson graph: Pulsation of quantum walk on Johnson graph
ISSN: 1573-1332, 1570-0755, 1573-1332Vydavateľské údaje: New York Springer US 19.11.2025Vydané v Quantum information processing (19.11.2025)“…We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches…”
Získať plný text
Journal Article -
16
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
ISSN: 0178-8051, 1432-2064Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2021Vydané v Probability theory and related fields (01.12.2021)“…We consider a natural model of inhomogeneous random graphs that extends the classical Erdős…”
Získať plný text
Journal Article -
17
Nonlocal-Interaction Equation on Graphs: Gradient Flow Structure and Continuum Limit
ISSN: 0003-9527, 1432-0673Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2021Vydané v Archive for rational mechanics and analysis (01.05.2021)“… We investigate this quasi-metric both on graphs and on more general structures where the set of “vertices” is an arbitrary positive…”
Získať plný text
Journal Article -
18
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York, NY IEEE 01.07.2012Vydané v IEEE transactions on information theory (01.07.2012)“…The problem of graphical model selection is to estimate the graph structure of a Markov random field given samples…”
Získať plný text
Journal Article -
19
Multiple Structure-View Learning for Graph Classification
ISSN: 2162-237X, 2162-2388, 2162-2388Vydavateľské údaje: United States IEEE 01.07.2018Vydané v IEEE transaction on neural networks and learning systems (01.07.2018)“… Graph learning and classification is a common tool for handling such objects. To date, existing graph classification has been limited to the single-graph setting with each object being represented as one graph from a single structure-view…”
Získať plný text
Journal Article -
20
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.03.2024Vydané v IEEE transactions on information theory (01.03.2024)“…We study a matrix completion problem which leverages a hierarchical structure of social similarity graphs as side information in the context of recommender systems…”
Získať plný text
Journal Article

