Suchergebnisse - Limits and Structures in Graph Theory

A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth von Nešetřil, Jaroslav, Ossona de Mendez, Patrice

“… 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 …”
Volltext

On String Graph Limits and the Structure of a Typical String Graph von Janson, Svante, Uzzell, Andrew J.

“… We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane …”
Volltext

Mean‐field limit of non‐exchangeable systems von Jabin, Pierre‐Emmanuel, Poyato, David, Soler, Juan

“… 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 …”
Volltext

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 von Miller, J. Houston, Golden, Rachelle J., Giaccai, Jennifer A., Kamischke, Andrew, Korte, Andrew, Vertes, Akos

“… 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 …”
Volltext

Limit theory for the random on-line nearest-neighbor graph von Penrose, Mathew D., Wade, Andrew R.

“… In the on‐line nearest‐neighbor graph (ONG), each point after the first in a sequence of points …”
Volltext

Graph Convolutional Neural Networks as "General-Purpose" Property Predictors: The Universality and Limits of Applicability von Korolev, Vadim, Mitrofanov, Artem, Korotcov, Alexandru, Tkachenko, Valery

“… ) techniques is a hot topic and includes several crucial steps, one of which is the choice of chemical structure representation …”
Weitere Angaben

Planted Bipartite Graph Detection von Rotenberg, Asaf, Huleihel, Wasim, Shayevitz, Ofer

“… We consider the task of detecting a hidden bipartite subgraph in a given random graph …”
Volltext

Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments von Yongwook Choi, Szpankowski, W.

“… In this paper, we attempt to address the former problem by studying information of graphical structures (i.e., unlabeled graphs …”
Volltext

MAGUS: machine learning and graph theory assisted universal structure searcher von Wang, Junjie, Gao, Hao, Han, Yu, Ding, Chi, Pan, Shuning, Wang, Yong, Jia, Qiuhan, Wang, Hui-Tian, Xing, Dingyu, Sun, Jian

“… 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 …”
Volltext

Equipped Graded Graphs, Projective Limits of Simplices, and Their Boundaries von Vershik, A. M.

“… ) 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 …”
Volltext

Graphs whose spectral radius is bounded by a fixed Hoffman–Smith limit point von Borba, Elizandro Max, Calegari, Rafael, Hoppen, Carlos, Trevisan, Vilmar, Veloso, Bruno Scaratti

“… –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 …”
Volltext

A large twist limit for any operator von Ferrando, Gwenaël, Sever, Amit, Sharon, Adar, Urisman, Elior

“… 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 …”
Volltext

Limit theory for the Gilbert graph von Reitzner, Matthias, Schulte, Matthias, Thäle, Christoph

“… 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 …”
Volltext

Inferring Hidden Structures in Random Graphs von Huleihel, Wasim

“… We study the two inference problems of detecting and recovering an isolated community of general structure planted in a random graph …”
Volltext

Pulsation of quantum walk on Johnson graph: Pulsation of quantum walk on Johnson graph von Hosaka, Taisuke, Segawa, Etsuo

“… 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 …”
Volltext

Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems von Broutin, Nicolas, Duquesne, Thomas, Wang, Minmin

“… We consider a natural model of inhomogeneous random graphs that extends the classical Erdős …”
Volltext

Nonlocal-Interaction Equation on Graphs: Gradient Flow Structure and Continuum Limit von Esposito, Antonio, Patacchini, Francesco S., Schlichting, André, Slepčev, Dejan

“… We investigate this quasi-metric both on graphs and on more general structures where the set of “vertices” is an arbitrary positive …”
Volltext

Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions von Santhanam, Narayana P., Wainwright, Martin J.

“… The problem of graphical model selection is to estimate the graph structure of a Markov random field given samples …”
Volltext

Multiple Structure-View Learning for Graph Classification von Wu, Jia, Pan, Shirui, Zhu, Xingquan, Zhang, Chengqi, Yu, Philip S.

“… 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 …”
Volltext

On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs von Ahn, Junhyung, Elmahdy, Adel, Mohajer, Soheil, Suh, Changho

“… We study a matrix completion problem which leverages a hierarchical structure of social similarity graphs as side information in the context of recommender systems …”
Volltext