Zobrazeno 1 - 10
of 759
pro vyhledávání: '"05C82"'
Autor:
Fujita, Takaaki
Hypergraphs extend traditional graphs by allowing edges to connect multiple nodes, while superhypergraphs further generalize this concept to represent even more complex relationships. Neural networks, inspired by biological systems, are widely used f
Externí odkaz:
http://arxiv.org/abs/2412.01176
Autor:
Labarthe, Aldric, Kerzreho, Yann
In this paper, we introduce a conceptual framework that model human social networks as an undirected dot-product graph of independent individuals. Their relationships are only determined by a cost-benefit analysis, i.e. by maximizing an objective fun
Externí odkaz:
http://arxiv.org/abs/2411.16464
Let $G$ be a connected graph and let $F$ be a connected subgraph of $G$ with a given structure. We consider that the centrality of a vertex $i$ of $G$ is determined by the centrality of other vertices in all subgraphs contain $i$ and isomorphic to $F
Externí odkaz:
http://arxiv.org/abs/2411.12409
Autor:
Bloznelis, Mindaugas, Marma, Dominykas
We present two models of sparse dynamic networks that display transitivity - the tendency for vertices sharing a common neighbour to be neighbours of one another. Our first network is a continuous time Markov chain $G=\{G_t=(V,E_t), t\ge 0\}$ whose s
Externí odkaz:
http://arxiv.org/abs/2411.12055
Publikováno v:
Complex Networks XIV (CompleNet 2023). Springer Proceedings in Complexity. Springer, Cham
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph mean first
Externí odkaz:
http://arxiv.org/abs/2411.08608
Patients at a comprehensive cancer center who do not achieve cure or remission following standard treatments often become candidates for clinical trials. Patients who participate in a clinical trial may be suitable for other studies. A key factor inf
Externí odkaz:
http://arxiv.org/abs/2411.01394
Both empirical and theoretical investigations of scale-free network models have found that large degrees in a network exert an outsized impact on its structure. However, the tools used to infer the tail behavior of degree distributions in scale-free
Externí odkaz:
http://arxiv.org/abs/2410.22703
Autor:
Moutuou, El-kaïoum M., Benali, Habib
The brain's synaptic network, characterized by parallel connections and feedback loops, drives information flow between neurons through a large system with infinitely many degrees of freedom. This system is best modeled by the graph $C^*$-algebra of
Externí odkaz:
http://arxiv.org/abs/2410.18222
Autor:
Hinz, Michael, Pachon, Angelica
We study a random graph model with preferential edge attachment and detachment through the embedding into a generalized Yule model. We show that the in-degree distribution of a vertex chosen uniformly at random follows a power law in the supercritica
Externí odkaz:
http://arxiv.org/abs/2410.09974
In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of legs at ea
Externí odkaz:
http://arxiv.org/abs/2410.09440