scientific article
From MaRDI portal
Publication:3267900
zbMath0092.15705MaRDI QIDQ3267900
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Analyzing the maritime transportation system in Greece: a complex network approach, Complexity of equilibrium in competitive diffusion games on social networks, A conceptual approach to online social networks analysis, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Connectivity of soft random geometric graphs over annuli, Maximum likelihood analysis of the Ford-Fulkerson method on special graphs, Spatial science and network science: review and outcomes of a complex relationship, Connectivity of soft random geometric graphs, Approximating evolutionary dynamics on networks using a neighbourhood configuration model, Finding maximum subgraphs with relatively large vertex connectivity, Emergence of the giant component in preferential-attachment growing networks, Spectral properties of unimodular lattice triangulations, Agents of change and the approximation of network outcomes: a simulation study, The Laplacian energy and Laplacian Estrada index of random multipartite graphs, Identification of peer effects through social networks, Minimum vertex cover in generalized random graphs with power law degree distribution, Compact pairwise models for epidemics with multiple infectious stages on degree heterogeneous and clustered networks, Micro- and macromodels of social networks. I: Theory fundamentals, Mathematical programming approaches for classes of random network problems, Uniform sampling of directed and undirected graphs conditional on vertex connectivity, Information diffusion in social sensing, A classification of orbits admitting a unique invariant measure, Pinning control for synchronization of nonlinear complex dynamical network with suboptimal SDRE controllers, The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks, The impact of other-regarding tendencies on the spatial vaccination game, A derandomized approximation algorithm for the critical node detection problem, A randomized algorithm with local search for containment of pandemic disease spread, The firefighter problem: empirical results on random graphs, Prevention of infectious diseases by public vaccination and individual protection, Immunization strategy based on the critical node in percolation transition, Bounding the \(HL\)-index of a graph: a majorization approach, Robust \(\mathcal{H}_{\infty}\) decentralized dynamic control for synchronization of a complex dynamical network with randomly occurring uncertainties, Scale-free graph with preferential attachment and evolving internal vertex structure, Communication network designing: transmission capacity, cost and scalability, Maximum likelihood estimation in the \(\beta\)-model, Validity studies in clustering methodologies, Adaptive exponential synchronization of coupled complex networks on general graphs, A one-parameter family of stationary solutions in the susceptible-infected-susceptible epidemic model, The performance model of dynamic virtual organization (VO) formations within grid computing context, Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law, Birth and growth of multicyclic components in random hypergraphs, General compartmental epidemic models, Balanced and 1-balanced graph constructions, Parallel graph component labelling with GPUs and CUDA, General graph pebbling, On computing the diameter of real-world undirected graphs, Randomised broadcasting: memory vs. randomness, Spectral distributions of adjacency and Laplacian matrices of random graphs, A generalization of the Buckley-Osthus model for web graphs, Angular synchronization by eigenvectors and semidefinite programming, An integer programming framework for critical elements detection in graphs, Networks that optimize a trade-off between efficiency and dynamical resilience, Random induced subgraphs of Cayley graphs induced by transpositions, On the mixing time of geographical threshold graphs, Dense subgraphs in the \(H\)-free process, Random subshifts of finite type, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Shortest hop multipath algorithm for wireless sensor networks, Parameter identifiability in a class of random graph mixture models, Optimal link removal for epidemic mitigation: A two-way partitioning approach, Mixing time of near-critical random graphs, Notes on ferromagnetic diluted \(p\)-spin model, Analyzing complex networks evolution through Information Theory quantifiers, Cores of random \(r\)-partite hypergraphs, Finiteness of outer automorphism groups of random right-angled Artin groups, Conflict and error prevention and detection in complex networks, Euler index in uncertain graph, Distance-sum heterogeneity in graphs and complex networks, Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search, Computational challenges in systems biology, Hierarchical random cellular neural networks for system-level brain-like signal processing, Comparison of relative density of two random geometric digraph families in testing spatial clustering, Assessing the quality of multilevel graph clustering, A discussion of the favorable factors for the economic system's utility growth rate, A fixed point theorem for a general epidemic model, On the radius of centrality in evolving communication networks, Thresholds and expectation-thresholds of monotone properties with small minterms, Synchronization of complex dynamical networks with discontinuous coupling signals, On minimum reload cost cycle cover, Identifying influential spreaders by weight degree centrality in complex networks, Learning network structures from contagion, Small subgraphs in the trace of a random walk, On robust clusters of minimum cardinality in networks, Hyperbolic graph generator, Recent advances in percolation theory and its applications, The Kuramoto model in complex networks, Data based identification and prediction of nonlinear and complex dynamical systems, Statistical physics of vaccination, On distribution function of the diameter in uncertain graph, Recent advances on failure and recovery in networks of networks, Incremental single-source shortest paths in digraphs with arbitrary positive arc weights, Tight bounds for the cover time of multiple random walks, Analysis of operating principles with S-system models, Risk estimation of infectious diseases determines the effectiveness of the control strategy, Generating directed networks with predetermined assortativity measures, Testing Linearity for Network Autoregressive Models, Optimal change point detection and localization in sparse dynamic networks, Correlation between graphs with an application to brain network analysis, Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs, Latent Space Modeling of Multidimensional Networks with Application to the Exchange of Votes in Eurovision Song Contest, Synchronization of energy transmission networks at low voltage levels, Networks beyond pairwise interactions: structure and dynamics, Compound Poisson models for weighted networks with applications in finance, High dimensional regression for regenerative time-series: an application to road traffic modeling, Large-scale estimation of random graph models with local dependence, Analytical and statistical studies of Rodriguez-Velazquez indices, Failure and communication in a synchronized multi-drone system, Reconstruction of graphs based on random walks, Random hypergraphs and topological gelation criterion for crosslinked polymer systems, Maximal paths in random dynamic graphs, Generating simple random graphs with prescribed degree distribution, Anomalous electrical and frictionless flow conductance in complex networks, The degree distribution of the generalized duplication model, Asymptotic normality of graph statistics, On the number of positive solutions of a nonlinear algebraic system, Spectral classes of regular, random, and empirical graphs, Fast probabilistic algorithms for Hamiltonian circuits and matchings, ILIGRA: an efficient inverse line graph algorithm, Enumeration of graphs with a heavy-tailed degree sequence, Invariant measures via inverse limits of finite structures, Degree sequences of random graphs, Refined pivot selection for maximal clique enumeration in graphs, Efficient algorithms for game-theoretic betweenness centrality, Modelling structured societies: a multi-relational approach to context permeability, Finding the shortest paths by node combination, Random half-integral polytopes, First cycles in random directed graph processes, An evolution of interval graphs, Measuring distances between complex networks, Average update times for fully-dynamic all-pairs shortest paths, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, Survival time of a random graph, Optimal and near-optimal broadcast in random graphs, Outer-totalistic cellular automata on graphs, Spectral clustering and the high-dimensional stochastic blockmodel, A comprehensive multi-local-world model for complex networks, Pinning synchronization of the complex networks with non-delayed and delayed coupling, Connected components and evolution of random graphs: An algebraic approach, Connectivity threshold for random chordal graphs, Effective degree network disease models, Relationship between degree-rank function and degree distribution of protein-protein interaction networks, Deterministic epidemiological models at the individual level, A quantum walk-assisted approximate algorithm for bounded NP optimisation problems, Herd behavior and financial crashes: an interacting particle system approach, On the chromatic number of random graphs, Colorings of spaces, and random graphs, Scaling limits and generic bounds for exploration processes, Matching theory -- a sampler: From Dénes König to the present, The number of possibilities for random dating, Connectivity and dynamics for random subgraphs of the directed cube, Generation of networks with prescribed degree-dependent clustering, Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses, The structure and function of networks, Average-case analysis of incremental topological ordering, Variance of the subgraph count for sparse Erdős-Rényi graphs, A diffusive strategic dynamics for social systems, Critical points for random Boolean networks, An exact probability distribution on the connectivity of random graphs, On sparse graphs with dense long paths, Low eigenvalues of Laplacian matrices of large random graphs, Degree distribution in discrete case, The distribution of the relative arc density of a family of interval catch digraph based on uniform data, Minimizing the expected complete influence time of a social network, Global stabilization of complex networks with digraph topologies via a local pinning algorithm, The average path length of scale free networks, Data analysis and the connectivity of random graphs, The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem, Finding clique clusters with the highest betweenness centrality, Uncovering latent structure in valued graphs: a variational approach, 2-Xor revisited: satisfiability and probabilities of functions, Analysis of Linux kernel as a complex network, Percolation of interdependent network of networks, Multidimensional epidemic thresholds in diffusion processes over interdependent networks, Survey sampling in graphs, A preferential attachment model with Poisson growth for scale-free networks, Dynamic graphs, A difference equation approach to statistical mechanics of complex networks, On the maximum betweenness improvement problem, Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs, Network evolution by different rewiring schemes, A complex network approach to text summarization, Central and local limit theorems for the coefficients of polynomials of binomial type, A branch-and-bound approach for maximum quasi-cliques, On pinning synchronization of complex dynamical networks, Distributed detection/localization of change-points in high-dimensional network traffic data, Network models and financial stability, Topology of random clique complexes, A scale-free graph model based on bipartite graphs, Graph spectra as a systematic tool in computational biology, Clique-based method for social network clustering, Uncertain multi-objective Chinese postman problem, A model of the emergence and evolution of integrated worldviews, New doubly-anomalous Parrondo's games suggest emergent sustainability and inequality, The largest tree in a random graph, Graph evolution by stochastic additions of points and lines, Computational experience with minimum spanning tree algorithms, Limit distribution for the existence of Hamiltonian cycles in a random graph, On the connectivity of random m-orientable graphs and digraphs, k-connectivity in random undirected graphs, Random subgraphs of the n-cycle, Heterogeneous investments induced by historical payoffs promote cooperation in spatial public goods games, Hysteresis and disorder-induced order in continuous kinetic-like opinion dynamics in complex networks, The hierarchy of block models, Estimation of the parameters in an expanding dynamic network model, Evolutionary game dynamics of combining the payoff-driven and conformity-driven update rules, Enhancing synchrony in asymmetrically weighted multiplex networks, Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks, Genetic networks encode secrets of their past, Load balanced distributed directories, Better immigration: prisoner's dilemma game with population change on dynamic network, Ponzi scheme diffusion in complex networks, Key node selection in minimum-cost control of complex networks, The relations between network-operation and topological-property in a scale-free and small-world network with community structure, The inverse contagion problem (ICP) vs. predicting site contagion in real time, when network links are not observable, Information spreading in complex networks with participation of independent spreaders, Communication policies in knowledge networks, Ferromagnetic transition in a simple variant of the Ising model on multiplex networks, A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters, A family of small-world network models built by complete graph and iteration-function, The impact of group propagation on rumor spreading in mobile social networks, Spin glass transition in a simple variant of the Ising model on multiplex networks, Berry-Esseen bounds for functionals of independent random variables, Threshold behaviors of social dynamics and financial outcomes of ponzi scheme diffusion in complex networks, Robustness analysis of complex networks with power decentralization strategy via flow-sensitive centrality against cascading failures, Unidirectional random growth with resetting, Patterns of a spatial exploration under time evolution of the attractiveness: persistent nodes, degree distribution, and spectral properties, Core structure: the coupling failure procedure in multiplex networks, Operation comfort of multistate system vs. the importance of its components, Algorithm for multiplex network generation with shared links, Social contagion model induced by the effect of distinct social contexts, A novel measure of edge and vertex centrality for assessing robustness in complex networks, A modified algorithm of multiplex networks generation based on overlapped links, Hidden symmetries in real and theoretical networks, Analysis on topological features of deterministic hierarchical complex network, Homological connectivity in random Čech complexes, Phase transition in cohomology groups of non-uniform random simplicial complexes, Non-equilibrium kinetic Biswas-Chatterjee-Sen model on complex networks, Turing patterns of an si epidemic model with cross-diffusion on complex networks, Generating weighted social networks using multigraph, Consensus reaching with the externality effect of social network for three-way group decisions, Graph \(r\)-hued colorings -- a survey, Regular pattern-free coloring, Matrix valued inverse problems on graphs with application to mass-spring-damper systems, Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes, The quadratic cycle cover problem: special cases and efficient bounds, An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm, Computational and analytical studies of the Randić index in Erdős-Rényi models, Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs, Synchronised firing patterns in a random network of adaptive exponential integrate-and-fire neuron model, An opposition-based memetic algorithm for the maximum quasi-clique problem, Explosive synchronization in populations of cooperative and competitive oscillators, Genetic network models and statistical properties of gene expression data in knock-out experiments, Black hole metric: overcoming the PageRank normalization problem, Dynamical patterns of epidemic outbreaks in complex heterogeneous networks, The asymptotic value of energy for matrices with degree-distance-based entries of random graphs, Effects of the spike timing-dependent plasticity on the synchronisation in a random Hodgkin-Huxley neuronal network, A new coupled disease-awareness spreading model with mass media on multiplex networks, The growth and form of tunnelling networks in ants, Epidemic spread in directed interconnected networks, Fourier analysis of a delayed Rulkov neuron network, Node overlap removal algorithms: a comparative study, Consistency and asymptotic normality of stochastic block models estimators from sampled data, Functional integration of ecological networks through pathway proliferation, Large-scale network motif analysis using compression, Networks, frictions, and price dispersion, Consensus reaching in social network DeGroot model: the roles of the self-confidence and node degree, Boolean dynamics of Kauffman models with a scale-free network, The relevance of xylem network structure for plant hydraulic efficiency and safety, On the line graph of a graph with diameter 2, Exponential-family random graph models for multi-layer networks, Adjusted QMLE for the spatial autoregressive parameter, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes, Bounds on maximum concurrent flow in random bipartite graphs, Instability and network effects in innovative markets, Measuring the robustness of a network using minimal vertex covers, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Model free estimation of graphical model using gene expression data, Social network formation and strategic interaction in large networks, The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation, PageRank's behavior under degree correlations, Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes, Adaptive synchronization in complex dynamical networks with coupling delays for general graphs, A Brouwer fixed-point theorem for graph endomorphisms, Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs, A combinatorial Li-Yau inequality and rational points on curves, Distributed transactional memory for general networks, Maximizing algebraic connectivity for certain families of graphs, A condition for cooperation in a game on complex networks, Invasion threshold in structured populations with recurrent mobility patterns, A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices, Evolving test instances of the Hamiltonian completion problem, Morse subgroups and boundaries of random right-angled Coxeter groups, Typical values of extremal-weight combinatorial structures with independent symmetric weights, Spectrum of Johnson graphs, Collapsibility of random clique complexes, A compartmental model for cyber-epidemics, On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs, Improving the filtering of branch-and-bound MDD solver, The power of adaptivity in source identification with time queries on the path, Quantifying the connectivity of scale-free and biological networks, Forbidden subgraphs in connected graphs, Sandwiching random graphs: universality between random graph models, Modeling the influence of information on the coevolution of contact networks and the dynamics of infectious diseases, Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA, Convergence to global consensus in opinion dynamics under a nonlinear voter model, A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon, A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph, Detecting local network motifs, Classification and estimation in the stochastic blockmodel based on the empirical degrees, Models and methods for solving the problem of network vulnerability, Searchability of central nodes in networks, Emergent behaviors in social networks of adaptive agents, Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\), Enumerating alternating matrix spaces over finite fields with explicit coordinates, PageRank on inhomogeneous random digraphs, Weighted dependency graphs, Asset price dynamics with heterogeneous beliefs and local network interactions, Heterogeneous beliefs in over-the-counter markets, Invasion fronts on graphs: the Fisher-KPP equation on homogeneous trees and Erdős-Réyni graphs, Sparse maximum-entropy random graphs with a given power-law degree distribution, Queues on a dynamically evolving graph, From ecology to finance (and back?): a review on entropy-based null models for the analysis of bipartite networks, Low-dimensional SIR epidemic models with demographics on heterogeneous networks, Density centrality: identifying influential nodes based on area density formula, Crossover phenomena in growth pattern of social contagions with restricted contact, Adjustable network reconstruction with applications to CDS exposures, Uncertain vertex coloring problem, Recovering nonuniform planted partitions via iterated projection, Synchronization of coupled networks with mixed delays by intermittent control, Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem, Measuring instance difficulty for combinatorial optimization problems, A network approach to link visibility and urban activity location, Approximate least squares estimation for spatial autoregressive models with covariates, Incentive-based search for equilibria in Boolean games, The maximum number of induced open triangles in graphs of a given order, Information integration from distributed threshold-based interactions, A new scale-free network model for simulating and predicting epidemics, Asymptotics of integrals of Betti numbers for random simplicial complex processes, Epidemic spreading on uniform networks with two interacting diseases, Trapping on modular scale-free and small-world networks with multiple hubs, The rumor diffusion process with emerging independent spreaders in complex networks, Group detection in complex networks: an algorithm and comparison of the state of the art, Epidemic spreading on weighted adaptive networks, Directionality of real world networks as predicted by path length in directed and undirected graphs, Network congestion analysis of gravity generated models, Topology of whole-brain functional MRI networks: improving the truncated scale-free model, Damage attack on complex networks, Dynamic range in small-world networks of Hodgkin-Huxley neurons with chemical synapses, Community structure inhibits cooperation in the spatial prisoner's dilemma, Network formation by contact arrested propagation, Equilibrium games in networks, A manipulator game model of urban public traffic network, Locating inefficient links in a large-scale transportation network, Degree correlations in signed social networks, Mining susceptibility gene modules and disease risk genes from SNP data by combining network topological properties with support vector regression, Limit theorems for topological invariants of the dynamic multi-parameter simplicial complex, An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs, Vibrational resonance in neuron populations with hybrid synapses, Simulating aggregates of bivalents in \(2n=40\) mouse meiotic spermatocytes through inhomogeneous site percolation processes, On the chromatic number of the preferential attachment graph, An uncertain chromatic number of an uncertain graph based on \(\alpha \)-cut coloring, On algebraic connectivity of directed scale-free networks, Disease dynamics and mean field models for clustered networks, Sparse networks with core-periphery structure, A fast randomized algorithm for partitioning a graph into paths of fixed length, Mixed connectivity properties of random graphs and some special graphs, Mathematical modeling applied to epidemics: an overview, Harnessing the power of deception in attack graph-based security games, Blocking adversarial influence in social networks, A model for random chain complexes, Modifying the network-based stochastic SEIR model to account for quarantine: an application to COVID-19, Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph, Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects, Pareto optimization for subset selection with dynamic cost constraints, Large cycles in random generalized Johnson graphs, The relative fit measure for evaluating a blockmodel, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Modeling functional connectivity on empirical and randomized structural brain networks, Phase transitions and percolation at criticality in enhanced random connection models, Truncated simulation and inference in edge-exchangeable networks, In defense of the indefensible: a very naïve approach to high-dimensional inference, A latent space model for multilayer network data, The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph, Best response dynamics on random graphs, The synchronized dynamics of time-varying networks, The Kronecker-clique model for higher-order clustering coefficients, Effects of population structure on the evolution of linguistic convention, Phases of small worlds: a mean field formulation, The impact of geometry on monochrome regions in the flip Schelling process, Sandwiching dense random regular graphs between binomial random graphs, Geodesic obstacle representation of graphs, On decay centrality, Topological features determining the error in the inference of networks using transfer entropy, On the significance of edges for connectivity in uncertain random graphs, Algorithmic upper bounds for graph geodetic number, Expansion in supercritical random subgraphs of the hypercube and its consequences, Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs, Sparse spatio-temporal autoregressions by profiling and bagging, Directed cycles and related structures in random graphs. I: Static properties, On dynamic network security: a random decentering algorithm on graphs, Nucleation of a three-state spin model on complex networks, Health behavior spreading with similar diminishing returns effect, The independent spreaders involved SIR rumor model in complex networks, Can rewiring strategy control the epidemic spreading?, Strong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamics, Investigating the relationship between \(k\)-core and \(s\)-core network decompositions, A small-world and scale-free network generated by Sierpinski pentagon, From the grid to the smart grid, topologically, Architectures engender crises: the emergence of power laws in social networks, A method of examining the structure and topological properties of public-transport networks, Controllability of the better chosen partial networks, Functional brain networks in Alzheimer's disease: EEG analysis based on limited penetrable visibility graph and phase space method, Role of delay-based reward in the spatial cooperation, Positive and negative effects of social impact on evolutionary vaccination game in networks, Gambler's ruin problem on Erdős-Rényi graphs, A distance constrained synaptic plasticity model of \textit{C. elegans} neuronal network, Empirical study of the role of the topology in spreading on communication networks, False beliefs in unreliable knowledge networks, An optimal approach for the critical node problem using semidefinite programming, SIS epidemic spreading with correlated heterogeneous infection rates, Evolutionary vaccination dynamics with internal support mechanisms, Equilibrium distributions in entropy driven balanced processes, Random numerical semigroups and a simplicial complex of irreducible semigroups, Random monomial ideals, Gaussianization of the spectra of graphs and networks. Theory and applications, Discovering patterns in time-varying graphs: a triclustering approach, Probabilistic frequent subtrees for efficient graph classification and retrieval, Fundamentals of spreading processes in single and multilayer complex networks, Reconstruction methods for networks: the case of economic and financial systems, Scale-free behavior of networks with the copresence of preferential and uniform attachment rules, Symmetric graph properties have independent edges, Spatial correlation as an early warning signal of regime shifts in a multiplex disease-behaviour network, Basin hopping networks of continuous global optimization problems, Underestimated cost of targeted attacks on complex networks, Local law and Tracy-Widom limit for sparse random matrices, Sharp thresholds for contagious sets in random graphs, Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models, The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices, Network linear discriminant analysis, A probabilistic spatial distribution model for wire faults in parallel network-on-chip links, New pinning synchronization of complex networks with time-varying coupling strength and nondelayed and delayed coupling, Explosive synchronization in mono and multilayer networks, The power grid as a complex network: a survey, Robustness analysis of static routing on networks, Transient fluctuation of the prosperity of firms in a network economy, The spreading of opposite opinions on online social networks with authoritative nodes, An imperfect competition on scale-free networks, Synchronization of mobile chaotic agents on connected networks, The first international competition on computational models of argumentation: results and analysis, A simple spectral algorithm for recovering planted partitions, Higher order assortativity in complex networks, An iteration method for computing the total number of spanning trees and its applications in graph theory, On the impact of configuration on abstract argumentation automated reasoning, Network entropy and systemic risk in dynamic banking systems, Homological connectedness of random hypergraphs, Evolution of the giant component in graphs on orientable surfaces, Coupling agent based simulation with dynamic networks analysis to study the emergence of mutual knowledge as a percolation phenomenon, Loss of conservation of graph centralities in reverse-engineered transcriptional regulatory networks, Vital layer nodes of multiplex networks for immunization and attack, Analysis of high structural class coupling in object-oriented software systems, A local-world evolving network model, Complexity and synchronization of the World Trade Web, A coarse-grained framework for spiking neuronal networks: between homogeneity and synchrony, Length of optimal path in random networks with strong disorder, Covering algorithms, continuum percolation and the geometry of wireless networks, Laplacian spectral moment and Laplacian Estrada index of random graphs, Flow shop scheduling problem with conflict graphs, Geodesic cycles in random graphs, Incentive-based search for efficient equilibria of the public goods game, Information content based model for the topological properties of the gene regulatory network of \textit{Escherichia coli}, A study of how the Watts-Strogatz model relates to an economic system's utility, A rumor spreading model considering the cumulative effects of memory, Control of multiagent systems: a stochastic pinning viewpoint, Network alignment by discrete Ollivier-Ricci flow, Same stats, different graphs (graph statistics and why we need graph drawings), Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints, Random toric surfaces and a threshold for smoothness, Sharp threshold phenomena in statistical physics, Application of pair approximation method to modeling and analysis of a marriage network, Active exploration for large graphs, Fast analytical methods for finding significant labeled graph motifs, A bilevel programming model for proactive countermeasure selection in complex ICT systems, Models of kleptoparasitism on networks: the effect of population structure on food stealing behaviour, Evolution of a modified binomial random graph by agglomeration, Random Laplacian matrices and convex relaxations, On the Lovász theta function and some variants, Law of large numbers for the largest component in a hyperbolic model of complex networks, Integer programming approach to static monopolies in graphs, A hybrid breakout local search and reinforcement learning approach to the vertex separator problem, Random flag complexes and asymptotic syzygies, Random sampling and greedy sparsification for matroid optimization problems, Elements of a theory of computer simulation. I, Tree and forest weights and their application to nonuniform random graphs, Complexity-theoretic models of phase transitions in search problems, Two-dimensional gauge theories of the symmetric group \(S_n\) and branched \(n\)-coverings of Riemann surfaces in the large-\(n\) limit, Criticality in random threshold networks: annealed approximation and beyond, A processor efficient MIS algorithm on random graphs, Evolution of the social network of scientific collaborations, Extremal problems and generalized degrees, Systemic risk in multiplex networks with asymmetric coupling and threshold feedback, Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction, Exploring networks with traceroute-like probes: Theory and simulations, Local heuristics and the emergence of spanning subgraphs in complex networks, Swarming on random graphs, Epidemics in adaptive social networks with temporary link deactivation, Non-consensus opinion models on complex networks, Epidemics spreading in interconnected complex networks, Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints, Another proof of Wright's inequalities, Bipartite structure of all complex networks, The evolution of the random reversal graph, Formation of a giant component in the intersection graph of a random chord diagram, The impact of network inhomogeneities on contagion and system stability, Fault-tolerant aggregation: flow-updating meets mass-distribution, Tree index of uncertain graphs, Complex networks: structure and dynamics, Kemeny's constant and the effective graph resistance, The von Neumann entropy of random multipartite graphs, Computing the threshold of the influence of intercellular nanotubes on cell-to-cell communication integrity, Learning structures of Bayesian networks for variable groups, A metric to compare vulnerability of the graphs of different sizes, On resilience of connectivity in the evolution of random graphs, Human dopamine receptors interaction network (DRIN): a systems biology perspective on topology, stability and functionality of the network, Structure learning of sparse directed acyclic graphs incorporating the scale-free property, Network structure and input integration in competing firing rate models for decision-making, SIR epidemics and vaccination on random graphs with clustering, Homology of multi-parameter random simplicial complexes, Detecting direct associations in a network by information theoretic approaches, Probabilistic and exact frequent subtree mining in graphs beyond forests, Model-based clustering of large networks, Decentralized guaranteed cost dynamic control for synchronization of a complex dynamical network with randomly switching topology, Universal construction mechanism for networks from one-dimensional symbol sequences, On the network topology of variance decompositions: measuring the connectedness of financial firms, Sharp vanishing thresholds for cohomology of random flag complexes, Online balanced graph avoidance games, Approximating \(k\)-cuts using network strength as a Lagrangean relaxation, Graph similarity scoring and matching, Synchronization in random networks with given expected degree sequences, Radio communication in random graphs, Improving the efficiency of attractor cycle identification in Boolean networks, Monotone properties of random geometric graphs have sharp thresholds, Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint), Optimizing node infiltrations in complex networks by a local search based heuristic, Scheduling identical jobs on uniform machines with a conflict graph, Critical nodes in interdependent networks with deterministic and probabilistic cascading failures, On the Hadwiger number of Kneser graphs and their random subgraphs, Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting, Comparing large-scale graphs based on quantum probability theory, Note on directed proper connection number of a random graph, Book embedding of complex network with community structure, Formation control of multi-agent systems with region constraint, Anatomy of the giant component: the strictly supercritical regime, A web model with power law exponents less than 2, Estimating the size of a hidden finite set: large-sample behavior of estimators, Search for an immobile hider on a stochastic network, Design and results of the second international competition on computational models of argumentation, Scalable and exact sampling method for probabilistic generative graph models, Simple epidemic network model for highly heterogeneous populations, Evolution of social networks, Colorings of partial Steiner systems and their applications, Strategies for network security, Time-varying network models, A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network, Model-free two-sample test for network-valued data, On obstacle numbers, Consistent structure estimation of exponential-family random graph models with block structure, The joint impact of bankruptcy costs, fire sales and cross-holdings on systemic risk in financial networks, Bifurcations, complex behaviors, and dynamic transition in a coupled network of discrete predator-prey system, Observer-based lag synchronization between two different complex networks, Bipartite and directed scale-free complex networks arising from zeta functions, On the estimation of correlation in a binary sequence model, Epidemiologic network inference, A decomposition approach for stochastic shortest-path network interdiction with goal threshold, On fractional cut covers, On Hamilton-cycles of random graphs, A new class of the planar networks with high clustering and high entropy, A note on parallel sampling in Markov graphs, Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs, Discrimination through versioning with advertising in social networks, A note on log-concave random graphs, Two-sided infinite-bin models and analyticity for Barak-Erdős graphs, The graph spectra and spectral moments of random graphs, Eigenvector-based identification of bipartite subgraphs, Model-based clustering with sparse covariance matrices, Asymptotic behavior of lifetime sums for random simplicial complex processes, Compiling CP subproblems to MDDs and d-DNNFs, Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations, The energy of random signed graph, On the strength of connectedness of a random hypergraph, An integer programming approach for finding the most and the least central cliques, On the average-case complexity of parameterized clique, The importance of contact network topology for the success of vaccination strategies, Epidemic control analysis: designing targeted intervention strategies against epidemics propagated on contact networks, Network impact on persistence in a finite population dynamic diffusion model: application to an emergent seed exchange network, New upper bound for the chromatic number of a random subgraph of a distance graph, Communication complexity of quasirandom rumor spreading, Activity maxima in some models of information networks with random weights and heavy tails, An average study of hypergraphs and their minimal transversals, Open shop scheduling problems with conflict graphs, Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams, Symmetric Graph Properties Have Independent Edges, Functional relation between fluctuation and node degree in coupled stochastic dynamical systems, Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group, A critical study of network models for neural networks and their dynamics, Human mobility and time spent at destination: impact on spatial epidemic spreading, A QSPR-like model for multilocus genotype networks of \textit{Fasciola hepatica} in Northwest Spain, On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph, Random Subgraphs in Sparse Graphs, A Hotelling-Type Network, A tutorial on methods for the modeling and analysis of social network data, Conditional estimation of exponential random graph models from snowball sampling designs, Constructions of independent sets in random intersection graphs, Optimization in Designing Complex Communication Networks, Growing Networks Driven by the Evolutionary Prisoner’s Dilemma Game, Modularity Maximization and Tree Clustering: Novel Ways to Determine Effective Geographic Borders, TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks, Some Introductory Notes on Random Graphs, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, A Network Structural Approach to the Link Prediction Problem, Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs, Explosive synchronization transitions in complex neural networks, Impact of the heterogeneity of adoption thresholds on behavior spreading in complex networks, A generative model for exploring structure regularities in attributed networks, Asymptotic theory of sparse Bradley-Terry model, Life-like network automata descriptor based on binary patterns for network classification, Uniform random posets, A review on complex system engineering, LP-based dual bounds for the maximum quasi-clique problem, The stable set problem: clique and nodal inequalities revisited, Edge instability: a critical parameter for the propagation and robustness analysis of large networks, Estimating social effects in a multilayered linear-in-means model with network data, Random networks are heterogeneous exhibiting a multi-scaling law, Pinning synchronization of complex networks with time-varying outer coupling and nonlinear multiple time-varying delay coupling, Competition between awareness and epidemic spreading in homogeneous networks with demography, Efficient methods for the distance-based critical node detection problem in complex networks, The minimum cost network upgrade problem with maximum robustness to multiple node failures, Introduction to Complex Networks: Structure and Dynamics, Concentration of maximum degree in random planar graphs, How is systemic risk amplified by three typical financial networks, An extended scale-free network evolution model based on star-like coupling motif embedding, Exact solution approaches for a class of bilevel fractional programs, Quantum walk inspired algorithm for graph similarity and isomorphism, Fair immunization and network topology of complex financial ecosystems, Spectral norm bounds for block Markov chain random matrices, Expander graphs and their applications, An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, The concentration of the maximum degree in the duplication-divergence models, Unveiling the truth in liquid democracy with misinformed voters, Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization, Reprint of: On the network topology of variance decompositions: measuring the connectedness of financial firms, Discussion about properties of first nearest neighbor graphs, The distribution of first hitting times of randomwalks on Erdős–Rényi networks, On the strength of connectedness of a random graph, Lectures on the Ising and Potts Models on the Hypercubic Lattice, Perspectives on exponential random graphs, A Comparison of Random Task Graph Generation Methods for Scheduling Problems, Randomized near-neighbor graphs, giant components and applications in data science, The correlation of metrics in complex networks with applications in functional brain networks, Random degree–degree correlated networks, Modeling interacting dynamic networks: I. Preferred degree networks and their characteristics, Modeling interacting dynamic networks: II. Systematic study of the statistical properties of cross-links between two networks with preferred degrees, Quasispecies dynamics on a network of interacting genotypes and idiotypes: formulation of the model, On the relationship between Gaussian stochastic blockmodels and label propagation algorithms, Analyzing complex networks through correlations in centrality measurements, Networks with preferred degree: a mini-review and some new results, A complex network approach to cloud computing, Role of the plurality rule in multiple choices, Rumor propagation with heterogeneous transmission in social networks, The distribution of first hitting times of random walks on directed Erdős–Rényi networks, Inference for dynamics of continuous variables: the extended Plefka expansion with hidden nodes, Generalizedk-core pruning process on directed networks, The effect of hubs and shortcuts on fixation time in evolutionary graphs, Sampling on bipartite networks: a comparative analysis of eight crawling methods, Two Hardness Results on Feedback Vertex Sets, Efficient Broadcasting in Random Power Law Networks, Network Measures in Civil Air Transport: A Case Study of Lufthansa, Statistical Characterization of a Small World Network Applied to Forest Fires, The fundamental group of random 2-complexes, On the Solvability of the Discrete Conductivity and Schrödinger Inverse Problems, The Kőnig graph process, Exact controllability of multiplex networks, Persistence of Network Synchronization under Nonidentical Coupling Functions, Global Network Cooperation Catalysed by a Small Prosocial Migrant Clique, Unimodular lattice triangulations as small-world and scale-free random graphs, Construction of Directed Assortative Configuration Graphs, Responsive immunization and intervention for infectious diseases in social networks, The application of complex network time series analysis in turbulent heated jets, Design and Engineering of External Memory Traversal Algorithms for General Graphs, Modeling and Designing Real–World Networks, Estimating Time-Varying Graphical Models, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, Probabilistic methods in group theory, A Random Graph With a Subcritical Number of Edges, Using Complex Network Topologies and Self-Organizing Maps for Time Series Prediction, Average case analysis of fully dynamic reachability for directed graphs, A hierarchy of randomness for graphs, Random Networks of Catalytic Biochemical Reactions, Evolution of random graph processes with degree constraints, Joint Vertex Degrees in the Inhomogeneous Random Graph Model ℊ(n,{pij}), ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH, The highly secure polynomial pool-based key pre-distribution scheme for wireless sensor network, On Stable Systems with Random Structure, Algorithmic Analysis of Blockchain Efficiency with Communication Delay, Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices, Исследование статистик графов ближайших соседей, Preferential attachment processes approaching the Rado multigraph, Percolation on spatial anisotropic networks*, Strong couplings for static locally tree-like random graphs, Modelling the Effects of Self-learning and Social Influence on the Diversity of Knowledge, From Mean-Field to Complex Topologies: Network Effects on the Algorithmic Bias Model, A PROBABILISTIC FRIENDSHIP NETWORK MODEL, Stolarsky–Puebla Index, The mean and variance of the distribution of shortest path lengths of random regular graphs, Random Simplicial Complexes: Models and Phenomena, Hurdle Blockmodels for Sparse Network Modeling, The Euler characteristic as a topological marker for outbreaks in vector-borne disease, Synchronization in complex networks with long-range interactions, A Unifying Generative Model for Graph Learning Algorithms: Label Propagation, Graph Convolutions, and Combinations, Finite size scaling functions of the phase transition in the ferromagnetic Ising model on random regular graphs, Financial networks and interconnectedness in an advanced emerging market economy, Liquidity Shock, Animal Spirits and Bank Runs, Random quantum graphs, Neuron dynamics variability and anomalous phase synchronization of neural networks, True scale-free networks hidden by finite size effects, Analyzing local and global properties of multigraphs, Correlation between weighted spectral distribution and average path length in evolving networks, Unnamed Item, Unnamed Item, Interactive social contagions and co-infections on complex networks, Small subgraphs and their extensions in a random distance graph, Maps on random hypergraphs and random simplicial complexes, Measuring Vertex Centrality Using the Holevo Quantity, Statistical monitoring of binary response attributed social networks considering random effects, Planarity and Genus of Sparse Random Bipartite Graphs, Integer Programming Formulations for Minimum Spanning Tree Interdiction, Exact and Approximation Algorithms for the Expanding Search Problem, Normal approximation for generalizedU-statistics and weighted random graphs, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism, Spanning Trees at the Connectivity Threshold, Exponentially time decaying susceptible-informed (SIT) model for information diffusion process on networks, Perfect matchings in inhomogeneous random bipartite graphs in random environment, Tight Localizations of Feedback Sets, An Exact Method for the Minimum Feedback Arc Set Problem, Unified functional network and nonlinear time series analysis for complex systems science: Thepyunicornpackage, Inter-layer synchronization in multiplex networks of identical layers, Solving distributed constraint optimization problems using logic programming, Detection of core–periphery structure in networks using spectral methods and geodesic paths, On random presentations with fixed relator length, Unnamed Item, Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices, The Construction and Properties of Assortative Configuration Graphs, Emergence of a spectral gap in a class of random matrices associated with split graphs, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, Detecting critical node structures on graphs: A mathematical programming approach, Reverse maximum flow problem under the weighted Chebyshev distance, Universality of local spectral statistics of random matrices, Optimal phase synchronization in networks of phase-coherent chaotic oscillators, Exploring the “Middle Earth” of network spectra via a Gaussian matrix function, Using global modeling to unveil hidden couplings in small network motifs, Bayesian inference of spreading processes on networks, Maximum likelihood estimation for discrete exponential families and random graphs, Unnamed Item, Unnamed Item, Nonuniversality of weighted random graphs with infinite variance degree, Spectral properties of the trap model on sparse networks, How to suppress dark states in quantum networks and bio-engineered structures, Sequential Shortest Path Interdiction with Incomplete Information, Unnamed Item, Small-world architecture of networked control systems, Hidden Population Size Estimation From Respondent-Driven Sampling: A Network Approach, Stretched exponential dynamics of coupled logistic maps on a small-world network, Random walks with long-range steps generated by functions of Laplacian matrices, Optimal imitation capacity and crossover phenomenon in the dynamics of social contagions, Most graphs are knotted, Network of interacting neurons with random synaptic weights, Inhomogeneous percolation models for spreading phenomena in random graphs, Ising spin glass models versus Ising models: an effective mapping at high temperature: II. Applications to graphs and networks, Review of statistical network analysis: models, algorithms, and software, A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs, Good and bad predictions: Assessing and improving the replication of chaotic attractors by means of reservoir computing, From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial), Enhancement of dynamical robustness in a mean-field coupled network through self-feedback delay, Multi-level Steiner Trees, Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity, Explosive synchronization in interlayer phase-shifted Kuramoto oscillators on multiplex networks, Dimension Estimation Using Random Connection Models, Percolation on an infinitely generated group, Hamiltonicity in random directed graphs is born resilient, The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms, Vanishing of cohomology groups of random simplicial complexes, Fast Iterative Solution of the Optimal Transport Problem on Graphs, Controllability of Network Opinion in Erdös--Rényi Graphs Using Sparse Control Inputs, Joint effects of the liability network and portfolio overlapping on systemic financial risk: contagion and rescue, Clustering in preferential attachment random graphs with edge-step, Unnamed Item, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, Polynomial network autoregressive models with divergent orders, On the normalized Laplacian spectra of random geometric graphs, A Model for Birdwatching and other Chronological Sampling Activities, A probabilistic approach to the leader problem in random graphs, Large deviations of the greedy independent set algorithm on sparse random graphs, Approximating sparse graphs: The random overlapping communities model, A proof of the Kahn–Kalai conjecture, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, Perfect matchings in random subgraphs of regular bipartite graphs, The giant component after percolation of product graphs, A local algorithm and its percolation analysis of bipartite z-matching problem, Cycle lengths in randomly perturbed graphs, Statistical Network Analysis: A Review with Applications to the Coronavirus Disease 2019 Pandemic, Approximation algorithms for Steiner forest: An experimental study, Epidemic models on social networks—With inference, Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous time, Hierarchical models for independence structures of networks, A matheuristic for the firefighter problem on graphs, The iterative independent model, Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes, Longest and shortest cycles in random planar graphs, Successive minimum spanning trees, Epidemics on networks with preventive rewiring, An agent-based and microsimulated model of the epidemiology impact of closure of schools during the COVID-19 pandemic in the region of Aysen in Chile, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, On maximum ratio clique relaxations, Influence of cumulative damage on synchronization of Kuramoto oscillators on networks, Network reliability: Heading out on the highway, Minimum k‐cores and the k‐core polytope, A Sum of Squares Characterization of Perfect Graphs, Feasibility assessments of a dynamical approach to compartmental modelling on graphs: scaling limits and performance analysis, Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs, A variant of the Erdős–Rényi random graph process, Concentration inequalities using approximate zero bias couplings with applications to Hoeffding’s statistic under the Ewens distribution, On the time to identify the nodes in a random graph, Unstable diffusion in social networks, Hypothesis testing for populations of networks, Peer effects and endogenous social interactions, Dynamical decoherence of a qubit coupled to a quantum dot or the SYK black hole, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, A combinatorial link between labelled graphs and increasingly labelled Schröder trees, Bounding robustness in complex networks under topological changes through majorization techniques, Navigational guidance -- a deep learning approach, Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach, Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas, Finding large rainbow trees in colourings of \(K_{n, n}\), Random hypergraphs, random simplicial complexes and their Künneth-type formulae, The birth of the strong components, Bayesian learning of graph substructures, Analyzing the extremization of opinions in a general framework of bounded confidence and repulsion, Connectivity and stochastic robustness of synchronized multi-drone systems, Sharp threshold for rigidity of random graphs, On the limiting spectral distributions of stochastic block models, Identification of network topology changes based on \(r\)-power adjacency matrix entropy, Distilling Importance Sampling for Likelihood Free Inference, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Latent Network Structure Learning From High-Dimensional Multivariate Point Processes, A compressed sensing based least squares approach to semi-supervised local cluster extraction, Formal entity graphs as complex networks: assessing centrality metrics of the archive of formal proofs, Two stage approach to functional network reconstruction for binary time-series, Clustering-based average state observer design for large-scale network systems, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, Connectivity of Poissonian inhomogeneous random multigraphs, Component behaviour and excess of random bipartite graphs near the critical point, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Asymptotic degree of random monomial ideals, Asymptotic uncertainty quantification for communities in sparse planted bi-section models, Threshold for Steiner triple systems, Modeling and pricing cyber insurance. Idiosyncratic, systematic, and systemic risks, Propagation Reversal for Bistable Differential Equations on Trees, Complex dynamics of COVID-19 mathematical model on Erdős–Rényi network, Contagion in graphons, Percolation of arbitrary uncorrelated nested subgraphs, Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs, Deterministic performance guarantees for bidirectional BFS on real-world networks, Efficient approaches for attaining epidemic-free networks with minimum edge removal set, Average case analysis of fully dynamic connectivity for directed graphs, Girth, magnitude homology and phase transition of diagonality, Stochastic recursions on directed random graphs, Phase transition in noisy high-dimensional random geometric graphs, Limiting spectral distribution of stochastic block model, Distributed web hacking by adaptive consensus-based reinforcement learning, Global dynamics of an endemic disease model with vaccination: analysis of the asymptomatic and symptomatic groups in complex networks, On the Concentration of the Maximum Degree in the Duplication-Divergence Models, Ordered scheduling in control-flow distributed transactional memory, The Erlang weighted tree, a new branching process, ROUTING STRATEGIES FOR SUPPRESSING TRAFFIC-DRIVEN EPIDEMIC SPREADING IN MULTIPLEX NETWORKS, Unnamed Item, Unnamed Item, Optimization via low-rank approximation for community detection in networks, Efficient algorithms for cluster editing, On the first cohomology of automorphism groups of graph groups, On connectivity and robustness of random graphs with inhomogeneity, Towards a Systematic Evaluation of Generative Network Models, The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes, A measure of dissimilarity between diffusive processes on networks, On the existence of a factor of degree one of a connected random graph, Block Matrix Formulations for Evolving Networks, Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms, Sparse inverse covariance estimation for high-throughput microRNA sequencing data in the Poisson log-normal graphical model, A novel approach based on multiple correspondence analysis for monitoring social networks with categorical attributed data, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Chimera-like states induced by additional dynamic nonlocal wirings, A bird’s-eye view of naming game dynamics: From trait competition to Bayesian inference, Reducing network size and improving prediction stability of reservoir computing, Activity maxima in random networks in the heavy tail case, Artificial Neural Networks Training Acceleration Through Network Science Strategies, The Study of the Statistical Characteristics of the Text Based on the Graph Model of the Linguistic Corpus, An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution, Unravelling Topological Determinants of Excitable Dynamics on Graphs Using Analytical Mean-field Approaches, Random Graphs and Their Subgraphs, The probability of connectedness of a large unlabelled graph, Explosive synchronization in frequency displaced multiplex networks, Phase transitions in graphs on orientable surfaces, Malleability of complex networks, Two faces of greedy leaf removal procedure on graphs, Random Čech complexes on Riemannian manifolds, Bipartitioning of directed and mixed random graphs, The three kinds of degree distributions and nash equilibrium on the limiting random network, Statistical properties of model kinship networks, Effect of overlap on spreading dynamics on multiplex networks, Co-evolution of strategies and update rules in the prisoner's dilemma game on complex networks, Almost all Steiner triple systems are almost resolvable, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, Bipartite quantum states and random complex networks, Average-Case Analysis of Online Topological Ordering, Bias in social interactions and emergence of extremism in complex social networks, Convex Optimization for Group Feature Selection in Networked Data, Random growth networks with exponential degree distribution, Network temporality can promote and suppress information spreading, Node Overlap Removal Algorithms: an Extended Comparative Study, First-Order Model-Checking in Random Graphs and Complex Networks, Non-concentration of the chromatic number of a random graph, Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice, EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH, A Geometric Preferential Attachment Model of Networks II, Collective communication and behaviour in response to uncertain ‘Danger’ in network experiments, Heterogeneity in evolutionary games: an analysis of the risk perception, CUSUM multi-chart for detecting unknown abrupt changes under finite measure space for network observation sequences, PERMUTATIONAL METHODS FOR PERFORMANCE ANALYSIS OF STOCHASTIC FLOW NETWORKS, On global site-percolation on the correlated honeycomb lattice, The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges, On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes, The diameter of sparse random graphs, Efficient routeing in Poisson small-world networks, CoReS: a tool for computing core graphs via SAT/SMT solvers, A polyhedral study of the maximum edge subgraph problem, A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time, Simple and efficient local codes for distributed stable network construction, Synchronization of Network-Coupled Oscillators with Uncertain Dynamics, The sharp threshold for jigsaw percolation in random graphs, Packet efficient implementation of the Omega failure detector, Random 2-XORSAT at the Satisfiability Threshold, The probability of unusually large components in the near-critical Erdős–Rényi graph, Disparity of clustering coefficients in the Holme‒Kim network model, An ensemble of random graphs with identical degree distribution, A classification of isomorphism-invariant random digraphs, Parametric controllability of the personalized PageRank: Classic model vs biplex approach, Expansion of Percolation Critical Points for Hamming Graphs, Unnamed Item, TheN-star network evolution model, Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees, Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities, Density decompositions of networks, Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs, Zero temperature Glauber dynamics on complex networks, Combined Hypothesis Testing on Graphs With Applications to Gene Set Enrichment Analysis, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, Community detection via a triangle and edge combination conductance partitioning, Evaluation of the Copycat Model for Predicting Complex Network Growth, Imperfect bifurcations in opinion dynamics under external fields, A Theory of Network Security: Principles of Natural Selection and Combinatorics, Unnamed Item, On solving the densestk-subgraph problem on large graphs, Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs, Social Opinion Influence on Epidemic Scenarios, Centrosymmetric stochastic matrices, Study of discrete automaton models of gene networks of nonregular structure using symbolic calculations, Fully Dynamic Connectivity Oracles under General Vertex Updates, Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback, Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth, Imaginary replica analysis of loopy regular random graphs, Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread, Spectral theory of sparse non-Hermitian random matrices, The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks, Multi-Level Steiner Trees., Analytical results for the distribution of first hitting times of random walks on random regular graphs
