Search results for " Graphs"
showing 10 items of 62 documents
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
2010
AbstractWe report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson’s algorithm, and other (less sophisticated) dynamic algorithms. In our experiments, we considered as test sets several random, semi-random and worst-case inputs previously considered in the literature together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).
Riesz transform and vertical oscillation in the Heisenberg group
2023
We study the $L^{2}$-boundedness of the $3$-dimensional (Heisenberg) Riesz transform on intrinsic Lipschitz graphs in the first Heisenberg group $\mathbb{H}$. Inspired by the notion of vertical perimeter, recently defined and studied by Lafforgue, Naor, and Young, we first introduce new scale and translation invariant coefficients $\operatorname{osc}_{\Omega}(B(q,r))$. These coefficients quantify the vertical oscillation of a domain $\Omega \subset \mathbb{H}$ around a point $q \in \partial \Omega$, at scale $r > 0$. We then proceed to show that if $\Omega$ is a domain bounded by an intrinsic Lipschitz graph $\Gamma$, and $$\int_{0}^{\infty} \operatorname{osc}_{\Omega}(B(q,r)) \, \frac{dr}{…
Root cause analysis of large scale application testing results
2015
In this paper we present a new root cause analysis algorithm for discovering the most likely causes of the differences found in testing results of two versions of the same software. The problematic points in test and environment attribute hierarchies are presented to the user in compact way which in turn allows to save time on test result processing. We have proven that for clearly separated problem causes our algorithm gives exact solution. Practical application of described method is discussed.
Architettura barocca nella Sicilia orientale e progettazione del restauro: la conservazione della facciata della Chiesa di Santa Maria delle Stelle a…
2010
La tavola mostra alcuni elaborati estratti dal progetto di restauro della chiesa di Santa Maria delle Stelle a Comiso (RG), uno degli esempi più rappresentativi d'architettura barocca nella Sicilia orientale.
Graph-based minimal path tracking in the skeleton of the retinal vascular network
2012
This paper presents a semi-automatic framework for minimal path tracking in the skeleton of the retinal vascular network. The method is based on the graph structure of the vessel network. The vascular network is represented based on the skeleton of the available segmented vessels and using an undirected graph. Significant points on the skeleton are considered nodes of the graph, while the edge of the graph is represented by the vessel segment linking two neighboring nodes. The graph is represented then in the form of a connectivity matrix, using a novel method for defining vertex connectivity. Dijkstra and Floyd-Warshall algorithms are applied for detection of minimal paths within the graph…
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
The smallest singular value of a shifted $d$-regular random square matrix
2017
We derive a lower bound on the smallest singular value of a random d-regular matrix, that is, the adjacency matrix of a random d-regular directed graph. Specifically, let $$C_1<d< c n/\log ^2 n$$ and let $$\mathcal {M}_{n,d}$$ be the set of all $$n\times n$$ square matrices with 0 / 1 entries, such that each row and each column of every matrix in $$\mathcal {M}_{n,d}$$ has exactly d ones. Let M be a random matrix uniformly distributed on $$\mathcal {M}_{n,d}$$ . Then the smallest singular value $$s_{n} (M)$$ of M is greater than $$n^{-6}$$ with probability at least $$1-C_2\log ^2 d/\sqrt{d}$$ , where c, $$C_1$$ , and $$C_2$$ are absolute positive constants independent of any other parameter…
Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
2011
We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd\"{o}s-R\'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution, the survival probability typically decays exponentially with a (average) decay rate which depends non monotonically on the graph connectivity; when the degree of dilution is either very low or very high, stationary states, not affected by traps, get more likely giving rise to a survival probability decaying to a finite value. Both these features constitute a qualitative difference with re…
Prediction of lncRNA-Disease Associations from Tripartite Graphs
2021
The discovery of novel lncRNA-disease associations may provide valuable input to the understanding of disease mechanisms at lncRNA level, as well as to the detection of biomarkers for disease diagnosis, treatment, prognosis and prevention. Unfortunately, due to costs and time complexity, the number of possible disease-related lncRNAs verified by traditional biological experiments is very limited. Computational approaches for the prediction of potential disease-lncRNA associations can effectively decrease time and cost of biological experiments. We propose an approach for the prediction of lncRNA-disease associations based on neighborhood analysis performed on a tripartite graph, built upon …
Impacts écologiques des formes d'urbanisation : modélisations urbaines et paysagères
2015
The global increase of urbanization during the past decades have induced a progressive artificialization of natural environments. The building of transport infrastructures and new housings causes a landscape fragmentation in an irreversible way and a strong decrease of the connectivity of ecological habitats. Maintaining the functionality of ecological networks is becoming a major goal of sustainable urban planning policies. With a special focus on urban evolutions in the horizon 2030 in the urban area of Besançon in eastern France (residential development and road traffic evolutions), this thesis aims to assess the potential impact of urban forms on landscape connectivity of animal species…