19 citations · 41 across the 12 of their papers we have counts for
13 papers · 1 filter
Analysis of Clustering and Degree Index in Random Graphs and Complex Networks
Ümit Işlak, Barış Yeşiloğlu
The purpose of this paper is to analyze the degree index and clustering index in random graphs. The degree index in our setup is a certain measure of degree irregularity whose basi…
Mixing time bounds for edge flipping on regular graphs
Yunus Emre Demirci, Ümit Işlak, Alperen Özdemir
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions…
Mixing time bounds for edge flipping on regular graphs
Yunus Emre Demirci, Ümit Işlak, Alperen Yaşar Özdemir
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham in [CG12]. In the same paper, its eigenvalues and stationary dis…
On a cover time problem on a dynamic graph with steps at random times
Yunus Emre Demirci, Ümit Işlak, Mehmet Akif Yıldız
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of…
The Variance and the Asymptotic Distribution of the Length of Longest -alternating Subsequences
Recep Altar Çiçeksiz, Yunus Emre Demirci, Ümit Işlak
We obtain an explicit formula for the variance of the number of -peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of t…
On an alternative sequence comparison statistic of Steele
Ümit Işlak, Alperen Y. Özdemir
The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982. It was proposed a…
Asymptotic results on weakly increasing subsequences in random words
Ümit Işlak, Alperen Y. Özdemir
Let be a vector of i.i.d. random variables where 's take values over . The purpose of this paper is to study the number of weakly increasing s…
On Unfair Permutations
İlker Arslan, Ümit Işlak, Cihan Pehlivan
In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with…
A Central Limit Theorem for the Optimal Alignments Score in Multiple Random Words
Ruoting Gong, Christian Houdré, Ümit Işlak
Let , where , , be independent sequences of independent a…
A Central Limit Theorem for the Length of the Longest Common Subsequences in Random Words
Christian Houdré, Ümit Işlak
Let and be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and…
Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
Jay Bartroff, Larry Goldstein, Ümit Işlak
Threshold-type counts based on multivariate occupancy models with log concave marginals admit bounded size biased couplings under weak conditions, leading to new concentration of m…
Multivariate Concentration Inequalities with Size Biased Couplings
Subhankar Ghosh, Umit Islak
Let be a random vector with nonnegative coordinates having nonzero and finite variances. We prove concentration inequalities for using s…
Concentration inequalities via zero bias couplings
Larry Goldstein, Umit Islak
The tails of the distribution of a mean zero, variance random variable satisfy concentration of measure inequalities of the form for…