Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Pim van der Hoorn"'
Publikováno v:
Physical Review Research, Vol 3, Iss 1, p 013211 (2021)
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional definition of cu
Externí odkaz:
https://doaj.org/article/558e2b41dd0c45838e5a81a181871368
Publikováno v:
Physical Review Research, Vol 2, Iss 4, p 043157 (2020)
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models. If the d
Externí odkaz:
https://doaj.org/article/2242bd6135fc454ab6519ec5c3bfaab2
Publikováno v:
Physical Review Research, Vol 1, Iss 3, p 033034 (2019)
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distributions, equivalent to the definition of regularly varying distribution
Externí odkaz:
https://doaj.org/article/9be73fe1fc5f498aa813a0e6a17f893d
Autor:
Dingeman L.H. van der Haven, Roderick Prudent Tas, Pim van der Hoorn, Remco van der Hofstad, Ilja Karina Voets
Publikováno v:
Journal of Colloid and Interface Science, 620, 356-364. Academic Press Inc.
Hypothesis: Knowing the exact location of soft interfaces, such as between water and oil, is essential to the study of nanoscale wetting phenomena. Recently, iPAINT was used to visualize soft interfaces in situ with minimal invasiveness, but computin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfd46d21964e596bd97c5ebfd61b3b0c
https://doi.org/10.1016/j.jcis.2022.03.116
https://doi.org/10.1016/j.jcis.2022.03.116
Autor:
Mike van Santvoort, Óscar Lapuente-Santana, Francesca Finotello, Pim van der Hoorn, Federica Eduati
Cell-cell interaction networks are pivotal in cancer development and treatment response. These networks can be inferred from data; however, this process often combines data from multiple patients, and/or creates networks on a cell-types level. It cre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::592f33de4cf5bb5a3df0d9ec4de7b986
https://doi.org/10.1101/2023.02.03.526946
https://doi.org/10.1101/2023.02.03.526946
Publikováno v:
Physical Review E, 106(5):054308. American Physical Society
The structure of a network is an unlabeled graph, yet graphs in most models of complex networks are labeled by meaningless random integers. Is the associated labeling noise always negligible, or can it overpower the network-structural signal? To addr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d567bc160017f19ccdc1b9fe2ad97a3e
https://doi.org/10.1103/physreve.106.054308
https://doi.org/10.1103/physreve.106.054308
Publikováno v:
Physical Review Research, 3(1):013211. American Physical Society
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional definition of cu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18ceb892b9c873947ab81f4018cdef08
https://doi.org/10.1103/physrevresearch.3.013211
https://doi.org/10.1103/physrevresearch.3.013211
Publikováno v:
Electron. J. Probab.
Electronic Journal of Probability, 26:13, 1-132. Institute of Mathematical Statistics
Electronic journal of probability, 26:13, 1-132. UNIV WASHINGTON, DEPT MATHEMATICS
Electronic Journal of Probability, 26:13, 1-132. Institute of Mathematical Statistics
Electronic journal of probability, 26:13, 1-132. UNIV WASHINGTON, DEPT MATHEMATICS
In this paper we consider the clustering coefficient and clustering function in a random graph model proposed by Krioukov et al.~in 2010. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are connected if th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::308379167c444ccd55dd02f876b29560
https://doi.org/10.1214/21-ejp583
https://doi.org/10.1214/21-ejp583
Publikováno v:
Advances in applied probability, 52(4), 1035-1084. University of Sheffield
Pure TUe
Advances in Applied Probability, 52(4), 1035-1084. University of Sheffield
Pure TUe
Advances in Applied Probability, 52(4), 1035-1084. University of Sheffield
An important problem in modeling networks is how to generate a randomly sampled graph with given degrees. A popular model is the configuration model, a network with assigned degrees and random connections. The erased configuration model is obtained w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::986638a9ff1b7fe356c263afbf97fdf1
https://research.utwente.nl/en/publications/1c7dfd3d-82e5-4887-8170-1c74065b1762
https://research.utwente.nl/en/publications/1c7dfd3d-82e5-4887-8170-1c74065b1762
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030484774
WAW
WAW
Recently, non-Euclidean spaces became popular for embedding structured data. However, determining suitable geometry and, in particular, curvature for a given dataset is still an open problem. In this paper, we define a notion of global graph curvatur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20de9ba8674ac6c6635c7f460c2513f2
https://doi.org/10.1007/978-3-030-48478-1_2
https://doi.org/10.1007/978-3-030-48478-1_2