Searcharxiv⌕ Search

arXiv subjects

Tomasz Luczak

Publications and source records attributed to Tomasz Luczak.

11 recordsLinked to original sources
arXiv2018

Asymmetry and structural information in preferential attachment graphs

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erdős-Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with $m$ edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for $m=1$, and there is some non-negligible probability of symmetry for $m=2$. It was conjectured that these graphs are asymmetric when $m \geq 3$. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs.

math.PR↗
arXiv2017

Paths in hypergraphs: a rescaling phenomenon

Let $P^k_\ell$ denote the loose $k$-path of length $\ell$ and let define $f^k_\ell(n,m)$ as the minimum value of $Δ(H)$ over all $P^k_\ell$-free $k$-graphs $H$ with $n$ vertices and $m$ edges. In the paper we study the behavior of $f^4_2(n,m)$ and $f^3_3(n,m)$ and characterize the structure of extremal hypergraphs. In particular, it is shown that when $m\sim n^2/8$ the value of each of these functions drops down from $Θ(n^2)$ to $Θ(n)$.

math.CO↗
arXiv2013

Limit measures of inhomogeneous discrete-time quantum walks in one dimension

We treat three types of measures of the quantum walk (QW) with the spatial perturbation at the origin, which was introduced by [1]: time averaged limit measure, weak limit measure, and stationary measure. From the first two measures, we see a coexistence of the ballistic and localized behaviors in the walk as a sequential result following [1,2]. We propose a universality class of QWs with respect to weak limit measure. It is shown that typical spatial homogeneous QWs with ballistic spreading belong to the universality class. We find that the walk treated here with one defect also belongs to the class. We mainly consider the walk starting from the origin. However when we remove this restriction, we obtain a stationary measure of the walk. As a consequence, by choosing parameters in the stationary measure, we get the uniform measure as a stationary measure of the Hadamard walk and a time averaged limit measure of the walk with one defect respectively.

quant-ph↗
arXiv2012

On Erdos' extremal problem on matchings in hypergraphs

In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative for k=3 and n is large enough.

math.CO↗
arXiv2011

Trapping a particle of a quantum walk on the line

We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal coin-state of the walker.

quant-ph↗
arXiv2005

First Order Definability of Trees and Sparse Random Graphs

Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the first order descriptive complexity of G. We will show that almost surely D(G)=Θ(\ln n/\ln\ln n), where G is a random tree of order n or the giant component of a random graph G(n,c/n) with constant c>1. These results rely on computing the maximum of D(T) for a tree T of order n and maximum degree l, so we study this problem as well.

math.CO↗
arXiv2005

Unmodulated spin chains as universal quantum wires

We study a quantum state transfer between two qubits interacting with the ends of a quantum wire consisting of linearly arranged spins coupled by an excitation conserving, time-independent Hamiltonian. We show that if we control the coupling between the source and the destination qubits and the ends of the wire, the evolution of the system can lead to an almost perfect transfer even in the case in which all nearest-neighbour couplings between the internal spins of the wire are equal.

quant-ph↗
arXiv2003

Quantum walks on cycles

We consider asymptotic behaviour of a Hadamard walk on a cycle. For a walk which starts with a state in which all the probability is concentrated on one node, we find the explicit formula for the limiting distribution and discuss its asymptotic behaviour when the length of the cycle tends to infinity. We also demonstrate that for a carefully chosen initial state, the limiting distribution of a quantum walk on cycle can lie further away from the uniform distribution than its initial state.

quant-ph↗