Transience versus recurrence for scale-free spatial networks

Gracar, P orcid.org/0000-0001-8340-8340, Heydenreich, M orcid.org/0000-0002-3749-7431, Mönch, C orcid.org/0000-0002-6531-6482 et al. (1 more author) (2020) Transience versus recurrence for scale-free spatial networks. In: Algorithms and Models for the Web Graph. WAW 2020. Algorithms and Models for the Web Graph 17th International Workshop, WAW 2020, 21-22 Sep 2020, Warsaw, Poland. Lecture Notes in Computer Science, 12091 . Springer , pp. 96-110. ISBN 9783030484774

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2020 Springer Nature Switzerland AG. This is an author produced version of a conference paper published in Algorithms and Models for the Web Graph. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Random-connection model; Recurrence; Transience; Scale-free percolation; Preferential attachment; Boolean model
Dates:
  • Published: 2 June 2020
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Statistics (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 17 Nov 2023 15:31
Last Modified: 17 Nov 2023 15:31
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-3-030-48478-1_7
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)