scispace - formally typeset
Search or ask a question
Author

Clara Stegehuis

Bio: Clara Stegehuis is an academic researcher from University of Twente. The author has contributed to research in topics: Random graph & Degree (graph theory). The author has an hindex of 10, co-authored 53 publications receiving 483 citations. Previous affiliations of Clara Stegehuis include Eindhoven University of Technology.

Papers published on a yearly basis

Papers
More filters
Journal ArticleDOI
TL;DR: Two random graph models that create a network with similar community structure as a given network are studied: one model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees.
Abstract: Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both enforce as well as inhibit diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities.

145 citations

Journal ArticleDOI
TL;DR: Insight is provided into the influence of the impact factor and early citations on the long-term citation impact of a publication, and it takes a step toward a methodology that can be used to assess research institutions based on their most recently published work.

85 citations

Journal ArticleDOI
TL;DR: The recent literature on assemble-to-order systems is reviewed to serve as a reference for researchers working in the field and as a starting point for those who wish to begin to explore it.

60 citations

Journal ArticleDOI
TL;DR: It is shown that local clustering decreases with the hidden variable (or degree), and how the average clustering coefficient C scales with the network size N, as a function of h_{s} and h_{c}.
Abstract: We investigate the presence of triangles in a class of correlated random graphs in which hidden variables determine the pairwise connections between vertices. The class rules out self-loops and multiple edges. We focus on the regime where the hidden variables follow a power law with exponent τ∈(2,3), so that the degrees have infinite variance. The natural cutoff h_{c} characterizes the largest degrees in the hidden variable models, and a structural cutoff h_{s} introduces negative degree correlations (disassortative mixing) due to the infinite-variance degrees. We show that local clustering decreases with the hidden variable (or degree). We also determine how the average clustering coefficient C scales with the network size N, as a function of h_{s} and h_{c}. For scale-free networks with exponent 2<τ<3 and the default choices h_{s}∼N^{1/2} and h_{c}∼N^{1/(τ-1)} this gives C∼N^{2-τ}lnN for the universality class at hand. We characterize the extremely slow decay of C when τ≈2 and show that for τ=2.1, say, clustering starts to vanish only for networks as large as N=10^{9}.

34 citations

Journal ArticleDOI
TL;DR: This paper studies a third universal property: three-point correlations that suppress the creation of triangles and signal the presence of hierarchy, quantified in terms of c[over ¯](k), the probability that two neighbors of a degree-k node are neighbors themselves.
Abstract: Real-world networks often have power-law degrees and scale-free properties, such as ultrasmall distances and ultrafast information spreading. In this paper, we study a third universal property: three-point correlations that suppress the creation of triangles and signal the presence of hierarchy. We quantify this property in terms of c[over ¯](k), the probability that two neighbors of a degree-k node are neighbors themselves. We investigate how the clustering spectrum k↦c[over ¯](k) scales with k in the hidden-variable model and show that c[over ¯](k) follows a universal curve that consists of three k ranges where c[over ¯](k) remains flat, starts declining, and eventually settles on a power-law c[over ¯](k)∼k^{-α} with α depending on the power law of the degree distribution. We test these results against ten contemporary real-world networks and explain analytically why the universal curve properties only reveal themselves in large networks.

31 citations


Cited by
More filters
Proceedings ArticleDOI
22 Jan 2006
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

7,116 citations

Journal ArticleDOI
TL;DR: A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Abstract: Complex networks arise in a wide range of biological and sociotechnical systems. Epidemic spreading is central to our understanding of dynamical processes in complex networks, and is of interest to physicists, mathematicians, epidemiologists, and computer and social scientists. This review presents the main results and paradigmatic models in infectious disease modeling and generalized social contagion processes.

3,173 citations

MonographDOI
01 Jan 2017
TL;DR: This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.
Abstract: This rigorous introduction to network science presents random graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them. Classroom tested for over ten years, this text places recent advances in a unified framework to enable systematic study. Designed for a master's-level course, where students may only have a basic background in probability, the text covers such important preliminaries as convergence of random variables, probabilistic bounds, coupling, martingales, and branching processes. Building on this base - and motivated by many examples of real-world networks, including the Internet, collaboration networks, and the World Wide Web - it focuses on several important models for complex networks and investigates key properties, such as the connectivity of nodes. Numerous exercises allow students to develop intuition and experience in working with the models.

934 citations

Posted Content
TL;DR: In this article, the authors generalise l'estimateur bien connu de Hill de lindice d a fonction de reparatition avec queue de variation reguliere a une estimation de l'indice of a loi de valeurs extremes.
Abstract: On generalise l'estimateur bien connu de Hill de l'indice d'une fonction de reparatition avec queue de variation reguliere a une estimation de l'indice d'une loi de valeurs extremes. On demontre la convergence et la normalite asymptotique. On utilise l'estimateur pour certaines estimations comme celle d'une quantile elevee et d'un point d'extremite

655 citations

Journal ArticleDOI
02 Mar 2018-Science
TL;DR: The Science of Science (SciSci) as discussed by the authors provides a quantitative understanding of the interactions among scientific agents across diverse geographic and temporal scales, providing insights into the conditions underlying creativity and the genesis of scientific discovery, with the ultimate goal of developing tools and policies that have the potential to accelerate science.
Abstract: BACKGROUND The increasing availability of digital data on scholarly inputs and outputs—from research funding, productivity, and collaboration to paper citations and scientist mobility—offers unprecedented opportunities to explore the structure and evolution of science. The science of science (SciSci) offers a quantitative understanding of the interactions among scientific agents across diverse geographic and temporal scales: It provides insights into the conditions underlying creativity and the genesis of scientific discovery, with the ultimate goal of developing tools and policies that have the potential to accelerate science. In the past decade, SciSci has benefited from an influx of natural, computational, and social scientists who together have developed big data–based capabilities for empirical analysis and generative modeling that capture the unfolding of science, its institutions, and its workforce. The value proposition of SciSci is that with a deeper understanding of the factors that drive successful science, we can more effectively address environmental, societal, and technological problems. ADVANCES Science can be described as a complex, self-organizing, and evolving network of scholars, projects, papers, and ideas. This representation has unveiled patterns characterizing the emergence of new scientific fields through the study of collaboration networks and the path of impactful discoveries through the study of citation networks. Microscopic models have traced the dynamics of citation accumulation, allowing us to predict the future impact of individual papers. SciSci has revealed choices and trade-offs that scientists face as they advance both their own careers and the scientific horizon. For example, measurements indicate that scholars are risk-averse, preferring to study topics related to their current expertise, which constrains the potential of future discoveries. Those willing to break this pattern engage in riskier careers but become more likely to make major breakthroughs. Overall, the highest-impact science is grounded in conventional combinations of prior work but features unusual combinations. Last, as the locus of research is shifting into teams, SciSci is increasingly focused on the impact of team research, finding that small teams tend to disrupt science and technology with new ideas drawing on older and less prevalent ones. In contrast, large teams tend to develop recent, popular ideas, obtaining high, but often short-lived, impact. OUTLOOK SciSci offers a deep quantitative understanding of the relational structure between scientists, institutions, and ideas because it facilitates the identification of fundamental mechanisms responsible for scientific discovery. These interdisciplinary data-driven efforts complement contributions from related fields such as scientometrics and the economics and sociology of science. Although SciSci seeks long-standing universal laws and mechanisms that apply across various fields of science, a fundamental challenge going forward is accounting for undeniable differences in culture, habits, and preferences between different fields and countries. This variation makes some cross-domain insights difficult to appreciate and associated science policies difficult to implement. The differences among the questions, data, and skills specific to each discipline suggest that further insights can be gained from domain-specific SciSci studies, which model and identify opportunities adapted to the needs of individual research fields.

630 citations