Pages that link to "Item:Q1376406"
From MaRDI portal
The following pages link to Relaxing the uniformity and independence assumptions using the concept of fractal dimension (Q1376406):
Displaying 50 items.
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Robustness of power-law networks: its assessment and optimization (Q326464) (← links)
- Modeling and analysis of the effect of network eigenvalue on viral spread (Q333052) (← links)
- Communication network designing: transmission capacity, cost and scalability (Q362158) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Community discovery using nonnegative matrix factorization (Q408633) (← links)
- Opinions and networks: how do they effect each other (Q431906) (← links)
- SoMR: a scalable distributed QoS multicast routing protocol (Q436654) (← links)
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks (Q498452) (← links)
- Clustering and community detection in directed networks: a survey (Q514409) (← links)
- General results on preferential attachment and clustering coefficient (Q526411) (← links)
- How to improve snap-stabilizing point-to-point communication space complexity? (Q555308) (← links)
- A sequential algorithm for generating random graphs (Q603928) (← links)
- Scale free properties of random \(k\)-trees (Q626908) (← links)
- Graph spectra in computer science (Q627958) (← links)
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents (Q633812) (← links)
- How to determine if a random graph with a fixed degree sequence has a giant component (Q681521) (← links)
- Security of scale-free networks (Q690537) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- Modeling generation of the router-level topology of an ISP network (Q708834) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- A preferential attachment model with random initial degrees (Q841212) (← links)
- Entropic grid scheduling (Q851181) (← links)
- A packet filter placement problem with application to defense against spoofed denial of service attacks (Q853001) (← links)
- The degree distribution of the generalized duplication model (Q861264) (← links)
- Complex networks: from graph theory to biology (Q861524) (← links)
- Distance in random graphs with infinite mean degrees (Q881401) (← links)
- New method to estimate scaling exponents of power-law degree distribution and hierarchical clustering function for complex networks (Q940142) (← links)
- A complex network approach to text summarization (Q1010133) (← links)
- Geometry of complex networks and topological centrality (Q1673137) (← links)
- When is a scale-free graph ultra-small? (Q1685487) (← links)
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points (Q1692737) (← links)
- Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure (Q1736520) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- Optimizing network robustness by edge rewiring: a general framework (Q1741288) (← links)
- Triadic closure in configuration models with unbounded degree fluctuations (Q1756538) (← links)
- Message survival and decision dynamics in a class of reactive complex systems subject to external fields (Q1782825) (← links)
- Matching games with partial information (Q1873933) (← links)
- Actively learning to infer social ties (Q1944988) (← links)
- Assortativity in generalized preferential attachment models (Q1989493) (← links)
- Immunization strategies in directed networks (Q2038786) (← links)
- Effect of adaptive rewiring delay in an SIS network epidemic model (Q2045586) (← links)
- A fair-cost analysis of the random neighbor sampling method (Q2086576) (← links)
- Extinction and stationary distribution of a stochastic SIQR epidemic model with demographics and non-monotone incidence rate on scale-free networks (Q2089270) (← links)
- The many facets of the Estrada indices of graphs and networks (Q2128861) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- Heavy-tailed configuration models at criticality (Q2227459) (← links)
- Optimal subgraph structures in scale-free configuration models (Q2240823) (← links)
