-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
implementation of Leeuw algorithm without nested function
- Loading branch information
Piotr Gawron
committed
Feb 20, 2018
1 parent
70a4420
commit 5887c3b
Showing
1 changed file
with
126 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,126 @@ | ||
using Combinatorics | ||
using DataStructures | ||
|
||
# implementation of J. De Leeuw Multivariate Cumulants in R (2012) | ||
|
||
function outer(a::Vector{T}, b::Vector{T}) where T<: AbstractFloat | ||
sa = size(a,1) | ||
sb = size(b,1) | ||
z = zeros(T, sa*sb) | ||
k = 1 | ||
for i = 1:sb | ||
for j = 1:sa | ||
@inbounds z[k] = a[j]*b[i] | ||
k += 1 | ||
end | ||
end | ||
return z | ||
end | ||
|
||
function setparts(n) | ||
ret = zeros(Int, n, length(partitions(collect(1:n)))) | ||
for (i, partition) in enumerate(partitions(collect(1:n))) | ||
group = 1 | ||
for p in partition | ||
for j in p | ||
ret[j,i] = group | ||
end | ||
group += 1 | ||
end | ||
end | ||
ret | ||
end | ||
|
||
function raw_moments_upto_p(x, p=4) | ||
n, m = size(x) | ||
if p==1 | ||
return vcat(1, mean(x, axis=2)) | ||
end | ||
y = zeros(eltype(x), (m+1)^p) | ||
for i in 1:n | ||
xi = vcat(1, x[i,:]) | ||
#z = kron([xi for _ in 1:p]...) | ||
z = xi | ||
for j in 2:p | ||
z = outer(xi, z) | ||
end | ||
y += z | ||
end | ||
reshape(y, repmat([m+1],p)...)./n | ||
end | ||
|
||
mutable struct CumulantsState | ||
spp::Array{Array{Int64,2}} | ||
qpp::Array{Int64} | ||
rpp::Array{Any} | ||
end | ||
|
||
function CumulantsState(ldim) | ||
spp = Array{Array{Int64,2}}(ldim) | ||
qpp = Array{Int64}(ldim) | ||
rpp = Array{Any}(ldim) | ||
return CumulantsState(spp, qpp, rpp) | ||
end | ||
|
||
function one_cumulant_from_raw_moments(state::CumulantsState, jnd, raw) | ||
jnd = [jnd[find(jnd.!=1)]...] - 1 | ||
nnd = length(jnd) | ||
ndr::Int64 = size(raw)[1] | ||
nrt = length(size(raw)) | ||
raw = state.rpp[nnd] | ||
nvar = ndr - 1 | ||
nraw = max(1, length(size(raw))) | ||
sp = state.spp[nraw] | ||
_, nbell = size(sp) | ||
sterm = 0.0 | ||
for i in 1:nbell | ||
ind = sp[:, i] | ||
und = unique(ind) | ||
term = state.qpp[length(und)] | ||
for j in und | ||
knd = jnd[find(ind.==j)] + 1 | ||
lnd = vcat(knd, repmat([1], nraw - length(knd))) | ||
term *= raw[lnd...] | ||
end | ||
sterm += term | ||
end | ||
return sterm | ||
end | ||
|
||
function cumulants_from_raw_moments(raw) | ||
dimr = size(raw) | ||
nvar::Int64 = dimr[1] | ||
cumu = zeros(eltype(raw), dimr...) | ||
nele = prod(dimr) | ||
ldim = length(dimr) | ||
state = CumulantsState(ldim) | ||
|
||
for i in 1:ldim | ||
state.spp[i] = setparts(i) | ||
state.qpp[i] = factorial(i) | ||
if mod(i,2)==1 | ||
state.qpp[i] = -state.qpp[i] | ||
end | ||
state.rpp[i] = raw[hcat([collect(1:nvar) for i in 1:i])...] | ||
end | ||
state.qpp = vcat(1, state.qpp) | ||
for i in 2:nele | ||
ind = ind2sub(dimr, i) | ||
cumu[i] = one_cumulant_from_raw_moments(state, ind, raw) | ||
end | ||
return cumu | ||
end | ||
|
||
function cumulants_upto_p(x, p = 4) | ||
return cumulants_from_raw_moments(raw_moments_upto_p(x, p)) | ||
end | ||
|
||
function first_four_cumulants(x) | ||
cumu = cumulants_upto_p(x) | ||
nsel = 2:size(cumu)[1] | ||
OrderedDict(:c1 => cumu[1, 1, 1, nsel], | ||
:c2 => cumu[1, 1, nsel, nsel], | ||
:c3 => cumu[1, nsel, nsel, nsel], | ||
:c4 => cumu[nsel, nsel, nsel, nsel] | ||
) | ||
end |