Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 1 )

2019 ( 55 )

2018 ( 41 )

2017 ( 53 )

Custom range...

Search Results: 1 - 10 of 10200 matches for " Charles Bordenave "
All listed articles are free for downloading (OA Articles)
Page 1 /10200
Display every page Item
On the birth-and-assassination process, with an application to scotching a rumor in a network
Charles Bordenave
Mathematics , 2008,
Abstract: We give new formulas on the total number of born particles in the stable birth-and-assassination process, and prove that it has an heavy-tailed distribution. We also establish that this process is a scaling limit of a process of rumor scotching in a network, and is related to a predator-prey dynamics.
On the spectrum of sum and product of non-hermitian random matrices
Charles Bordenave
Mathematics , 2010,
Abstract: In this short note, we revisit the work of T. Tao and V. Vu on large non-hermitian random matrices with independent and identically distributed entries with mean zero and unit variance. We prove under weaker assumptions that the limit spectral distribution of sum and product of non-hermitian random matrices is universal. As a byproduct, we show that the generalized eigenvalues distribution of two independent matrices converges almost surely to the uniform measure on the Riemann sphere.
On Euclidean random matrices in high dimension
Charles Bordenave
Mathematics , 2012,
Abstract: In this note, we study the n x n random Euclidean matrix whose entry (i,j) is equal to f (|| Xi - Xj ||) for some function f and the Xi's are i.i.d. isotropic vectors in Rp. In the regime where n and p both grow to infinity and are proportional, we give some sufficient conditions for the empirical distribution of the eigenvalues to converge weakly. We illustrate our result on log-concave random vectors.
Extinction probability and total progeny of predator-prey dynamics on infinite trees
Charles Bordenave
Mathematics , 2012, DOI: 10.1214/EJP.v19-2361
Abstract: We consider the spreading dynamics of two nested invasion clusters on an infinite tree. This model was defined as the chase-escape model by Kordzakhia and it admits a limit process, the birth-and-assassination process, previously introduced by Aldous and Krebs. On both models, we prove an asymptotic equivalent of the extinction probability near criticality. In the subcritical regime, we give a tail bound on the total progeny of the preys before extinction.
Eigenvalues of Euclidean Random Matrices
Charles Bordenave
Mathematics , 2006,
Abstract: We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the almost sure convergence of the limiting spectral measure as the number of points goes to infinity. The moments of the limiting distribution are computed, and we prove that the limit of this limiting distribution as the density of points goes to infinity has a nice expression. We apply our results to the adjacency matrix of the geometric graph.
Navigation on a Poisson point process
Charles Bordenave
Mathematics , 2006, DOI: 10.1214/07-AAP472
Abstract: On a locally finite point set, a navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a tree known as the navigation tree. In this article, we analyze the properties of the navigation tree when the point set is a Poisson point process on $\mathbb{R}^d$. We examine the local weak convergence of the navigation tree, the asymptotic average of a functional along a path, the shape of the navigation tree and its topological ends. We illustrate our work in the small-world graphs where new results are established.
On quantum percolation in finite regular graphs
Charles Bordenave
Mathematics , 2014,
Abstract: The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate quantitatively the empirical measure of the eigenvalues and the delocalization of the eigenvectors to the spectrum of the adjacency operator of the percolation on the infinite graph. Secondly, we prove that percolation on an infinite regular tree with degree at least $3$ preserves the existence of an absolutely continuous spectrum if the removal probability is small enough. These two results are notably relevant for bond percolation on a uniformly sampled regular graph or a Cayley graph with large girth.
A new proof of Friedman's second eigenvalue Theorem and its extension to random lifts
Charles Bordenave
Mathematics , 2015,
Abstract: It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most $2\sqrt{d-1} +o(1)$ with probability tending to one as the size of the graph tends to infinity. We give a new proof of this statement. We also study related questions on random $n$-lifts of graphs and improve a recent result by Friedman and Kohler.
Resolvent of Large Random Graphs
Charles Bordenave,Marc Lelarge
Mathematics , 2007,
Abstract: We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such graphs. We illustrate our results on the uniform regular graphs, Erdos-Renyi graphs and preferential attachment graphs. We sketch examples of application for weighted graphs, bipartite graphs and the uniform spanning tree of n vertices.
Combinatorial optimization over two random point sets
Franck Barthe,Charles Bordenave
Mathematics , 2011,
Abstract: We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set, or the connected bipartite r-regular graph of minimal length. As the cardinal of the sets goes to infinity, we investigate the convergence of such bipartite functionals.
Page 1 /10200
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.