Growth of Lévy trees

We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.     

基于方向信息测度的最小模糊度准则边缘检测

将像素点的方向信息测度作为判别边缘点的特性指标,借用Huang等构造的自适应确定分割阈值的思想,本文提出了一种基于方向信息测度的最小模糊度准则边缘检测方法。文中提出的方法,一方面由于采用了方向信息测度,可以很好地将边缘点和非边缘点区分开来;另一方面通过最小化模糊度,自适应地将给定图像的所有像素点按照方向信息测度分成两类,从而达到提取边缘的目的。实验结果证明,我们提出的方法能够很好地判别边缘点,有效地提取图像的边缘。     

Edge agreement of second-order multi-agent system with dynamic quantization via the directed edge Laplacian

This work explores the edge agreement problem of second-order multi-agent systems with dynamic quantization under directed communication. To begin with, by virtue of the directed edge Laplacian, we propose a model reduction representation of the closed-loop multi-agent system depending on the spanning tree subgraph. Considering the limitations of the finite bandwidth channels, the quantization effects of second-order multi-agent systems under directed graph are considered. The static quantizers generally contain a fixed quantization interval and infinite quantization level, which are, to some extent, inefficient and impractical. To further reduce the bit depth (number of bits available) and to obtain better precision, the dynamic quantized communication strategy referring to zooming in-zooming out scheme is required. Based on the reduced model associated with the essential edge Laplacian, the asymptotic stability of second-order multi-agent systems under dynamic quantized effects with only finite quantization level can be guaranteed. Finally, the simulation of altitude alignment of micro air vehicles is provided to verify the theoretical results.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

A forest building process on simple graphs

Consider the following process on a simple graph without isolated vertices: order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning forest of the graph.The probability of obtaining $k$ components in this process for complete bipartite graphs is determined as well as a formula for the expected number of components in any graph. A generic recurrence and some additional basic properties are discussed.     

On the index of powers of edge ideals

The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper, we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a function of the power of an edge ideal I is strictly increasing if I is linearly presented. Examples show that this needs not to be the case for monomial ideals generated in degree greater than two.     

NUMERICAL LOCALIZATION OF ELECTROMAGNETIC IMPERFECTIONS FROM A PERTURBATION FORMULA IN THREE DIMENSIONS

This work deals with the numerical localization of small electromagnetic inhomogeneities. The underlying inverse problem considers, in a three-dimensional bounded domain, the time-harmonic Maxwell equations formulated in electric field. Typically, the domain contains a finite number of unknown inhomogeneities of small volume and the inverse problem attempts to localize these inhomogeneities from a finite number of boundary measurements. Our localization approach is based on a recent framework that uses an asymptotic expansion for the perturbations in the tangential boundary trace of the curl of the electric field. We present three numerical localization procedures resulting from the combination of this asymptotic expansion with each of the following inversion algorithms： the Current Projection method, the MUltiple Signal Classification （MUSIC） algorithm, and an Inverse Fourier method. We perform a numerical study of the asymptotic expansion and compare the numerical results obtained from the three localization procedures in different settings.     

Edge colorings of graphs embeddable in a surface of low genus

In this paper, by using the Discharging Method, we show that any graph with maximum degree Δ 8 that is embeddable in a surface Σ of characteristic χ(Σ) 0 is class one and any graph with maximum degree Δ 9 that is embeddable in a surface Σ of characteristic χ(Σ) = − 1 is class one. For surfaces of characteristic 0 or −1, these results improve earlier results of Mel'nikov.     

On edge star sets in trees

Let A be a Hermitian matrix whose graph is G (i.e. there is an edge between the vertices i and j in G if and only if the (i,j) entry of A is non-zero). Let λ be an eigenvalue of A with multiplicity m_A(λ). An edge e=ij is said to be Parter (resp., neutral, downer) for λ,A if m_A(λ)−m_A−e(λ) is negative (resp., 0, positive ), where A−e is the matrix resulting from making the (i,j) and (j,i) entries of A zero. For a tree T with adjacency matrix A a subset S of the edge set of G is called an edge star set for an eigenvalue λ of A, if |S|=m_A(λ) and A−S has no eigenvalue λ. In this paper the existence of downer edges and edge star sets for non-zero eigenvalues of the adjacency matrix of a tree is proved. We prove that neutral edges always exist for eigenvalues of multiplicity more than 1. It is also proved that an edge e=uv is a downer edge for λ,A if and only if u and v are both downer vertices for λ,A; and e=uv is a neutral edge if u and v are neutral vertices. Among other results, it is shown that any edge star set for each eigenvalue of a tree is a matching.     

Covering projective planar graphs with three forests

It is known that all planar graphs and all projective planar graphs have an edge partition into three forests. Gonçalves proved that every planar graph has an edge partition into three forests, one having maximum degree at most four [5]. In this paper, we prove that every projective planar graph has an edge partition into three forests, one having maximum degree at most four.