default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complex Networks, Volume 13
Volume 13, Number 1, 2024
- Alexei Vazquez
:
Percolation in higher order networks via mapping to chygraphs. - Margot Ferrand, Vincent Labatut:
Approximating spatial distance through Confront networks: application to the segmentation of medieval Avignon. - Cathy Xuanchi Liu, Tristram J. Alexander, Eduardo G. Altmann:
A generative model for non-assortative communities in directed networks. - Franck Delaplace:
Entropic detection of chromatic community structures. - Vassilis Kalantzis, Georgios Kollias, Shashanka Ubaru, Naoki Abe, Lior Horesh:
Single-pass top-N subgraph centrality of graphs via subspace projections. - Expression of Concern: Community detection based on nonnegative matrix tri-factorization for multiplex social networks.
- Kevin Teo, Naomi A. Arnold, Andrew Hone, István Zoltán Kiss:
Performance of higher-order networks in reconstructing sequential paths: from micro to macro scale.
Volume 13, Number 2, 2025
- Ao Shen, Qunqiang Feng, Jun Yan, Panpan Zhang:
Rank-based assortativity for weighted, directed networks. - Piet Van Mieghem, Xinhan Liu:
Degree-based approximations for network reliability polynomials. - Saeed Jamalzadeh, Kash Barker, Andrés D. González, Sridhar Radhakrishnan, Elena Bessarabova, Giovanni Sansavini:
Disinformation interdiction: protecting infrastructure networks from weaponized disinformation campaigns.
Volume 13, Number 3, 2025
- Teodoro Criscione:
Topological components in a community currency network. - Michael Ostroski, Geoffrey Sanders, Trevor Steil, Roger Pearce:
Scalable edge clustering of dynamic graphs via weighted line graphs. - Audun Myers, Enzo Battistella, Sean English, Robert Green, Cliff A. Joslyn, Evgeniya Lagoda, Van Magnan, Evan D. Nash, Michael Robinson:
Understanding high-order network structure using permissible walks on attributed hypergraphs.
Volume 13, Number 4, 2025
- Blas Kolic, Fabián Aguirre-López, Sergio Hernández-Williams, Guillermo Garduño-Hernández:
From chambers to echo chambers: quantifying polarization with a second-neighbor approach applied to Twitter's climate discussion. - Hadeel Kittaneh, Filippo Castiglione, Abdul Salam Jarrah:
Stability of threshold Boolean networks. - Emmanuel Paradis:
An efficient algorithm to find all minimum spanning trees. - Cameron Cornell, Lewis Mitchell, Matthew Roughan:
Vector autoregression in cryptocurrency markets: unraveling complex causal networks. - Grover E. C. Guzman, André Fujita:
Statistical methods for hypergraphs: a parameter estimator, a model selection, and a comparative test. - Keishi Sando, Hideitsu Hino:
Complex non-backtracking matrix for directed graphs. - Mindaugas Bloznelis, Dominykas Marma:
Two models of sparse and clustered dynamic networks. - Jihui Han, Yupeng Shi, Daoying Huang, Ziqi Huang, Anlin Zhang:
Graph Learning-Based Network Dismantling via hierarchical feature fusion and margin-ranked optimization. - Grover E. C. Guzman, Daniel Yasumasa Takahashi, André Fujita:
Vertex-wise graph's spectral density decomposition and its applications. - Alexander Voß, Gregor Svindland:
Decision-making frameworks for network resilience: managing and mitigating systemic (cyber) risk. - Matheus de Andrade Flausino, Eric Araújo, Angélica Sousa da Mata:
Exploring the link between urban topology and street crime using complex networks: a case study from Southeast Brazil. - Alex D. Stivala, Peng Wang, Alessandro Lomi:
Improving exponential-family random graph models for bipartite networks. - José Andrés Guzmán Morán, Federico Malizia, Gyeong Ho Park, Boseung Choi, Diana Cole, István Z. Kiss:
Inferring contact network characteristics from epidemic data via compact mean-field models. - Xin-Ya Zhang, Gang Yan, Jack Murdoch Moore:
Organization of a neuron-resolution central brain network: topology, geometry, and anatomy. - Tong-Yu Wang, Sheng Zhu, Wen-Jie Xie, Wei-Xing Zhou:
Extracting the hierarchical backbone of foreign direct investment networks. - Jordan Barrett, Pawel Pralat, Aaron Smith, François Théberge:
Counting simplicial pairs in hypergraphs. - Mingyu Li, Kailun Zhang, Yun Chong, Lu Wang, Chao Wang:
Least-cost influence maximization by an improved multi-objective salp swarm optimization. - Yanna J. Kraakman, Clara Stegehuis:
Hypercurveball algorithm for sampling hypergraphs with fixed degrees.
Volume 13, Number 5, 2025
- Pawanesh Pawanesh, Charu C. Sharma, Niteesh Sahni:
Analyzing communicability and connectivity in the Indian stock market during crises. - Ru Zheng, Marcus Engsig, Alejandro Tejedor, Yamir Moreno:
Identifying central nodes in multiplex networks by embracing layer-specific heterogeneity via DomiRank. - Siwei Hu, Han Yang, Fengqin Tang:
Multilayer network community detection based on triangular motif and attribute information. - Mohammad Amin Basiri, Sina Khanmohammadi:
SINDyG: sparse identification of nonlinear dynamical systems from graph-structured data, with applications to Stuart-Landau oscillator networks. - James Martin, Tim Rogers, Luca Zanetti:
Percolation and localization: sub-leading eigenvalues of the nonbacktracking matrix. - Lars Schroeder, Clara Stegehuis:
Stationary distribution of node2vec random walks on household models. - Dedian Li, Weigang Sun:
Optimizing synchronizability of small-world networks via adjusting edge weights. - Hayato Goto, Hiroaki Yoshida, Toshihiro Tanizawa:
Novel phase transition on charging networks of electric vehicles. - Om Kolsoom Kazemi, Seyed Mahmoud Taheri:
Tsallis entropy analysis in spatial networks with applications to wireless networks. - Oliver Baker, Carl P. Dettmann:
Entropy of random geometric graphs in high and low dimensions. - Rafael de Oliveira Costa, Daniel Ratton Figueiredo:
Characterization over time and growth model for the submarine cable network.
Volume 13, Number 6, 2025
- Andressa Cerqueira, Laila L. S. Costa:
Modeling sparsity in count-weighted networks with stochastic block models. - Patience Pokuaa Gambrah, Marcial Nguemfouo:
A multiplex network approach to farmers' friendship relationships: a case study from rural Ghana. - Matteo Bergamaschi, Sara Venturini, Francesco Tudisco, Francesco Rinaldi:
An efficient network-aware direct search method for influence maximization. - Xu Wang, Jia-Bao Liu, Jinde Cao, Liping Chen:
The topological characteristics and robustness analysis for a class of fractal weighted networks. - Eli Newby, Wenlong Shi, Yang Jiao, Salvatore Torquato, Reka Albert:
From point patterns to networks: to what extent does the Delaunay triangulation reproduce key spatial and density information? - Diego Huerta, Gerardo Arizmendi:
A probabilistic model for node classification in directed graphs. - Correction to: Stationary distribution of node2vec random walks on household models.
- Blas Kolic, Manuel Cebrián, Iñaki Ucar, Rosa E. Lillo:
Incentivized network dynamics in digital job recruitment.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
