SearcharxivSearch

arXiv subjects

Serife Yilmaz

Publications and source records attributed to Serife Yilmaz.

4 recordsLinked to original sources

Schur Stability of Matrix Segment via Bialternate Product

In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues of two of three specially constructed matrices and the existence of eigenvalues belonging to the interval $[1,\infty)$ of the third matrix. A necessary and sufficient condition is given for the convex combinations of two stable matrices with rank one difference to be robust Schur stable. It is shown that the robust stability of the convex hull of a finite number of matrices whose two-by-two differences are of rank $1$ is equivalent to the robust stability of the segments formed by these matrices. Examples of applying the obtained results are given.

math.OC

Markovian city-scale modelling and mitigation of micro-particles from tyres

The recent uptake in popularity in vehicles with zero tailpipe emissions is a welcome development in the fight against traffic induced airborne pollutants. As vehicle fleets become electrified, and tailpipe emissions become less prevalent, non-tailpipe emissions (from tires and brake disks) will become the dominant source of traffic related emissions, and will in all likelihood become a major concern for human health. This trend is likely to be exacerbated by the heavier weight of electric vehicles, their increased power, and their increased torque capabilities, when compared with traditional vehicles. While the problem of emissions from tire wear is well-known, issues around the process of tire abrasion, its impact on the environment, and modelling and mitigation measures, remain relatively unexplored. Work on this topic has proceeded in several discrete directions including: on-vehicle collection methods; vehicle tire-wear abatement algorithms and controlling the ride characteristics of a vehicle, all with a view to abating tire emissions. Additional approaches include access control mechanisms to manage aggregate tire emissions in a geofenced area with other notable work focussing on understanding the particle size distribution of tire generated PM, the degree to which particles become airborne, and the health impacts of tire emissions. While such efforts are already underway, the problem of developing models to predict the aggregate picture of a network of vehicles at the scale of a city, has yet to be considered. Our objective in this paper is to present one such model, built using ideas from Markov chains. Applications of our modelling approach are given toward the end of this note, both to illustrate the utility of the proposed method, and to illustrate its application as part of a method to collect tire dust particles.

physics.soc-ph

On node ranking in graphs

The ranking of nodes in a network according to their ``importance'' is a classic problem that has attracted the interest of different scientific communities in the last decades. The current COVID-19 pandemic has recently rejuvenated the interest in this problem, as it is related to the selection of which individuals should be tested in a population of asymptomatic individuals, or which individuals should be vaccinated first. Motivated by the COVID-19 spreading dynamics, in this paper we review the most popular methods for node ranking in undirected unweighted graphs, and compare their performance in a benchmark realistic network, that takes into account the community-based structure of society. Also, we generalize a classic benchmark network originally proposed by Newman for ranking nodes in unweighted graphs, to show how ranks change in the weighted case.

physics.soc-ph

Kemeny-based testing for COVID-19

Testing, tracking and tracing abilities have been identified as pivotal in helping countries to safely reopen activities after the first wave of the COVID-19 virus. Contact tracing apps give the unprecedented possibility to reconstruct graphs of daily contacts, so the question is who should be tested? As human contact networks are known to exhibit community structure, in this paper we show that the Kemeny constant of a graph can be used to identify and analyze bridges between communities in a graph. Our "Kemeny indicator" is the change in Kemeny constant when a node or edge is removed from the graph. We show that testing individuals who are associated with large values of the Kemeny indicator can help in efficiently intercepting new virus outbreaks, when they are still in their early stage. Extensive simulations provide promising results in early identification and in blocking possible "super-spreaders" links that transmit disease between different communities.

physics.soc-ph