scientific article

From MaRDI portal
Revision as of 11:46, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3291948

zbMath0106.12006MaRDI QIDQ3291948

Alfréd Rényi

Publication date: 1961


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (73)

Stability analysis of nonlinear oscillator networks based on the mechanism of cascading failuresForman-Ricci curvature and persistent homology of unweighted complex networksOptimal attack strategy of complex networks based on tabu searchInvestigating the relationship between \(k\)-core and \(s\)-core network decompositionsCharacterizing the topological and controllability features of U.S. power transmission networksThe mean and variance of the distribution of shortest path lengths of random regular graphsAn opinion formation based binary optimization approach for feature selectionBrownian excursions, critical random graphs and the multiplicative coalescentRelationships between Perron-Frobenius eigenvalue and measurements of loops in networksSome Introductory Notes on Random GraphsNon-equilibrium kinetic Biswas-Chatterjee-Sen model on complex networksCodes identifying sets of vertices in random networksEvolution of scale-free random graphs: Potts model formulationPhase synchronization of coupled bursting neurons and the generalized Kuramoto modelSystematic evaluation of a new combinatorial curvature for complex networksCascading Critical Nodes Detection with Load Redistribution in Complex SystemsSpectral distributions of adjacency and Laplacian matrices of random graphsSpectral classes of regular, random, and empirical graphsA novel weighted defence and its relaxation in abstract argumentationAlgebraic and combinatorial expansion in random simplicial complexesCatastrophic cascading failures in power networksAnalytical results for the distribution of shortest path lengths in directed random networks that grow by node duplicationCONTROLLABILITY ANALYSIS OF COMPLEX NETWORKS USING STATISTICAL RANDOM SAMPLINGCatastrophic event phenomena in communication networks: a surveyLocal limit theorems for subgraph countsPhase transition of degeneracy in minor-closed familiesMultidimensional Friedkin-Johnsen model with increasing stubbornness in social networksDiscrete Ricci curvatures for directed networksCharacterization of Graphs Using Degree CoresA bird’s-eye view of naming game dynamics: From trait competition to Bayesian inferenceCores of random \(r\)-partite hypergraphsPosterior contraction rates for stochastic block modelsStrict convexity of the free energy of the canonical ensemble under decay of correlationsRandom Graphs and Their SubgraphsThe distribution of first hitting times of randomwalks on Erdős–Rényi networksTriangle percolation in mean field random graphs-with PDEConnected components and evolution of random graphs: An algebraic approachThe augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphsNew stochastic local search approaches for computing preferred extensions of abstract argumentationRandom geometric complexes and graphs on Riemannian manifolds in the thermodynamic limitForman curvature for complex networksThe distribution of first hitting times of random walks on directed Erdős–Rényi networksPreferential attachment without vertex growth: emergence of the giant componentColorings of spaces, and random graphsRecent advances in percolation theory and its applicationsMatching theory -- a sampler: From Dénes König to the presentThe agglomeration phenomenon influence on the scaling law of the scientific collaboration systemThe size of the giant component in random hypergraphs: a short proofOn global site-percolation on the correlated honeycomb latticeMaximal clusters in non-critical percolation and related modelsInduced gelation in a two-site spatial coagulation modelOn sparse graphs with dense long pathsNormal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph countingKruskal with embedded C-semirings to solve MST problems with partially-ordered costsOn influence, stable behavior, and the most influential individuals in networks: a game-theoretic approachSearch for an immobile hider on a stochastic networkLarge-scale clique cover of real-world networksTime-varying network modelsTransforming a graph into a 1-balanced graphStatistical Characterization of a Small World Network Applied to Forest FiresThe probability of unusually large components in the near-critical Erdős–Rényi graphSpectral bounds in random graphs applied to spreading phenomena and percolationOptimal \(K\)-node disruption on a node-capacitated networkExploring the optimal network topology for spreading dynamicsA Relaxation of Internal Conflict and Defence in Weighted Argumentation FrameworksA motif-based approach to network epidemicsSynchronization criteria and pinning control of general complex networks with time delayPropagation Connectivity of Random HypergraphsThe impact of neighboring infection on the computer virus spread in packets on scale-free networksDecay of correlations and uniqueness of the Infinite-Volume Gibbs measure of the Canonical ensemble of 1d-lattice systemsSandwiching dense random regular graphs between binomial random graphsThe distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networksAnalytical results for the distribution of first hitting times of random walks on random regular graphs




This page was built for publication: