The following pages link to (Q3267900):
Displaying 50 items.
- Generating directed networks with predetermined assortativity measures (Q80586) (← links)
- Testing Linearity for Network Autoregressive Models (Q91246) (← links)
- Optimal change point detection and localization in sparse dynamic networks (Q97726) (← links)
- Correlation between graphs with an application to brain network analysis (Q126082) (← links)
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs (Q136800) (← links)
- Latent Space Modeling of Multidimensional Networks with Application to the Exchange of Votes in Eurovision Song Contest (Q145237) (← links)
- Analyzing the maritime transportation system in Greece: a complex network approach (Q264316) (← links)
- Complexity of equilibrium in competitive diffusion games on social networks (Q273917) (← links)
- A conceptual approach to online social networks analysis (Q276773) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Connectivity of soft random geometric graphs over annuli (Q281201) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Spatial science and network science: review and outcomes of a complex relationship (Q291647) (← links)
- Connectivity of soft random geometric graphs (Q292916) (← links)
- Approximating evolutionary dynamics on networks using a neighbourhood configuration model (Q293770) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Emergence of the giant component in preferential-attachment growing networks (Q297964) (← links)
- Spectral properties of unimodular lattice triangulations (Q300599) (← links)
- Agents of change and the approximation of network outcomes: a simulation study (Q301076) (← links)
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs (Q302013) (← links)
- Identification of peer effects through social networks (Q302163) (← links)
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- Compact pairwise models for epidemics with multiple infectious stages on degree heterogeneous and clustered networks (Q309249) (← links)
- Micro- and macromodels of social networks. I: Theory fundamentals (Q315127) (← links)
- Mathematical programming approaches for classes of random network problems (Q319592) (← links)
- Uniform sampling of directed and undirected graphs conditional on vertex connectivity (Q327621) (← links)
- Information diffusion in social sensing (Q330313) (← links)
- A classification of orbits admitting a unique invariant measure (Q331039) (← links)
- Pinning control for synchronization of nonlinear complex dynamical network with suboptimal SDRE controllers (Q331293) (← links)
- The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks (Q332431) (← links)
- The impact of other-regarding tendencies on the spatial vaccination game (Q336302) (← links)
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- The firefighter problem: empirical results on random graphs (Q337557) (← links)
- Prevention of infectious diseases by public vaccination and individual protection (Q338359) (← links)
- Immunization strategy based on the critical node in percolation transition (Q341283) (← links)
- Bounding the \(HL\)-index of a graph: a majorization approach (Q343532) (← links)
- Robust \(\mathcal{H}_{\infty}\) decentralized dynamic control for synchronization of a complex dynamical network with randomly occurring uncertainties (Q354085) (← links)
- Scale-free graph with preferential attachment and evolving internal vertex structure (Q359574) (← links)
- Communication network designing: transmission capacity, cost and scalability (Q362158) (← links)
- Maximum likelihood estimation in the \(\beta\)-model (Q366958) (← links)
- Adaptive exponential synchronization of coupled complex networks on general graphs (Q370271) (← links)
- Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law (Q373567) (← links)
- General graph pebbling (Q385150) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- A generalization of the Buckley-Osthus model for web graphs (Q394370) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Networks that optimize a trade-off between efficiency and dynamical resilience (Q407841) (← links)
- Random induced subgraphs of Cayley graphs induced by transpositions (Q409364) (← links)
