Daniel Valesin

Bio: Daniel Valesin is an academic researcher from University of Groningen. The author has contributed to research in topics: Random graph & Mathematics. The author has an hindex of 9, co-authored 59 publications receiving 341 citations. Previous affiliations of Daniel Valesin include École Polytechnique Fédérale de Lausanne & University of British Columbia.

Metastable densities for the contact process on power law random graphs

Abstract: We consider the contact process on a random graph with fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett (2009), who showed that for arbitrarily small infection parameter $\lambda$, the survival time of the process is larger than a stretched exponential function of the number of vertices, $n$. We obtain sharp bounds for the typical density of infected sites in the graph, as $\lambda$ is kept fixed and $n$ tends to infinity. We exhibit three different regimes for this density, depending on the tail of the degree law.

Phase transition of the contact process on random regular graphs

Abstract: We consider the contact process with infection rate $\lambda $ on a random $(d+1)$-regular graph with $n$ vertices, $G_n$. We study the extinction time $\tau _{G_n}$ (that is, the random amount of time until the infection disappears) as $n$ is taken to infinity. We establish a phase transition depending on whether $\lambda $ is smaller or larger than $\lambda _1(\mathbb{T} ^d)$, the lower critical value for the contact process on the infinite, $(d+1)$-regular tree: if $\lambda \lambda _1(\mathbb{T} ^d)$, it grows exponentially with $n$. This result differs from the situation where, instead of $G_n$, the contact process is considered on the $d$-ary tree of finite height, since in this case, the transition is known to happen instead at the upper critical value for the contact process on $\mathbb{T} ^d$.

The contact process on finite homogeneous trees revisited

Abstract: We consider the contact process with infection rate on T d , the d-ary tree of height n. We study the extinction time Td , that is, the random time it takes for the infection to disappear when the process is started from full occupancy. We prove two conjectures of Stacey regarding Td . Let 2 denote the upper critical value for the contact process on the innite d-ary tree. First, if

Phase transition of the contact process on random regular graphs

Abstract: We consider the contact process with infection rate $\lambda$ on a random $(d+1)$-regular graph with $n$ vertices, $G_n$. We study the extinction time $\tau_{G_n}$ (that is, the random amount of time until the infection disappears) as $n$ is taken to infinity. We establish a phase transition depending on whether $\lambda$ is smaller or larger than $\lambda_1(\mathbb{T}^d)$, the lower critical value for the contact process on the infinite, $(d+1)$-regular tree: if $\lambda \lambda_1(\mathbb{T}^d)$, it grows exponentially with $n$. This result differs from the situation where, instead of $G_n$, the contact process is considered on the $d$-ary tree of finite height, since in this case, the transition is known to happen instead at the _upper_ critical value for the contact process on $\mathbb{T}^d$.

Phd by thesis

Abstract: Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Random graphs

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.

Convergence of probability measures

Abstract: The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks

Abstract: This article reviews and presents various solved and open problems in the development, analysis, and control of epidemic models. The proper modeling and analysis of spreading processes has been a long-standing area of research among many different fields, including mathematical biology, physics, computer science, engineering, economics, and the social sciences. One of the earliest epidemic models conceived was by Daniel Bernoulli in 1760, which was motivated by studying the spread of smallpox [1]. In addition to Bernoulli, there were many different researchers also working on mathematical epidemic models around this time [2]. These initial models were quite simplistic, and the further development and study of such models dates back to the 1900s [3]-[6], where still-simple models were studied to provide insight into how various diseases can spread through a population. In recent years, there has been a resurgence of interest in these problems as the concept of "networks" becomes increasingly prevalent in modeling many different aspects of the world today. A more comprehensive review of the history of mathematical epidemiology can be found in [7] and [8].