The location of high-degree vertices in weighted recursive graphs with bounded random weights
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Advances in Applied Probability, 56, 3, S. 868-926
- Event
-
Veröffentlichung
- (where)
-
Augsburg
- (who)
-
Universität Augsburg
- (when)
-
2024
- Event
-
Veröffentlichung
- (where)
-
Cambridge
- (who)
-
Cambridge University Press
- (when)
-
2024
- Creator
- DOI
-
10.1017/apr.2023.52
- URN
-
urn:nbn:de:bvb:384-opus4-1139080
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:29 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lodewijks, Bas
- Universität Augsburg
- Cambridge University Press
Time of origin
- 2024
Other Objects (12)
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Bounded degree spanning trees
On joint properties of vertices with a given degree or label in the random recursive tree
Hypergraph cuts with edge-dependent vertex weights
Deleting Vertices to Graphs of Bounded Genus
A dichotomy for bounded degree graph homomorphisms with nonnegative weights: Q/A Session B - Paper B1.A
Coevolution of Vertex Weights Resolves Social Dilemma in Spatial Networks
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Shadow Ratio of Hypergraphs with Bounded Degree
Limiting Properties of Random Graph Models with Vertex and Edge Weights
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Bounded degree spanning trees
On joint properties of vertices with a given degree or label in the random recursive tree
Hypergraph cuts with edge-dependent vertex weights
Deleting Vertices to Graphs of Bounded Genus
A dichotomy for bounded degree graph homomorphisms with nonnegative weights: Q/A Session B - Paper B1.A
Coevolution of Vertex Weights Resolves Social Dilemma in Spatial Networks
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Shadow Ratio of Hypergraphs with Bounded Degree
Limiting Properties of Random Graph Models with Vertex and Edge Weights
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Bounded degree spanning trees
On joint properties of vertices with a given degree or label in the random recursive tree
Hypergraph cuts with edge-dependent vertex weights
Deleting Vertices to Graphs of Bounded Genus
A dichotomy for bounded degree graph homomorphisms with nonnegative weights: Q/A Session B - Paper B1.A
Coevolution of Vertex Weights Resolves Social Dilemma in Spatial Networks
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Shadow Ratio of Hypergraphs with Bounded Degree