Zobrazeno 1 - 10
of 98
pro vyhledávání: '"Kuehn, Reimer"'
Autor:
Kuehn, Reimer
We present a solution of the problem of level-set percolation for multivariate Gaussians defined in terms of weighted graph Laplacians on complex networks. It is achieved using a cavity or message passing approach, which allows one to obtain the esse
Externí odkaz:
http://arxiv.org/abs/2410.03681
Autor:
Kuehn, Reimer
We provide an explicit solution of the problem of level-set percolation for multivariate Gaussians defined in terms of weighted graph Laplacians on complex networks. The solution requires an analysis of the heterogeneous micro-structure of the percol
Externí odkaz:
http://arxiv.org/abs/2404.05503
We present analytical results for the distribution of the number of cycles in directed and undirected random 2-regular graphs (2-RRGs) consisting of $N$ nodes. In directed 2-RRGs each node has one inbound link and one outbound link, while in undirect
Externí odkaz:
http://arxiv.org/abs/2301.03686
Publikováno v:
J. Phys. A: Math. Theor. 55, 265005 (2022)
The distribution of shortest path lengths (DSPL) of random networks provides useful information on their large scale structure. In the special case of random regular graphs (RRGs), which consist of $N$ nodes of degree $c \ge 3$, the DSPL, denoted by
Externí odkaz:
http://arxiv.org/abs/2202.11368
Dynamic processes of interacting units on a network are out of equilibrium in general. In the case of a directed tree, the dynamic cavity method provides an efficient tool that characterises the dynamic trajectory of the process for the linear thresh
Externí odkaz:
http://arxiv.org/abs/2202.06705
This paper presents an in-depth analysis of the anatomy of both thermodynamics and statistical mechanics, together with the relationships between their constituent parts. Based on this analysis, using the renormalization group and finite-size scaling
Externí odkaz:
http://arxiv.org/abs/2106.15487
The dynamic cavity method provides the most efficient way to evaluate probabilities of dynamic trajectories in systems of stochastic units with unidirectional sparse interactions. It is closely related to sum-product algorithms widely used to compute
Externí odkaz:
http://arxiv.org/abs/2105.04197
Publikováno v:
Phys. Rev. E 103, 042302 (2021)
We investigate the statistics of articulation points and bredges (bridge-edges) in complex networks in which bonds are randomly removed in a percolation process. Articulation points are nodes in a network which, if removed, would split the network co
Externí odkaz:
http://arxiv.org/abs/2101.09977
Publikováno v:
SciPost Phys. Lect. Notes 33 (2021)
We review the problem of how to compute the spectral density of sparse symmetric random matrices, i.e. weighted adjacency matrices of undirected graphs. Starting from the Edwards-Jones formula, we illustrate the milestones of this line of research, i
Externí odkaz:
http://arxiv.org/abs/2101.08029
In modern society people are being exposed to numerous information, with some of them being frequently repeated or more disruptive than others. In this paper we use a model of opinion dynamics to study how this news impact the society. In particular,
Externí odkaz:
http://arxiv.org/abs/2011.02445